<?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-24T08:23:05Z</responseDate>
  <request identifier="25579" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:25579</identifier>
        <datestamp>2026-03-19T13:48:41Z</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>Certifying Algorithms for Automated Reasoning (Dagstuhl Seminar 25231)</dc:title>
          <dc:creator>Bjørner, Nikolaj S.</dc:creator>
          <dc:creator>Heule, Marijn J. H.</dc:creator>
          <dc:creator>Kaufmann, Daniela</dc:creator>
          <dc:creator>Nordström, Jakob</dc:creator>
          <dc:creator>Koops, Wietze</dc:creator>
          <dc:subject>ATP</dc:subject>
          <dc:subject>Computer Algebra</dc:subject>
          <dc:subject>DRAT</dc:subject>
          <dc:subject>DRUP</dc:subject>
          <dc:subject>MIP</dc:subject>
          <dc:subject>Propagation Redundancy</dc:subject>
          <dc:subject>QBF</dc:subject>
          <dc:subject>SAT</dc:subject>
          <dc:subject>SMT</dc:subject>
          <dc:description>Modern automated reasoning has transformed large parts of industry and has also found numerous scientific applications. But many reasoning problems are computationally very challenging, or sometimes even undecidable. Because of this, the reasoning algorithms used are often very complex, and even the best current algorithms at times produce wrong results. As these tools are increasingly being used autonomously, sometimes even in life-critical applications, it is urgent to ensure that what they compute is valid. Software testing, while immensely useful, cannot guarantee correctness, and state-of-the-art algorithms are far beyond what techniques for producing formally verified software can handle.&#13;
The focus of this Dagstuhl Seminar was the approach of addressing such issues by designing certifying algorithms using so-called proof logging, meaning that algorithms output not only a result but also a machine-verifiable proof of correctness. This proof can then be fed to a dedicated proof checker for verification. Crucially, such proofs should require low overhead to generate and be easy to check, but still supply 100% correctness guarantees. Besides ensuring correctness of outputs for complex algorithms, proof logging can also provide new tools for algorithm development and analysis, software debugging, and even research into explainability in the context of AI.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Nikolaj S. Bjørner and Marijn J. H. Heule and Daniela Kaufmann and Jakob Nordström and Wietze Koops</dc:contributor>
          <dc:date>2026</dc:date>
          <dc:relation>Is Part Of Dagstuhl Reports, Volume 15, Issue 6 (2026)</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.15.6.1</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-255798</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.6.1</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
