<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-07-21T20:02:52Z</responseDate>
  <request identifier="13057" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:13057</identifier>
        <datestamp>2024-03-06T10:27:15Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>SAT and Interactions (Dagstuhl Seminar 20061)</dc:title>
          <dc:creator>Beyersdorff, Olaf</dc:creator>
          <dc:creator>Egly, Uwe</dc:creator>
          <dc:creator>Mahajan, Meena</dc:creator>
          <dc:creator>Nalon, Cláudia</dc:creator>
          <dc:subject>SAT</dc:subject>
          <dc:subject>MaxSAT</dc:subject>
          <dc:subject>QBF</dc:subject>
          <dc:subject>proof complexity</dc:subject>
          <dc:subject>deep inference</dc:subject>
          <dc:subject>modal logic</dc:subject>
          <dc:subject>solving</dc:subject>
          <dc:description>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.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Olaf Beyersdorff and Uwe Egly and Meena Mahajan and Cláudia Nalon</dc:contributor>
          <dc:date>2020</dc:date>
          <dc:relation>Is Part Of Dagstuhl Reports, Volume 10, Issue 2 (2020)</dc:relation>
          <dc:type>Article</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagRep.10.2.1</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-130576</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagRep.10.2.1</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/3.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
