Monotone literals and learning in QBF reasoning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3258, Issue , 2004, Pages 260-273

  Giunchiglia, Enrico ^a   Narizzano, Massimo ^a   Tacchella, Armando ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER PROGRAMMING; CONSTRAINT THEORY; EMBEDDED SYSTEMS;

EFFICIENT IMPLEMENTATION; LITERALS; PROPOSITIONAL SATISFIABILITY; QBF SOLVERS; QUANTIFIED BOOLEAN FORMULAS; SAT INSTANCES; SAT SOLVERS; STATE OF THE ART;

BOOLEAN FUNCTIONS;

EID: 35048815626     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30201-8_21     Document Type: Article

References (20)

1. M. Cadoli, M. Schaerf, A. Giovanardi, and M. Giovanardi. An algorithm to evaluate quantified boolean formulae and its experimental evaluation. Journal of Automated Reasoning, 28(2):101-142, 2002.
2. E. Giunchiglia, M. Narizzano, and A. Tacchella. Learning for Quantified Boolean Logic Satisfiability. In 18th National Conference on Artificial Intelligence (AAAI 2002). AAAI Press/MIT Press, 2002.
3. D. Le Berre, L. Simon, and A. Tacchella. Challenges in the QBF arena: the SAT'03 evaluation of QBF solvers. In Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), volume 2919 of Lecture Notes in Computer Science. Springer Verlag, 2003.
4. E. Giunchiglia, M. Narizzano, and A. Tacchella. QuBE: A system for deciding Quantified Boolean Formulas satisfiability. In First International Joint Conference on Automated Reasoning (IJCAR 2001), volume 2083 of Lecture Notes in Artificial Intelligence. Springer Verlag, 2001.
5. E. Giunchiglia, M. Narizzano, and A. Tacchella. Backjumping for Quantified Boolean Logic Satisfiability. In Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001). Morgan Kaufmann, 2001.
6. E. Giunchiglia, M. Narizzano, and A. Tacchella. Backjumping for Quantified Boolean Logic satisfiability. Artificial Intelligence, 145:99-120, 2003.
7. E. Giunchiglia, M. Narizzano, and A. Tacchella. QBF reasoning on real-world instances. In 7th International Conference on Theory and Applications of Satisfiability Testing (SAT 2004), 2004. Accepted, final version pending.
8. I.P. Gent, E. Giunchiglia, M. Narizzano, A. Rowley, and A. Tacchella. Watched Data Structures for QBF Solvers. In Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), volume 2919 of Lecture Notes in Computer Science. Springer Verlag, 2003.
9. C. Scholl and B. Becker. Checking equivalence for partial implementations. In 38th Design Automation Conference (DAC'01), 2001.
10. Abdelwaheb Ayari and David Basin. Bounded model construction for monadic second-order logics. In 12th International Conference on Computer-Aided Verification (CAV'00), number 1855 in LNCS, pages 99-113. Springer-Verlag, 2000.
11. J. Rintanen. Constructing conditional plans by a theorem proven Journal of Artificial Intelligence Research, 10:323-352, 1999.
12. C. Castellini, E. Giunchiglia, and A. Tacchella. Sat-based planning in complex domains: Concurrency, constraints and nondeterminism. Artificial Intelligence, 147(1):85-117, 2003.
13. E. Giunchiglia, M. Maratea, and A. Tacchella. (Ineffectiveness of Look-Ahead Techniques in a Modern SAT Solver. In 9th Conference on Principles and Practice of Constraint Programming (CP 2003), volume 2833 of Lecture Notes in Computer Science. Springer Verlag, 2003.
14. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference (DAC'01), pages 530-535, 2001.
15. E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT-solver. In Design, Automation, and Test in Europe (DATE '02), pages 142-149, March 2002.
16. J. W. Freeman. Improvements to propositional satisfiability search algorithms. PhD thesis, University of Pennsylvania, 1995.
17. A. Kuehlmann, M. K. Ganai, V. Paruthi. Circuit-based Boolean Reasoning. In 38th Design Automation Conference, 2001.
18. M. Cadoli, M. Schaerf, A. Giovanardi, and M. Giovanardi. An Algorithm to Evaluate Quantified Boolean Formulae and its Experimental Evaluation. In Highlights of Satisfiability Research in the Year 2000. IOS Press, 2000.
19. R. Letz. Lemma and model caching in decision procedures for quantified boolean formulas. In Proceedings of Tableaux 2002, LNAI 2381, pages 160-175. Springer, 2002.
20. L. Zhang and S. Malik. Conflict driven learning in a quantified boolean satisfiability solver. In Proceedings of International Conference on Computer Aided Design (ICCAD'02), 2002.