Satisfiability: where Theory meets Practice (Invited Talk)

Lynce, Inês

doi:10.4230/LIPIcs.CSL.2012.12

Document

Satisfiability: where Theory meets Practice (Invited Talk)

Author Inês Lynce

Part of: Volume: Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL (CSL 2012)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: Computer Science Logic (CSL)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2012-09-03

PDF

File

PDF

LIPIcs.CSL.2012.12.pdf

Filesize: 226 kB
2 pages

Document Identifiers

DOI: 10.4230/LIPIcs.CSL.2012.12
URN: urn:nbn:de:0030-drops-36600

Subject Classification

Keywords

Propositional Satisfiability
SAT solvers
Applications

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

Propositional Satisfiability (SAT) is a keystone in the history of computer science. SAT was the first problem shown to be NP-complete in 1971 by Stephen Cook. Having passed more than 40 years from then, SAT is now a lively research field where theory and practice have a natural intermixing. In this talk, we overview the use of SAT in practical domains, where SAT is thought in a broad sense, i.e. including SAT extensions such as Maximum Satisfiability (MaxSAT), Pseudo-Boolean Optimization (PBO) and Quantified Boolean Formulas (QBF).

Cite As Get BibTex

Inês Lynce. Satisfiability: where Theory meets Practice (Invited Talk). In Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 16, pp. 12-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012) https://doi.org/10.4230/LIPIcs.CSL.2012.12

Author Details

Inês Lynce

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail