Looking algebraically at tractable quantified Boolean formulas

DOI10.1007/11527695_6MaRDI QIDQ5714774zbMATH OpenOpenAlexFDO

Authors Hubie Chen, Víctor Dalmau

Publication date 16 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11527695, http://www.satisfiability.org/SAT04/programme/91.pdf

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On models for quantified Boolean formulas
• The complexity of problems for quantified constraints
• Backdoor sets of quantified Boolean formulas
• The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case
• Backdoor Sets of Quantified Boolean Formulas

This page was built for publication: Looking algebraically at tractable quantified Boolean formulas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714774)