Propositional PSPACE reasoning with Boolean programs versus quantified Boolean formulas

DOI10.1007/978-3-540-27836-8_96MaRDI QIDQ5466546zbMATH OpenOpenAlexFDO

Authors Alan Skelley

Publication date 24 August 2005

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

Full work available at URL https://doi.org/10.1007/b99859

Mathematics Subject Classification ID

Complexity of proofs (03F20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 1471980
• Propositional dynamic logic with program quantifiers
• A satisfiability procedure for quantified Boolean formulae
• QUBOS: Deciding quantified Boolean logic using propositional satisfiability solvers
• scientific article; zbMATH DE number 3845549
• From (Quantified) Boolean Formulae to Answer Set Programming
• scientific article; zbMATH DE number 5139037
• Contributions to the theory of practical quantified Boolean formula solving
• scientific article; zbMATH DE number 3935012

Cited in

(3)

• Towards a unified complexity theory of total functions
• From (Quantified) Boolean Formulae to Answer Set Programming
• scientific article; zbMATH DE number 1471980 (Why is no real title available?)

This page was built for publication: Propositional PSPACE reasoning with Boolean programs versus quantified Boolean formulas

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