Efficient symmetry breaking for Boolean satisfiability

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 271-276

  Aloul, Fadi A ^a   Sakallah, Karem A ^a   Markov, Igor L ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN SATISFIABILITY; CYCLE STRUCTURES; EFFICIENT CONSTRUCTION; EMPIRICAL DATA; ORDERS OF MAGNITUDE; SYMMETRY-BREAKING;

ARTIFICIAL INTELLIGENCE;

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

References (15)

1. F. Aloul, A. Ramani, I. Markov, and K. Sakallah, "Solving Difficult SAT Instances in the Presence of Symmetries," in Proc. Design Automation Conf. (DAC), pp. 731-736, 2002.
2. J. Crawford, M. Ginsberg, E. Luks, and A. Roy, "Symmetry-breaking predicates for search problems," in Proc. Intl. Conf. Principles of Knowledge Representation and Reasoning, pp. 148-159, 1996.
3. A. Biere, A. Cimatti, E. Clarke, M. Fujita, and Y. Zhu, "Symbolic Model Checking Using SAT Procedures Instead of BDDs," in Proc. Design Automation Conf (DAC), pp. 317-320, 1999.
4. DIMACS Challenge benchmarks in ftp://Dimacs.rutgers.EDU/pub/challenge/ sat/benchmarks/cnf
5. J. B. Fraleigh. A First Course in Abstract Algebra. 6th ed. Addison Wesley Longman, Reading, Massachusetts, 2000.
6. E. Goldberg and Y. Novikov, "BerkMin: A fast and robust SAT-solver," in Proc. Design, Automation, and Test in Europe Conf (DATE), pp. 142-149,2002.
7. B. McKay, "Practical Graph Isomorphism," in Congressus Numerantium, vol. 30, pp. 45-87, 1981. http://cs.anu.edu.au/~bdm/nauty/
8. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an Efficient SAT Solver," in Proc. Design Automation Conf (DAC), pp. 530-535,2001.
9. G. Nam, F. Aloul, K. Sakallah, and R. Rutenbar, "A Comparative Study of Two Boolean Formulations of FPGA Detailed Routing Constraints," in Proc. Intl. Symp. on Physical Design (ISPD), pp. 222-227, 2001.
10. SAT 2002 Competition, http://www.satlive.org/SATCompetition/ submittedbenchs.html
11. J. Silva and K. Sakallah, "GRASP: A New Search Algorithm for Satisfiability," in IEEE Trans, on Computers, 48(5), pp. 506-521, 1999.
12. E. Spitznagel, "Review of Mathematical Software, GAP," in Notices Amer. Math. Soc, 41(7), pp. 780-782, 1994.
13. P. Stephan, R. Brayton, and A. Sangiovanni-Vincentelli, "Combinational Test Generation Using Satisfiability," in IEEE Trans, on Computer-Aided Design, 15(9), pp. 1167-1175, 1996.
14. A. Urquhart, "Hard Examples for Resolution," in Journal of the ACM, 34(1), pp. 209-219, 1987.
15. M. N. Velev and R. E. Bryant, "Effective Use of Boolean Satisfiability Procedures in the Formal Verification of Superscalar and VLIW Microprocessors", in Proc. Design Automation Conf. (DAC), pp. 226-231,2001. Research Center