ShatterPB: Symmetry-breaking for pseudo-Boolean formulas

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn , Issue , 2004, Pages 884-887

  Aloul, Fadi A ^b   Ramani, Arathi ^a   Markov, Igor L ^a   Sakallah, Karem A ^a  

^a University of Michigan   (United States)

^b AMERICAN UNIVERSITY IN DUBAI   (United Arab Emirates)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES;

BOOLEAN SATISFIABILITY (SAT); CONJUNCTION NORMAL FORM (CNF); INTEGER LINEAR PROGRAMMING (ILP); PERMUTATIONAL SYMMETRIES;

BOOLEAN FUNCTIONS;

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

References (19)

1. F. Aloul, A. Ramani, I. L. Markov, and K. Sakallah, "Generic ILP versus Specialized 0-1 ILP," in Proc. ICCAD, 450-457, 2002.
2. F. Aloul, A. Ramani, I. L. Markov, and K. Sakallah, "Symmetry- Breaking for Pseudo-Boolean Formulas," in SymCon, 1-12, 2003.
3. F. Aloul, A. Ramani, I. L. Markov, and K. Sakallah, "Solving Difficult Instances of Boolean Satisfiability in the Presence of Symmetries," to appear in IEEE Trans. on Computer Aided Design, September 2003.
4. F. Aloul, I. L. Markov, and K. Sakallah, "Shatter: Efficient Symmetry-Breaking for Boolean Satisfiability," in Proc. DAC, 836-839, 2003.
5. P. Barth, "A Davis-Putnam based Enumeration Algorithm for Linear Pseudo-Boolean Optimization," Technical Report MPI-I-95-2-003, MaxPlanck-Institut Für Informatik, 1995.
6. D. Chai and A. Kuehlmann, "A Fast Pseudo-Boolean Constraint Solver," in Proc. DAC, 830-835, 2003.
7. J. Crawford, M. Ginsberg, E. Luks, and A. Roy, "Symmetry-breaking predicates for search problems," in Proc. of the Intl. Conference Principles of Knowledge Representation and Reasoning, 148-159, 1996.
8. P. Darga, "SAUCY: Graph Automorphism Tool," http://www.eecs.umich.edu/~pdarga/pub/auto/saucy.html
9. M. Davis, G. Logemann, and D. Loveland, "A Machine Program for Theorem Proving," in Comm. of the ACM, 5(7), 394-397, 1962.
10. DIMACS Challenge benchmarks, ftp://Dimacs.rutgers.EDU/pub/challenge/sat/ benchmarks/cnf
11. M. Hall Jr., "The Theory of Groups", McMillan, 1959.
12. ILOG CPLEX, http://www.ilog.com/products/cplex.
13. B. McKay, "Practical Graph Isomorphism," in Congressus Numerantium, vol. 30, 45-87, 1981.
14. B. McKay, "NAUTY User's Guide, Version 1.5," Technical Report TR-CS-90-02, Dep. of Computer Science, Australian Nat. Univ., 1990.
15. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an Efficient SAT Solver," in Proc. DAC, 530-535, 2001.
16. G. Nam, F. Aloul, K. Sakallah, and R. Rutenbar, "A Comparative Study of Two Boolean Formulations of FPGA Detailed Routing Constraints," in Proc. of Intl. Symp. on Physical Design (ISPD), 222-227, 2001.
17. S. Preswitch, "Supersymmetric Modelling for Local Search", in Intl. Workshop on Symmetry on Constraint Satisfaction Problems, 2002.
18. SAT Competition 2002, http://www.satcomp.org
19. B. Selman, H. Kautz, and B. Cohen. "Noise strategies for local search," in Proc. AAAI, 337-343, 1994.