Search
Now showing items 1-1 of 1
Beyond Q-Resolution and Prenex Form: a Proof System for Quantified Constraint Satisfaction
(Technische Universität Braunschweig, Institute of Theoretical Computer Science, 2014)
We consider the quanti fied constraint satisfaction problem (QCSP) which is to decide, given a structure and a first-order sentence (not assumed here to be in prenex form) built from conjunction and quanti fication, whether ...