Existentially restricted quantified constraint satisfaction

DOI10.1016/j.ic.2008.11.001zbMath1168.68017OpenAlexW1986406042MaRDI QIDQ1013082

Hubie Chen

Publication date: 16 April 2009

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2008.11.001

zbMATH Keywords

computational complexityproof systemquantified constraint satisfaction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} ⋮ Quantified Constraints in Twenty Seventeen ⋮ Decomposing Quantified Conjunctive (or Disjunctive) Formulas ⋮ On the Exact Complexity of Evaluating Quantified k-CNF

Cites Work

• Unnamed Item
• Unnamed Item
• Constraints, consistency and closure
• On the algebraic structure of combinatorial problems
• Resolution for quantified Boolean formulas
• Combinatorial problems raised from 2-semilattices
• Complexity Classifications of Boolean Constraint Satisfaction Problems
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Closure properties of constraints
• The complexity of maximal constraint languages
• The complexity of satisfiability problems
• STACS 2005
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: Existentially restricted quantified constraint satisfaction