Editing Boolean satisfiability problem (section)

==Further reading==
(by date of publication)
{{refbegin|colwidth=30em}}
* {{cite book|first1=Michael R. |last1=Garey |first2=David S. |last2=Johnson|author-link=Michael R. Garey |author2-link=David S. Johnson |year=1979 |title=Computers and Intractability: A Guide to the Theory of NP-Completeness |publisher=W. H. Freeman |isbn=0-7167-1045-5 |title-link=List of important publications in theoretical computer science#Computers and Intractability: A Guide to the Theory of NP-Completeness |pages=A9.1: LO1–LO7, pp.&nbsp;259–260}}
* {{Cite book |last1=Marques-Silva |first1=J. |last2=Glass |first2=T. |chapter=Combinational equivalence checking using satisfiability and recursive learning |title=Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078) |pages=145 |year=1999 |isbn=0-7695-0078-1 |doi=10.1109/DATE.1999.761110 |url=http://eprints.soton.ac.uk/265003/1/jpms-date99a.pdf |archive-url=https://ghostarchive.org/archive/20221009/http://eprints.soton.ac.uk/265003/1/jpms-date99a.pdf |archive-date=2022-10-09 |url-status=live}}
* {{Cite journal |last1=Clarke |first1=E. |last2=Biere |first2=A. |last3=Raimi |first3=R. |last4=Zhu |first4=Y. |journal=Formal Methods in System Design |volume=19 |pages=7–34 |year=2001 |title=Bounded Model Checking Using Satisfiability Solving |doi=10.1023/A:1011276507260 |s2cid=2484208}}
* {{Cite book | last1 = Giunchiglia | first1 = E. | last2 = Tacchella | first2 = A. | editor1-last = Giunchiglia | editor1-first = Enrico | editor2-first = Armando | title = Theory and Applications of Satisfiability Testing | series = Lecture Notes in Computer Science | volume = 2919 | year = 2004 | isbn = 978-3-540-20851-8 | doi = 10.1007/b95238 | s2cid = 31129008 | editor2-last = Tacchella}}
* {{Cite journal | last1 = Babic | first1 = D. | last2 = Bingham | first2 = J. | last3 = Hu | first3 = A. J. | title = B-Cubing: New Possibilities for Efficient SAT-Solving | journal = IEEE Transactions on Computers | volume = 55 | issue = 11 | pages = 1315 | year = 2006 | url = http://www.domagoj-babic.com/uploads/Pubs/TCOM06/tcom06.pdf| archive-url = https://web.archive.org/web/20161023223352/http://www.domagoj-babic.com/uploads/Pubs/TCOM06/tcom06.pdf| url-status = usurped| archive-date = October 23, 2016| doi = 10.1109/TC.2006.175| s2cid = 14819050 }}
* {{Cite book | last1 = Rodriguez | first1 = C. | last2 = Villagra | first2 = M. | last3 = Baran | first3 = B. | chapter = Asynchronous team algorithms for Boolean Satisfiability | title = 2007 2nd Bio-Inspired Models of Network, Information and Computing Systems | pages = 66–69 | year = 2007 | chapter-url = http://www.cc.pol.una.py/lcca/publicaciones/optimizacion/2007/Asynchronous%20Team%20Algorithms%20for%20Boolean%20Satisfiability.pdf| doi = 10.1109/BIMNICS.2007.4610083| s2cid = 15185219 }}
* {{cite book |editor1-first=Frank Van |editor1-last=Harmelen |editor2-first=Vladimir |editor2-last=Lifschitz |editor3-first=Bruce |editor3-last=Porter |title=Handbook of knowledge representation|year=2008|publisher=Elsevier|isbn=978-0-444-52211-5|pages=89–134|first1=Carla P. |last1=Gomes|author1-link=Carla Gomes |first2=Henry |last2=Kautz |first3=Ashish |last3=Sabharwal |first4=Bart |last4=Selman |chapter=Satisfiability Solvers|doi=10.1016/S1574-6526(07)03002-7|series=Foundations of Artificial Intelligence|volume=3}}
* {{Cite journal | last1 = Vizel | first1 = Y. | last2 = Weissenbacher | first2 = G. | last3 = Malik | first3 = S. | journal = Proceedings of the IEEE | volume = 103 | issue = 11 | year = 2015 | doi = 10.1109/JPROC.2015.2455034|title=Boolean Satisfiability Solvers and Their Applications in Model Checking| pages = 2021–2035 | s2cid = 10190144 }}
* {{Cite book |first=Donald E. |last=Knuth |author-link=Donald Knuth|title=The Art of Computer Programming |volume=4B: Combinatorial Algorithms, Part 2 |pages=185–369 |chapter=Chapter 7.2.2.2: Satifiability|year=2022 |publisher=Addison-Wesley Professional |isbn=978-0-201-03806-4|title-link=The Art of Computer Programming }}
{{refend}}

{{Logic}}

{{DEFAULTSORT:Boolean Satisfiability Problem}}
[[Category:Boolean algebra]]
[[Category:Electronic design automation]]
[[Category:Formal methods]]
[[Category:Logic in computer science]]
[[Category:NP-complete problems]]
[[Category:Satisfiability problems]]