License: 
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.2.11.87
URN: urn:nbn:de:0030-drops-39786
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/3978/
Creignou, Nadia ;
Galesi, Nicola ;
Kullmann, Oliver ;
Vollmer, Heribert
Weitere Beteiligte (Hrsg. etc.): Nadia Creignou and Nicola Galesi and Oliver Kullmann and Heribert Vollmer
SAT Interactions (Dagstuhl Seminar 12471)
Abstract
This report documents the programme and outcomes of Dagstuhl Seminar 12471 "SAT Interactions". The seminar brought together researchers from different areas from theoretical computer science as well as the area of SAT solvers. A key objective of the seminar has been to initiate or consolidate discussions among the different groups for a fresh attack on one of the most important problems in theoretical computer science and mathematics.
BibTeX - Entry
@Article{creignou_et_al:DR:2013:3978,
author = {Nadia Creignou and Nicola Galesi and Oliver Kullmann and Heribert Vollmer},
title = {{SAT Interactions (Dagstuhl Seminar 12471)}},
pages = {87--101},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2013},
volume = {2},
number = {11},
editor = {Nadia Creignou and Nicola Galesi and Oliver Kullmann and Heribert Vollmer},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2013/3978},
URN = {urn:nbn:de:0030-drops-39786},
doi = {10.4230/DagRep.2.11.87},
annote = {Keywords: satisfiability problem, computational complexity, P-NP question, proof complexity, combinatorics, SAT-solvers, quantified Boolean formulas}
}
|
Keywords: |
|
satisfiability problem, computational complexity, P-NP question, proof complexity, combinatorics, SAT-solvers, quantified Boolean formulas |
|
Collection: |
|
Dagstuhl Reports, Volume 2, Issue 11 |
|
Issue Date: |
|
2013 |
|
Date of publication: |
|
25.03.2013 |
