QBF modeling: Exploiting player symmetry for simplicity and efficiency

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

Volumn 4121 LNCS, Issue , 2006, Pages 382-395

  Sabharwal, Ashish ^a   Ansotegui, Carlos ^b   Gomes, Carla P ^a   Hart, Justin W ^a   Selman, Bart ^a  

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

^b UNIVERSITY OF LLEIDA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FUNCTION EVALUATION; LOGIC PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING;

CONJUNCTIVE NORMAL FORM (CNF); DUAL ENCODING; INDICATOR VARIABLES; NONCLAUSAL ENCODINGS;

BOOLEAN FUNCTIONS;

EID: 33749575645     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814948_35     Document Type: Conference Paper

References (21)

1. C. Ansotegui, C. P. Gomes, and B. Selman. The Achilles' heel of QBF. In 20th AAAI, pages 275-281, Pittsburgh, PA, July 2005.
2. M. Benedetti. Extracting certificates from quantified Boolean formulas. In 19th IJCAI, pages 47-53, Edinburgh, Scotland, July 2005.
3. M. Benedetti. sKizzo: a suite to evaluate and certify QBFs. In 20th CADE, volume 3632 of LNCS, pages 369-376, Tallinn, Estonia, July 2005.
4. A. Biere. Resolve and expand. In 7th SAT, volume 3542 of LNCS, pages 59-70, Vancouver, BC, Canada, May 2004. Selected papers.
5. M. Cadoli, M. Schaerf, A. Giovanardi, and M. Giovanardi. An algorithm to evaluate QBFs and its experimental evaluation. J. Auto. Reas., 28(2):101-142, 2002.
6. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. CACM, 5:394-397, 1962.
7. I. P. Gent and A. G. Rowley. Encoding Connect-4 using quantified Boolean formulae. In Work. Modelling and Reform. CSP, pages 78-93, Ireland, Sept. 2003.
8. E. Giunchiglia, M. Narizzano, and A. Tacchella. QUBE: A symtem for deciding QBFs satisfiability. In IJCAR, vol. 2083 of LNCS, pg. 364-369, Italy, June 2001.
9. H. A. Kautz and B. Selman. Planning as satisfiability. In Proc., 10th Euro. Conf. on AI, pages 359-363, Vienna, Austria, Aug. 1992.
10. R. Letz. Lemma and model caching in decision procedures for quantified Boolean formulas. In TABLEAUX, vol. 2381 of LNCS, pg. 160-175, Denmark, July 2002.
11. P. Madhusudan, W. Nam, and R. Alur. Symbolic computation techniques for solving games. Elec. Notes TCS, 89(4), 2003.
12. M. Narizzano and A. Tacchella (Organizers). QBF 2005 evaluation, June 2005. URL http://www.qbflib.org/qbfeval/2005.
13. C. Otwell, A. Remshagen, and K. Truemper. An effective QBF solver for planning problems. In Proc. MSV/AMCS, pages 311-316, Las Vegas, NV, June 2004.
14. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
15. J. Rintanen. Improvements to the evaluation of quantified Boolean formulae. In 16th IJCAI, pages 1192-1197, Stockholm, Sweden, July 1999.
16. J. Rintanen. Partial implicit unfolding in the Davis-Putnam procedure for quantified Boolean formulae. In 8th Intl. Conf. Logic for Prog., AI, and Reason., volume 2250 of LNCS, pages 362-376, Havana, Cuba, Dec. 2001.
17. J. Rintanen. Constructing conditional plans by a theorem prover. JAIR, 10: 323-352, 1999.
18. L. J. Stockmeyer and A. R. Meyer. Word problems requiring exponential time. In Conf. Record of 5th STOC, pages 1-9, Austin, TX, Apr.-May 1973.
19. L. Zhang. Solving QBF by combining conjunctive and disjunctive normal forms. In 21th AAAI, Boston, MA, July 2006. To appear.
20. L. Zhang and S. Malik. Conflict driven learning in a quantified Boolean satisfiability solver. In ICCAD, pages 442-449, San Jose, CA, Nov. 2002.
21. L. Zhang and S. Malik. Towards a symmetric treatment of satisfaction and conflicts in QBF evaluation. In 8th CP, pages 200-215, Ithaca, NY, Sept. 2002.