The complexity of quantified constraint satisfaction problems under structural restrictions
Year: 2005
Type: conference-paper
Abstract: We give a clear picture of the tractability/intractability frontier for quantified constraint satisfaction problems (QCSPs) under structural restrictions.On the negative side, we prove that checking QCSP satisfiability remains PSPACE-hard for all known structural properties more general than bounded treewidth and for the incomparable hypergraph acyclicity.Moreover, if the domain is not fixed, the problem is PSPACE-hard even for tree-shaped constraint scopes.On the positive side, we identify relevant tractable classes, including QCSPs with prefix ∃∀ having bounded hypertree width, and QCSPs with a bounded number of guards.The latter are solvable in polynomial time without any bound on domains or quantifier alternations.
Institutions: TU Wien, University of Calabria
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Funder: Austrian Science Fund
OpenAlex ID: W69475820
