The achilles' heel of QBF

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2005, Pages 275-281

  Ansotegui, Carlos ^a   Gomes, Carla P ^a   Selman, Bart ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN SATISFIABILITY; NATURAL FRAMEWORK FOR CAPTURING PROBLEM; QUANTIFIED BOOLEAN FORMULAS (QBF);

ARTIFICIAL INTELLIGENCE; MULTI AGENT SYSTEMS; PLANNING; PROBLEM SOLVING;

BOOLEAN ALGEBRA;

EID: 29344447566     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Benedetti, M. 2004. Evaluating QBFs via symbolic Skolemization. In LPAR04.
2. Berre, D. L., and Simon, L. 2004. Fifty-five solvers in Vancouver: The SAT-04 competition. In Proc. SAT'04, LNCS.
3. Berre, D. L.; Narizzano, M.; Simon, L.; and Tacchella, A. 2004. The 2nd QBF solvers evaluation. Proc. SAT'04, LNCS.
4. Biere, A. 2004. Resolve and expand. Proc. SAT'04.
5. Buning, K.; Karpinski, M.; and Flogel, A. 1995. Resolution for QBF. Inf. Comput. 117(1):12-18.
6. Cadoli, M.; Schaerf, M.; Giovanardi, A.; and Giovanardi, M. 2002. An algorithm to evaluate QBF and its experimental evaluation. J. of Automated Reasoning 28(2):101-142.
7. Gent, I., and Rowley, A. 2003. Encoding connect-4 using QBF. In Modelling and Reformulating CSP, 78-93.
8. Gent, I.; Giunchiglia, E.; Narizzano, M.; Rowley, A.; and Tacchella, A. 2003. Watched data structures for QBF. SAT-03.
9. Gent, I. P.; Nightingale, P.; and Rowley, A. 2004. Encoding quantified CSPs as QBF. In ECAI'04, 176-180.
10. Giunchiglia, E.; Narizzano, M.; and Tacchella, A. 2001. QuBE: A system for deciding QBF. In Proc. of IJCAR'01).
11. Giunchiglia, E.; Narizzano, M.; and Tacchella, A. 2004. QBF reasoning on real-world instances. In SAT'04, LNCS.
12. Kautz, H. A., and Selman, B. 1992. Planning as satisfiability. In ECAI'92, 359-363.
13. Lets, R. 2002. Lemma and model caching in decision procedures for QBF. In Proc. TABLEAUX'02, 2002.
14. Madhusudan, P.; Nam, W.; and Alur, R. 2003. Symb. computational techniques for solving games. Elec. Notes Theor. Comp. Sci. 89(4).
15. Otwell, C.; Remshagen, A.; and Truemper, K. 2004. An effective QBF solver for planning problems. In MSV/AMCS, 311-316.
16. Pan, G., and Vardi, M. Y. 2004. Symbolic decision procedures for QBF. In SAT04.
17. Papadimitriou, C. 1995. Computational Complexity. Addison.
18. Rintanen, J. 1999. Constructing conditional plans by a theorem-prover. JAIR'99 10:323-352.
19. Thiffault, C.; Bacchus, F.; and Walsh, T. 2004. Solving non-clausal formulas with DPLL search. In CP04.
20. Tseitin, G. 1967-1970. On the complexity proofs in prepositional logics. In Autom. of Reas.: Classical Papers in Comp. Logic.
21. Walsh, T. 2003. Challenges for SAT and QBF. Keynote SAT-03.
22. Zhang, L., and Malik, S. 2002. Conflict driven learning in a QBF. In Proc. of ICCAD'02.
23. Zhang, L., and Malik, S. 2002. Towards a symmetric treatment of satisfaction and conflicts in QBF. In CP'02, 200-215.
24. Zhao, and Buning, K. 2004. Equivalence models for QBF. In SAT'04, LNCS.