DagRep.10.2.1.pdf
- Filesize: 6.54 MB
- 18 pages
Document
SAT and Interactions (Dagstuhl Seminar 20061)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 10, Issue 2
Volume: Dagstuhl Reports, Volume 10
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2020-09-17
Cite As Get BibTex
Olaf Beyersdorff, Uwe Egly, Meena Mahajan, and Cláudia Nalon. SAT and Interactions (Dagstuhl Seminar 20061). In Dagstuhl Reports, Volume 10, Issue 2, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
https://doi.org/10.4230/DagRep.10.2.1
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.
Subject Classification
ACM Subject Classification
- Theory of computation → Proof theory
- Theory of computation → Modal and temporal logics
- Theory of computation → Automated reasoning
- Theory of computation → Description logics
- Theory of computation → Proof complexity
- Theory of computation → Complexity theory and logic
Keywords
- SAT
- MaxSAT
- QBF
- proof complexity
- deep inference
- modal logic
- solving
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads