Skip to main content
SpringerLink
Log in

Automatic Generation of Implied Clauses for SAT

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming - CP 2002 (CP 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2470))

  • 961 Accesses

Abstract

Propositional satisfiability (SAT) is the archetypal NP-complete problem [1]. A great deal of recent SAT research, particularly on the performance of SAT solvers, has been driven by structured instances, which are obtained by mapping other problem classes into SAT. It is possible to efficiently solve a wide range of problems by mapping them into SAT and solving the SAT representation of the problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. S. A. Cook. The complexity of theorem-proving procedures. In Proceedings of the Third ACM Symposium on Theory of Computing, pages 151–158, 1971.

    Google Scholar 

  2. Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem-proving. Communications of the ACM, 5:394–397, 1962.

    Article  MathSciNet  MATH  Google Scholar 

  3. João P. Marques Silva and Karem A. Sakallah. Conflict analysis in search algorithms for satisfiability. In Proceedings of the IEEE International Conference on Tools with Artificial Intelligence, Nov 1996.

    Google Scholar 

  4. Irina Rish and Rina Dechter. Resolution versus search: Two strategies for SAT. In Ian Gent, Hans van Maaren, and Toby Walsh, editors, SAT2000: Highlights of Satisfiability Research in the Year 2000, volume 63 of Frontiers in Artificial Intelligence and Applications, pages 215–259. IOS Press, 2000.

    Google Scholar 

  5. Allen van Gelder. Satisfiability testing with more reasoning and less guessing. In D. S. Johnson and M. Trick, editors, Cliques, Coloring, and Satisfiability: Second DIM ACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Artificial Intelligence Group, Department of Computer Science, University of York, York, YO10 5DD, UK

    Lyndon Drake, Alan Frisch & Toby Walsh

Authors
  1. Lyndon Drake
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan Frisch
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Toby Walsh
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Brown University, Box 1910, Providence, RI, 02912, USA

    Pascal Van Hentenryck

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Drake, L., Frisch, A., Walsh, T. (2002). Automatic Generation of Implied Clauses for SAT. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_78

Download citation

  • DOI: https://doi.org/10.1007/3-540-46135-3_78

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44120-5

  • Online ISBN: 978-3-540-46135-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation