Automatically exploiting symmetries in constraint programming

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

Volumn 3419 LNAI, Issue , 2005, Pages 98-112

  Ramani, Arathi ^a   Markov, Igor L ^a  

^a University of Michigan   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL METHODS; LOGIC CIRCUITS; NONLINEAR EQUATIONS; OPTIMIZATION; PROBLEM SOLVING;

BOOLEAN LOGIC CIRCUITS; CONSTRAINT PROGRAMMING; PSEUDO-BOOLEAN (PB) CONSTRAINTS;

CONSTRAINT THEORY;

EID: 26844512114     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11402763_8     Document Type: Conference Paper

References (28)

1. F. A. Aloul, A. Ramani, I. L. Markov, K. A. Sakallah, "Solving Difficult SAT Instances In The Presence of Symmetry", IEEE Transactions on CAD, vol. 22(9), pp. 1117-1137, 2003.
2. F. A. Aloul, A. Ramani, I. L. Markov, K. A. Sakallah, "Generic ILP versus Specialized 0-1 ILP: An Update", in Proceedings of the International Conference on Computer-Aided Design, pp. 450-457, 2002.
3. F. A. Aloul, I. L. Markov, K. A. Sakallah, "Shatter: Efficient Symmetry-Breaking for Boolean Satisfiability", in Proc. Intl. Joint Conf. on AI, pp. 271-282, 2003.
4. F. A. Aloul, A. Ramani, I. L. Markov, K. A. Sakallah, "Symmetry-Breaking for PseudoBoolean Formulas", in Proceedings of the Asia-South Pacific Design Automation Conference, pp. 884-887, 2004.
5. O. Bailleux, Y. Boufkhad, "Efficient CNF Encoding of Boolean Cardinality Constraints", Proc. Principles and Practice of Constr. Prog., pp. 109-122, 2003.
6. O. Bailleux, Y. Boufkhad, "Full CNF Encoding: The Counting Constraints Case", in 7th Intl. Conf. on Theory and Applications of SAT Testing, 2004.
7. D. Chai, A. Kuehlmann, "A fast pseudo-boolean constraint solver", in Proceedings of the Design Automation Conference, pp.830-835, 2003.
8. C. H Colbourn, J. H. Dinitz, "The CRC Handbook of Combinatorial Designs", CRC Press, 1996.
9. J. Crawford, M. Ginsburg, E. M. Luks, A. Roy, "Symmetry-breaking predicates for search problems", in Proc. of the Intl. Conf. on Principles of Knowledge Representation and Reasoning, pp. 148-159, 1996.
10. P. Darga, "SAUCY Man Page", http://vlsicad.eecs.umich.edu/BK/SAUCY/
11. A.M. Frisch, I. Miguel, T. Walsh, "Cgrass: A System for Transforming Constraint Satisfaction Problems", Jt. Workshop of ERCIM/CologNet area on Constr. Solving and Constr. Logic Prog., pp. 23-26, 2002.
12. I. P. Gent, W. Harvey, T. Kelsey, S. Linton, "Generic SBDD using Computational Group Theory", in Principles and Practice of Constr. Prog., pp. 333-347, 2003.
13. I. P. Gent, T. Walsh, B. Selman, CSPLib Problem Library for Constraints; http://www.csplib.org
14. Z. Kiziltan, "Symmetry Breaking Ordering Constraints", Doctoral Thesis, Uppsala University, 2004.
15. A.Lal, B. Choueiry, "Dynamic Detection and Exploitation of Value Symmetries for Non-Binary Finite CSPs", Workshop on Symmetry in CSPs, 2003.
16. B. McKay, "Practical Graph Isomorphism", Congressus Numerantium, vol. 30, pp. 45-87, 1981.
17. F. Margot, "Exploiting Orbits in Symmetric ILP", Mathematical Programming Ser. B 98, pp. 3-21, 2003.
18. P. Meseguer and C. Torras, "Solving strategies for highly symmetric CSPs", in Proceedings IJCAI, pp. 400-405, 1999.
19. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik, "Chaff: Engineering an Efficient SAT Solver", in Proc. Design Automation Conf., pp. 530-535, 2001.
20. G. Nam, F. Aloul, K. Sakallah, R. Rutenbar, "A Comparative Study of Two Boolean Formulations of FPGA Detailed Routing Constraints", in Proc. of the Intl. Symposium on Physical Design, pp. 222-227, 2001.
21. P. van Hentenryck, "The OPL Optimization Programming Language", the MIT Press, 1999.
22. e Constraint Logic Programming System": http://www.icparc.ic.ac.uk/eclipse/
23. S. D. Prestwich, "Balanced Incomplete Block Design as Satisfiability", in 12th Irish Conference on Artificial Intelligence and Cognitive Science, 2001.
24. J. F. Puget, "Symmetry Breaking Using Stabilizers", Principles and Practice of Constraints Prog., pp. 585-599, 2003.
25. H. Sheini, The Pueblo solver; http://www.eecs.umich.edu/~hsheini/pueblo
26. A. Ramani and I.L. Markov, "GSymEx": Generic Symmetry Extraction for Constraint Programming Problems; http://vlsicad.eecs.umich.edu/BK/GSymEx/
27. ILOG Solver, http://www.ilog.com/products/solver/
28. J. P. Warners, "A Linear-Time Transformation of Linear Inequalities into Conjunctive Normal Form", in Information Proc. Letters, vol. 68(2), pp. 63-69, 1998.