Learning to solve QBF

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2007, Pages 255-260

  Samulowitz, Horst ^a   Memisevic, Roland ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; HEURISTIC ALGORITHMS; LEARNING SYSTEMS; ONLINE SYSTEMS; OPTIMIZATION;

OPTIMAL HEURISTICS; QUANTIFIED BOOLEAN FORMULAS (QBF); TRUTH VALUE;

ARTIFICIAL INTELLIGENCE;

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

References (15)

1. Ali, M.; Safarpour, S.; Veneris, A.; Abadir, M.; and Drechsler, R. 2005. Post-verification debugging of hierarchical designs. In International Conf. on Computer Aided Design (ICCAD), 871-876.
2. Biere, A. 2004. Resolve and expand. In Seventh Interna tional Conference on Theory and Applications of Satisfiability Testing (SAT), 238-246.
3. Davis, M.; Logemann, G.; and Loveland, D. 1962. A machine program for theorem-proving. Communications ofthe ACM 4:394-397.
4. Hastie, T.; Tibshirani, R.; and Friedman, J. 2001. The Elements of Statistical Learning. Springer.
5. Hutter, F.; Hamadi, Y.; Hoos, H. H.; and Leyton-Brown, K. 2006. Performance prediction and automated tuning of randomized and parametric algorithms. In 12th International Conference on Constraint Programming, CP 06.
6. Lagoudakis, M., and Littman, M. 2001. Learning to select branching rules in the dpll procedure for satisfiability. In Workshop on Theory and Applications of Satisfiability Testing (SAT 01).
7. Letz, R. 2002. Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas. In Proceedings of Tableaux 2002, LNAI2381, 160-175. Springer.
8. Memisevic, R. 2006. An introduction to structured discriminative learning. Technical report, University of Toronto, Toronto, Canada.
9. Moskewicz, M.; Madigan, C.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an efficient sat solver. In Proc. of the Design Automation Conference (DAC). Narizzano, M.; Pulina, L.; and Taccchella, A. 2006. QBF solvers competitive evaluation (QBFEVAL). http://www.qbflib.org/qbfeval.
10. Narizzano, M.; Pulina, L.; and Tacchella, A. 2006. The third QBF solvers comparative evaluation. Journal on Satisfiability, Boolean Modeling and Computation 2:145-164.
11. Nudelman, E.; Leyton-Brown, K.; Devkar, A.; Shoham, Y.; and Hoos, H. 2004. Satzilla: An algorithm portfolio for sat. In Seventh International Conference on Theory and Applications of Satisfiability Testing, 13-14.
12. Samulowitz, H., and Bacchus, F. 2006. Binary clause reasoning in qbf. In Ninth International Conference on Theory and Applications of Satisfiability Testing (SAT 06).
13. Samulowitz, H., and Bacchus, F. 2007. Dynamically partitioning for solving qbf. In Tenth International Conference on Theory and Applications of Satisfiability Testing (SAT).
14. SHARCNET. 2007. Shared hierarchical academic research computing network, http://www.sharcnet.ca.
15. Zhang, L., and Malik, S. 2002. Towards symmetric treatment of conflicts and satisfaction in quantified boolean satisfiability solver. In Principles and Practice of Constraint Programming (CP2002), 185-199.