Symmetry breaking in quantified boolean formulae

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 2262-2267

  Audemard, Gilles ^a   Jabbour, Saïd ^a   Saïs, Lakhdar ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUXILIARY VARIABLES; COMBINATORIAL PROBLEM; EXPERIMENTAL EVALUATION; ORDERS OF MAGNITUDE; QUANTIFIED BOOLEAN FORMULAS; REASONING TASKS; SEARCH EFFORTS; SYMMETRY-BREAKING;

ARTIFICIAL INTELLIGENCE;

BOOLEAN ALGEBRA;

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

References (13)

1. F. Aloul, A. Ramani, I. Markov, and K. Sakallah. Solving difficult instances of boolean satisfiability in the presence of symmetry. Technical report, University of Michigan, 2002.
2. G. Audemard, B. Mazure, and L. Sais. Dealing with symmetries in quantified boolean formulas. In proceedings of SAT, 2004.
3. M. Benedetti. sKizzo: a Suite to Evaluate and Certify QBFs. In Proc. of CADE, 2005.
4. B. Benhamou and L. Sais. Tractability through symmetries in propositional calculus. Journal of Automated Reasoning, 12(1):89-102, 1994.
5. J. Crawford, M. Ginsberg, E. Luck, and A. Roy. Symmetry-breaking predicates for search problems. In proceedings of KR, pages 148-159. 1996.
6. J. Crawford. A theorical analysis of reasoning by symmetry in first order logic. In Proceedings of Workshop on Tractable Reasonning, AAAI, pages 17-22, 1992.
7. I. Gent and B. Smith. Symmetry breaking in constraint programming. In Proceedings of ECAI, pages 599-603, 2000.
8. E. Giunchiglia, M. Narizzano, and A. Tacchella. Quantified Boolean Formulas satisfiability library (QBFLIB), 2001.
9. E. Giunchiglia, M. Narizzano, and A. Tacchella. QuBE : A system for deciding Quantified Boolean Formulas Satisfiability. In Proceedings of IJCAR, 2001.
10. H. Kleine-Büning, M. Karpinski, and A. Flögel. Resolution for quantified boolean formulas. Information and computation, 117(1):12-18, 1995.
11. R. Letz. Lemma and model caching in decision procedures for quantified boolean formulas. In Proceedings of Tableaux, pages 160-175, 2002.
12. B. McKay. nauty user's guide (version 1.5). Technical report, 1990.
13. L. Zhang and S. Malik. Towards a symmetric treatment of satisfaction and conflicts in quantified boolean formula evaluation. In Proceedings of the CP, pages 200-215, 2002.