An analysis of backjumping and trivial truth in quantified Boolean formulas satisfiability

DOI10.1007/3-540-45411-X_13MaRDI QIDQ4799252zbMATH OpenFDO

Authors Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella

Publication date 18 March 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2175/21750111.htm

Mathematics Subject Classification ID

Recommendations

• Backjumping for quantified Boolean logic satisfiability
• Solution Directed Backjumping for QCSP
• Theory and Applications of Satisfiability Testing
• Formal Methods in Computer-Aided Design
• Contributions to the theory of practical quantified Boolean formula solving

Cited in

(2)

• Towards an efficient library for SAT: A manifesto
• Backjumping for quantified Boolean logic satisfiability

This page was built for publication: An analysis of backjumping and trivial truth in quantified Boolean formulas satisfiability

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