License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-36600
URL:

Satisfiability: where Theory meets Practice (Invited Talk)

pdf-format:


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).

BibTeX - Entry

@InProceedings{lynce:LIPIcs:2012:3660,
  author =	{InÍs Lynce},
  title =	{{Satisfiability: where Theory meets Practice (Invited Talk)}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{12--13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{Patrick C{\'e}gielski and Arnaud Durand},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3660},
  URN =		{urn:nbn:de:0030-drops-36600},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.CSL.2012.12},
  annote =	{Keywords: Propositional Satisfiability, SAT solvers, Applications}
}

Keywords: Propositional Satisfiability, SAT solvers, Applications
Seminar: Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL
Issue date: 2012
Date of publication: 2012


DROPS-Home | Fulltext Search | Imprint Published by LZI