skip to main content
research-article
Free access

Boolean satisfiability from theoretical hardness to practical success

Published: 01 August 2009 Publication History

Abstract

Satisfiability solvers can now be effectively deployed in practical applications.

References

[1]
]]Barrett, C., sebastiani, R., Seshia, S., and Tinelli, C. Satisfiability modulo theories. A. Biere, H. van Maaren, T. Walsh, Eds. Handbook of Satisfiability 4, 8 (2009), IOS Press, Amsterdam.
[2]
]]Bayardo R., and Schrag, R. Using CSP look-back techniques to solve real-world SAT instances. National Conference on Artificial Intelligence, 1997.
[3]
]]Biere, A., Cimatti, A., Clarke, E. M., and Zhu, Y. Symbolic model checking without BDDs. Tools and Algorithms for the Analysis and Construction of Systems, 1999.
[4]
]]Braunstein, A., Mezard, M., and Zecchina, R. Survey propagation: An algorithm for Satisfiability. Random Structures and Algorithms 27 (2005), 201--226.
[5]
]]Bryant, R.E. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35 (1986), 677--691.
[6]
]]Clarke, E.M., Grumberg, O., and Peled, D.A. Model Checking. MIT Press, Cambridge, MA, 1999.
[7]
]]Copty, F., Fix, L., Fraer, R., Giunchiglia, E., Kamhi, G., Tacchella, A., and Vardi, M.Y. Benefits of bounded model checking at an industrial setting. Proceedings of the 13th International Conference on Computer-Aided Verification, 2001.
[8]
]]Cook, S.A. The complexity of theorem-proving procedures. Third Annual ACM Symposium on Theory of Computing, 1971.
[9]
]]Davis, M., Logemann, G., and Loveland, D. A machine program for theorem proving. Comm. ACM 5 (1962), 394--397.
[10]
]]Davis, M., and Putnam, H. A computing procedure for quantification theory. JACM 7 (1960), 201--215.
[11]
]]Eén, N., and Biere, A. Effective preprocessing in SAT through variable and clause elimination. In Proceedings of the International Conference on Theory and Applications of Satisfiability Testing, 2005.
[12]
]]Garey, M.R., and Johnson, D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979
[13]
]]Gomes, C. P., Selman, B., and Kautz, H. Boosting combinatorial search through randomization. In Proceedings of National Conference on Artificial Intelligence (Madison, WI, 1998).
[14]
]]Hamadi, Y., Jabbour, S., and Sais, L. ManySat: Solver description. Microsoft Research, TR-2008-83.
[15]
]]Huth, M. and Ryan, M. Logic in Computer Science: Modeling and Reasoning about Systems. Cambridge University Press, 2004.
[16]
]]Hutter, F., Babic, D., Hoos, H.H., and Hu, A. J. Boosting verification by automatic tuning of decision procedures. In Proceedings of the International Conference on Formal Methods in Computer-Aided Design, (Austin, TX, Nov. 2007).
[17]
]]Jackson, D., and Vaziri, M., Finding bugs with a constraint solver. In Proceedings of the International Symposium on Software Testing and Analysis (Portland, OR, 2000).
[18]
]]Jain, H. Verification using satisfiability checking, predicate abstraction, and Craig interpolation. Ph.D. Thesis, Carnegie-Mellon University, School of Computer Science, CMU-CS-08-146, 2008.
[19]
]]Johnson, D.S., Mehrotra, A., and Trick, M. A. Preface: special issue on computational methods for graph coloring and its generalizations. Discrete Applied Mathematics 156, 2; Computational Methods for Graph Coloring and its Generalizations. (Jan. 15, 2008), 145--146.
[20]
]]Kautz, H. and Selman, B. Planning as satisfiability. European Conference on Artificial Intelligence, 1992.
[21]
]]Larrabee, T. Test pattern generation using Boolean satisfiability. IEEE Transactions on Computer-Aided Design (Jan. 1992) 4--15.
[22]
]]Madigan, M.W., Madigan, C.F., Zhao, Y., Zhang, L., and Malik, S. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Conference on Design Automation. (New York, NY, 2001).
[23]
]]Marchiori, E. and Rossi, C. A flipping genetic algorithm for hard 3-SAT problems. In Proceedings of the Genetic and Evolutionary Computation Conference (Orlando, FL, 1999), 393--400.
[24]
]]Marques-Silva, J.P, and Sakallah, K.A. Conflict analysis in search algorithms for propositional satisfiability. IEEE International Conference on Tools with Artificial Intelligence, 1996.
[25]
]]Mazure, B., Sas L., and Grgoire, E., Tabu search for SAT. In Proceedings of the 14th National Conference on Artificial Intelligence (Providence, RI, 1997).
[26]
]]McMillan, K.L., Applying SAT methods in unbounded symbolic model checking. In Proceedings of the 14th International Conference on Computer Aided Verification. Lecture Notes In Computer Science 2404 (2002). Springer-Verlag, London, 250--264.
[27]
]]Muscettola, N., Pandurang Nayak, P., Pell, B., and Williams, B.C. Remote agent: To boldly go where no AI system has gone before. Artificial Intelligence 103, 1--2, (1998), 5--47.
[28]
]]Nam, G.-J., Sakallah, K. A., and Rutenbar, R.A. Satisfiability-based layout revisited: Detailed routing of complex FPGAs via search-based Boolean SAT. International Symposium on Field-Programmable Gate Arrays (Monterey, CA, 1999).
[29]
]]Narain, S., Levin, G., Kaul, V., Malik, S. Declarative infrastructure configuration and debugging. Journal of Network Systems and Management, Special Issue on Security Configuration. Springer, 2008.
[30]
]]Selman, B., Kautz, H.A., and Cohen, B. Noise strategies for improving local search. In Proceedings of the 12th National Conference on Artificial Intelligence (Seattle, WA, 1994). American Association for Artificial Intelligence, Menlo Park, CA, 337--343.
[31]
]]Selman, B., Levesque, H., and Mitchell, D. A new method for solving hard satisfiability problems. In Proceedings of the 10th National Conference on Artificial Intelligence, (1992) 440--446.
[32]
]]Seshia, S.A., Lahiri, S.K., and Bryant, R.E. a hybrid SAT-based decision procedure for separation logic with uninterpreted functions. In Proceedings of the 40th Conference on Design Automation (Anaheim, CA, June 2--6, 2003). ACM, NY, 425--430; http://doi.acm.org/10.1145/775832.775945.
[33]
]]Spears, W.M. Simulated annealing for hard satisfiability problems. Cliques, Coloring and Satisfiability, Second DIMACS Implementation Challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. D.S. Johnson and M.A. Trick, Eds. American Mathematical Society (1993), 533--558.
[34]
]]Spears, W. M. A NN algorithm for Boolean satisfiability problems. In Proceedings of the 1996 International Conference on Neural Networks, 1121--1126.
[35]
]]Stålmarck, G. A system for determining prepositional logic theorems by applying values and rules to triplets that are generated from a formula. U.S. Patent Number 5276897, 1994.
[36]
]]Tseitin, G. On the complexity of derivation in propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic, Part 2 (1968), 115--125. Reprinted in Automation of reasoning vol. 2. J. Siekmann and G. Wrightson, Eds. Springer Verlag, Berlin, 1983, 466--483.
[37]
]]Williams, R., Gomes, C., and Selman, B. Backdoors to typical case complexity. In Proceedings. of the 18th International Joint Conference on Artificial Intelligence (2003), 1173--1178.
[38]
]]Williams, R., Gomes, C., and Selman, B. On the connections between heavy-tails, backdoors, and restarts in combinatorial search. In Proceedings of the International Conference on Theory and Applications of Satisfiability Testing, 2003.
[39]
]]Xu, L., Hutter, F., Hoos, H. H., Leyton-Brown, K. SATzilla: Portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research 32, (2008), 565--606.
[40]
]]Zhang, H. Generating college conference basketball schedules by a SAT solver. In Proceedings of the 5th International Symposium on Theory and Applications of Satisfiability Testing. (Cincinnati, OH, 2002).

Cited By

View all
  • (2024)On Reasoning About Black-Box Udfs by Classifying their Performance CharacteristicsProceedings of the 32nd International Conference on Information Systems Development10.62036/ISD.2024.83Online publication date: 2024
  • (2024)Survey of Machine Learning for Software-assisted Hardware Design Verification: Past, Present, and ProspectACM Transactions on Design Automation of Electronic Systems10.1145/366130829:4(1-42)Online publication date: 24-Apr-2024
  • (2024)Complete realization of energy landscapes and non-equilibrium trapping dynamics in small spin glass and optimization problemsScientific Reports10.1038/s41598-024-65493-414:1Online publication date: 8-Jul-2024
  • Show More Cited By
  1. Boolean satisfiability from theoretical hardness to practical success

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image Communications of the ACM
    Communications of the ACM  Volume 52, Issue 8
    A Blind Person's Interaction with Technology
    August 2009
    132 pages
    ISSN:0001-0782
    EISSN:1557-7317
    DOI:10.1145/1536616
    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: 01 August 2009
    Published in CACM Volume 52, Issue 8

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Research-article
    • Popular
    • Refereed

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)656
    • Downloads (Last 6 weeks)57
    Reflects downloads up to 28 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)On Reasoning About Black-Box Udfs by Classifying their Performance CharacteristicsProceedings of the 32nd International Conference on Information Systems Development10.62036/ISD.2024.83Online publication date: 2024
    • (2024)Survey of Machine Learning for Software-assisted Hardware Design Verification: Past, Present, and ProspectACM Transactions on Design Automation of Electronic Systems10.1145/366130829:4(1-42)Online publication date: 24-Apr-2024
    • (2024)Complete realization of energy landscapes and non-equilibrium trapping dynamics in small spin glass and optimization problemsScientific Reports10.1038/s41598-024-65493-414:1Online publication date: 8-Jul-2024
    • (2024)Intelligent Allocation Technologies for All-Scenario KDN ResourcesKey Technologies for On-Demand 6G Network Services10.1007/978-3-031-70606-6_7(163-201)Online publication date: 26-Sep-2024
    • (2023)Detecting multi-step IAM attacks in AWS environments via model checkingProceedings of the 32nd USENIX Conference on Security Symposium10.5555/3620237.3620574(6025-6042)Online publication date: 9-Aug-2023
    • (2023)The Silent (R)evolution of SATCommunications of the ACM10.1145/356046966:6(64-72)Online publication date: 24-May-2023
    • (2023)Mechanical MathematiciansCommunications of the ACM10.1145/355799866:4(80-90)Online publication date: 23-Mar-2023
    • (2023)Rotational abstractions for verification of quantum Fourier transform circuitsIET Quantum Communication10.1049/qtc2.120554:2(84-92)Online publication date: 13-Mar-2023
    • (2023)Impact of Satisfiability Solvers on Logic LockingUnderstanding Logic Locking10.1007/978-3-031-37989-5_7(131-154)Online publication date: 23-Sep-2023
    • (2023)ReferencesA Textbook of Data Structures and Algorithms 210.1002/9781394192045.refs(261-261)Online publication date: 20-Jan-2023
    • Show More Cited By

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Digital Edition

    View this article in digital edition.

    Digital Edition

    Magazine Site

    View this article on the magazine site (external)

    Magazine Site

    Login options

    Full Access

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media