QBF reasoning on real-world instances

Lecture Notes in Computer Science

Volumn 3542, Issue , 2005, Pages 105-121

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

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; BOOLEAN ALGEBRA; DECISION MAKING; HEURISTIC METHODS; INFORMATION ANALYSIS; LEARNING SYSTEMS;

FORMAL VERIFICATION; LEARNING PHASE; MONOTONES; QUANTIFIED BOOLEAN FORMULAS (QBFS);

REAL TIME SYSTEMS;

EID: 26444559520     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11527695_9     Document Type: Conference Paper

References (23)

1. C. Scholl and B. Becker. Checking equivalence for partial implementations. In 38th Design Automation Conference (DAC'01), 2001.
2. 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.
3. Jussi Rintanen. Constructing conditional plans by a theorem proven Journal of Artificial Intelligence Research, 10:323-352, 1999.
4. Claudio Castellini, Enrico Giunchiglia, and Armando Tacchella. Improvements to SAT-based conformant planning. In Proc. ECP, 2001.
5. Maher N. Mneimneh and Karem A. Sakallah. Computing vertex eccentricity in exponentially large graphs: QBF formulation and solution. In Theory and Applications of Satisfiability Testing, 6th International Conference, (SAT), volume 2919 of LNCS, pages 411-425. Springer, 2004.
6. I. Gent, E. Giunchiglia, M. Narizzano, A. Rowley, and A. Tacchella. Watched data structures for QBF solvers. In Enrico Giunchiglia and Armando Tacchella, editors, Theory and Applications of Satisfiability Testing, 6th International Conference, (SAT), volume 2919 of LNCS, pages 25-36. Springer, 2004.
7. E. Giunchiglia, M. Narizzano, and A. Tacchella. Monotone literals and learning in QBF reasoning. In Tenth International Conference on Principles and Practice of Constraint Programming, CP 2004, 2004.
8. E. Giunchiglia, M. Narizzano, and A. Tacchella. QuBE: an efficient QBF solver. In 5th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2004, 2004.
9. Enrico Giunchiglia, Massimo Narizzano, and Armando Tacchella. Learning for Quantified Boolean Logic Satisfiability. In Proc. 18th National Conference on Artificial Intelligence (AAAI) (AAAI'2002), pages 649-654, 2002.
10. 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.
11. 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.
12. Fady Copty, Limor Fix, Enrico Giunchiglia, Gila Kamhi, Armando Tacchella, and Moshe Vardi. Benefits of bounded model checking at an industrial setting. In Proc. 13th International Computer Aided Verification Conference (CAV), 2001.
13. D. Le Berre, L. Simon, and A. Tacchella. Challenges in the QBF arena: the SAT03 evaluation of QBF solvers. In Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), volume 2919 of LNCS. Springer Verlag, 2003.
14. M. Cadoli, A. Giovanardi, and M. Schaerf. An algorithm to evaluate quantified boolean formulae. In Proc. AAAI, 1998.
15. Guoqiang Pan and Moshe Y. Vardi. Optimizing a BDD-based modal solver. In Proceedings of the 19th International Conference on Automated Deduction, 2003.
16. Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC'01), June 2001.
17. J. P. Marques-Silva and K. A. Sakallah. GRASP - A New Search Algorithm for Satisfiability. In Proceedings of IEEE/ACM International Conference on Computer-Aided Design, pages 220-227, November 1996.
18. Roberto J. Bayardo, Jr. and Robert C. Schrag. Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference (AAAI-97/IAAI-97), pages 203-208, Menlo Park, July 27-31 1997. AAAI Press.
19. Ian P. Gent and Andrew G.D. Rowley. Solution learning and solution directed backjumping revisited. Technical Report APES-80-2004, APES Research Group, February 2004. Available from http//www.dcs.st-and.ac.uk/~apes/ apesreports.html.
20. H. Kleine-Büning, M. Karpinski, and A. Flögel. Resolution for quantified Boolean formulas. Information and computation, 117(1):12-18, 1995.
21. E. Giunchiglia, M. Narizzano, and A. Tacchella. Clause-term resolution and learning in quantified Boolean logic satisfiability, 2004. Submitted.
22. Enrico Giunchiglia, Massimo Narizzano, and Armando Tacchella. Backjumping for Quantified Boolean Logic Satisfiability. Artificial Intelligence, 145:99-120, 2003.
23. Jussi Rintanen. Partial implicit unfolding in the Davis-Putnam procedure for Quantified Boolean Formulae. In Proc. LPAR, volume 2250 of LNCS, pages 362-376, 2001.