Finding small unsatisfiable cores to prove unsatisfiability of QBFs

9th International Symposium on Artificial Intelligence and Mathematics, ISAIM 2006

Volumn , Issue , 2006, Pages

  Interian, Yannet ^a   Corvera, Gabriel ^a   Selman, Bart ^a   Williams, Ryan ^b  

^a Department of Molecular Biology and Genetics   (United States)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN SATISFIABILITY; EVALUATION RESULTS; QBF SOLVERS; QUANTIFIED BOOLEAN FORMULAS; RANDOM FORMULAS; SAT SOLVERS; STOCHASTIC LOCAL SEARCHES; UNSATISFIABLE CORE;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DECISION THEORY; STOCHASTIC SYSTEMS;

BOOLEAN FUNCTIONS;

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

References (11)

1. Y. Boufkhad, O. Dubois, Y. Interian, and B. Selman. Regular random k-sat: Properties of balanced formulas. Journal of Automated Reasoning, 2005.
2. M. Cadoli, A. Giovanardi, and M. Schaerf. An algorithm to evaluate quantified boolean formu-lae. In AAAI '98/IAAI '98: Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence, pages 262-267. American Association for Artificial Intelligence, 1998.
3. H. Chen and Y. Interian. A Model for Generating Random Quantified Boolean Formulas. In Proc. of 9th International Joint Conference on Artificial Intelligence (IJCAI05), 2005.
4. G. Denquen and O. Dubois. kcnfs: An efficient solver for random k-sat formulae. Theory and Applications of Satisfiability Testing: 6th International Conference, SAT 2003,LCNS, Selected Revised Papers, 6:486-501, 2003.
5. R. Feldmann, B. Monien, and S. Schamberger. A distributed algorithm to evaluate quantified boolean formulae. In Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, (AAAI'00), pages 285-290, 2000.
6. I. P. Gent, H. H. Hoos, A. G. D. Rowley, and K. Smyth. Using stochastic local search to solve quantified boolean formulae. In CP, pages 348-362, 2003.
7. I. P. Gent and T. Walsh. Beyond NP: the QSAT phase transition. Proceedings of AAAI 1999, 1999.
8. E. Giunchiglia, M. Narizzano, and A. Tacchella. Backjumping for quantified boolean logic satisfiability. Artif. Intell., 145(1-2):99-120, 2003.
9. D. Mitchell, B. Selman, and H. Levesque. Hard and easy distributions of sat problems. In Proc. 10-th National Conf. on Artificial Intelligence, pages 459-465, 1992. (Pubitemid 23633548)
10. B. Selman, H. A. Kautz, and B. Cohen. Local search strategies for satisfiability testing. In Proceedings of the Second DIMACS Challange on Cliques, Coloring, and Satisfiability, Providence RI, 1993.
11. L. Simon, D. Le Berre, M. Narizzano, and A. Tacchella. The second qbf solvers comparative evaluation. In Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT2004), 2004.