skip to main content
research-article

Symmetry breaking for pseudo-Boolean formulas

Published: 12 June 2008 Publication History

Abstract

Many important tasks in design automation and artificial intelligence can be performed in practice via reductions to Boolean satisfiability (SAT). However, such reductions often omit application-specific structure, thus handicapping tools in their competition with creative engineers. Successful attempts to represent and utilize additional structure on Boolean variables include recent work on 0-1 integer linear programming (ILP) and symmetries in SAT. Those extensions gracefully accommodate well-known advances in SAT solving, however, no previous work has attempted to combine both extensions. Our work shows (i) how one can detect and use symmetries in instances of 0-1 ILP, and (ii) what benefits this may bring.

References

[1]
Aloul, F., Ramani, A., Markov, I. L., and Sakallah, K. 2002. Generic ILP versus specialized 0-1 ILP. In Proceedings of the International Conference on Computer-Aided Design. 450--457.
[2]
Aloul, F., Ramani, A., Markov, I. L., and Sakallah, K. 2003a. Symmetry-breaking for pseudo-Boolean formulas. In Proceedings of the International Workshop on Symmetry on Constraint Satisfaction Problems. 1--12.
[3]
Aloul, F., Ramani, A., Markov, I. L., and Sakallah, K. 2003b. Solving difficult instances of boolean satisfiability in the presence of symmetries. IEEE Transactions on Computer Aided Design, 22, 9, 1117--1137.
[4]
Aloul, F., Markov, I. L., and Sakallah, K. 2003c. Shatter: Efficient symmetry-breaking for boolean satisfiability. In Proceedings of the Design Automation Conference. 836--839.
[5]
Barth, P. 1995. A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization. Technical Report MPI-I-95-2-003, Max-Planck-Institut Für Informatik.
[6]
Chai, D. and Kuehlmann, A. 2003. A fast pseudo-Boolean constraint solver. In Proceedings of the Design Automation Conference. 830--835.
[7]
Crawford, J., Ginsberg, M., Luks, E., and Roy, A. 1996. Symmetry-breaking predicates for search problems. In Proceedings of the International Conference Principles of Knowledge Representation and Reasoning. 148--159.
[8]
Creignou, N., Kanna, S., and Sudan, M. 2001. Complexity Classifications of Boolean Constraint Satisfaction Problems. SIAM Press, Philadelphia, PA, USA, 2001.
[9]
Darga, P. 2004. SAUCY: Graph automorphism tool. Available at: http://www.eecs.umich. edu/~pdarga/pub/auto/saucy.html
[10]
Davis, M., Logemann, G., and Loveland, D. 1962. A machine program for theorem proving. Communications of the ACM, 5, 7, 394--397.
[11]
DIMACS Challenge Benchmarks. Available at: ftp://Dimacs.rutgers.EDU/pub/challenge/sat/benchmarks/cnf
[12]
Hall Jr. M. 1959. The Theory of Groups. McMillan, New York.
[13]
ILOG CPLEX, Available at: http://www.ilog.com/products/cplex
[14]
McKay, B. 1981. Practical graph isomorphism. Congressus Numerantium 30, 45--87.
[15]
McKay, B. 1990. NAUTY User's Guide, Version 1.5. Technical Report TR-CS-90-02, Department of Computer Science, Australian National University.
[16]
Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., and Malik, S. 2001. Chaff: Engineering an efficient SAT solver. In Proceedings of the Design Automation Conference. 530--535.
[17]
Nam, G., Aloul, F., Sakallah, K., and Rutenbar, R. 2001. A comparative study of two Boolean formulations of FPGA detailed routing constraints. In Proceedings of the International Symposium on Physical Design. 222--227.
[18]
Preswitch, S. 2002. Supersymmetric modelling for local search. In Proceedings of the International Workshop on Symmetry on Constraint Satisfaction Problems.
[19]
SAT Competition. 2002. Available at: http://www.satcomp.org
[20]
Selman, B., Kautz, H., and Cohen, B. 1994. Noise strategies for local search. In Proceedings of the National Conference on Artificial Intelligence. 337--343.

Cited By

View all
  • (2023)Symmetry and Dominance Breaking for Pseudo-Boolean OptimizationArtificial Intelligence and Machine Learning10.1007/978-3-031-39144-6_10(149-166)Online publication date: 4-Aug-2023
  • (2005)Dynamic symmetry-breaking for improved Boolean optimizationProceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.10.1109/ASPDAC.2005.1466204(445-450)Online publication date: 2005
  • (2004)Breaking Instance-Independent Symmetries in Exact Graph ColoringProceedings of the conference on Design, automation and test in Europe - Volume 110.5555/968878.969090Online publication date: 16-Feb-2004

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Journal of Experimental Algorithmics
ACM Journal of Experimental Algorithmics  Volume 12, Issue
2008
507 pages
ISSN:1084-6654
EISSN:1084-6654
DOI:10.1145/1227161
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 June 2008
Accepted: 01 May 2007
Received: 01 October 2006
Published in JEA Volume 12

Author Tag

  1. Graph automorphism

Qualifiers

  • Research-article
  • Research
  • Refereed

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)5
  • Downloads (Last 6 weeks)0
Reflects downloads up to 13 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Symmetry and Dominance Breaking for Pseudo-Boolean OptimizationArtificial Intelligence and Machine Learning10.1007/978-3-031-39144-6_10(149-166)Online publication date: 4-Aug-2023
  • (2005)Dynamic symmetry-breaking for improved Boolean optimizationProceedings of the ASP-DAC 2005. Asia and South Pacific Design Automation Conference, 2005.10.1109/ASPDAC.2005.1466204(445-450)Online publication date: 2005
  • (2004)Breaking Instance-Independent Symmetries in Exact Graph ColoringProceedings of the conference on Design, automation and test in Europe - Volume 110.5555/968878.969090Online publication date: 16-Feb-2004

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media