The SAT-UNSAT transition in the adversarial SAT problem

Marco Bardoscia, Daniel Nagaj, Antonello Scardicchio

Adversarial SAT (AdSAT) is a generalization of the satisfiability (SAT) problem in which two players try to make a boolean formula true (resp. false) by controlling their respectiv…