License: Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.10.2.1
URN: urn:nbn:de:0030-drops-130576
URL: https://drops.dagstuhl.de/opus/volltexte/2020/13057/
Go back to Dagstuhl Reports


Beyersdorff, Olaf ; Egly, Uwe ; Mahajan, Meena ; Nalon, Cláudia
Weitere Beteiligte (Hrsg. etc.): Olaf Beyersdorff and Uwe Egly and Meena Mahajan and Cláudia Nalon

SAT and Interactions (Dagstuhl Seminar 20061)

pdf-format:
dagrep_v010_i002_p001_20061.pdf (7 MB)


Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 20061 "SAT and Interactions". The seminar brought together theoreticians and practitioners from the areas of proof complexity and proof theory, SAT and QBF solving, MaxSAT, and modal logics, who discussed recent developments in their fields and embarked on an interdisciplinary exchange of ideas and techniques between these neighbouring subfields of SAT.

BibTeX - Entry

@Article{beyersdorff_et_al:DR:2020:13057,
  author =	{Olaf Beyersdorff and Uwe Egly and Meena Mahajan and Cl{\'a}udia Nalon},
  title =	{{SAT and Interactions (Dagstuhl Seminar 20061)}},
  pages =	{1--18},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2020},
  volume =	{10},
  number =	{2},
  editor =	{Olaf Beyersdorff and Uwe Egly and Meena Mahajan and Cl{\'a}udia Nalon},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/13057},
  URN =		{urn:nbn:de:0030-drops-130576},
  doi =		{10.4230/DagRep.10.2.1},
  annote =	{Keywords: SAT, MaxSAT, QBF, proof complexity, deep inference, modal logic, solving}
}

Keywords: SAT, MaxSAT, QBF, proof complexity, deep inference, modal logic, solving
Collection: Dagstuhl Reports, Volume 10, Issue 2
Issue Date: 2020
Date of publication: 17.09.2020


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI