Quantified constraint satisfaction and bounded treewidth
Hubie Chen · BIROn (Birkbeck, University of London) · 2004
Because the constraint satisfaction problem (CSP) is in general intractable, restricted cases of the CSP that are polynomial-time tractable have been heavily sought after. One class of restrictions that has been studied are variable-based restrictions, which concern the interaction among variables. In this paper, we consider the quantified constraint satisfaction problem (QCSP), a framework more general than the CSP. We present a QCSP tractability result arising from variable-based restrictions by giving a polynomial time algorithm for certain classes of QCSP instances having bounded treewidth.