Publication V

Abstract

We consider two-player constraint satisfaction games on systems of Boolean constraints, in which the players take turns in selecting one of the available variables and setting it to true or false, with the goal of maximising (for Player I) or minimising (for Player II) the number of satisfied constraints. Unlike in standard QBF-type variable assignment… (More)

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.