<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-02406673</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-19T03:34:25+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">The Challenge of Unifying Semantic and Syntactic Inference Restrictions</title>
            <author role="aut">
              <persName>
                <forename type="first">Christoph</forename>
                <surname>Weidenbach</surname>
              </persName>
              <email type="md5">0320d88e0a93e2cbb431d6a771f453c8</email>
              <email type="domain">mpi-inf.mpg.de</email>
              <idno type="idhal" notation="numeric">992041</idno>
              <idno type="halauthorid" notation="string">167869-992041</idno>
              <affiliation ref="#struct-107895"/>
              <affiliation ref="#struct-54489"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Stephan</forename>
                <surname>Merz</surname>
              </persName>
              <email type="md5">c64cfb705871425cf704c55e9343be9a</email>
              <email type="domain">loria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2019-12-12 11:06:46</date>
              <date type="whenModified">2026-04-10 15:18:01</date>
              <date type="whenReleased">2019-12-12 13:53:57</date>
              <date type="whenProduced">2019</date>
              <date type="whenEndEmbargoed">2019-12-12</date>
              <ref type="file" target="https://inria.hal.science/hal-02406673v1/document">
                <date notBefore="2019-12-12"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-02406673v1/file/arcade19.pdf" id="file-2406673-2298390">
                <date notBefore="2019-12-12"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="104076">
                <persName>
                  <forename>Stephan</forename>
                  <surname>Merz</surname>
                </persName>
                <email type="md5">c64cfb705871425cf704c55e9343be9a</email>
                <email type="domain">loria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-02406673</idno>
            <idno type="halUri">https://inria.hal.science/hal-02406673</idno>
            <idno type="halBibtex">weidenbach:hal-02406673</idno>
            <idno type="halRefHtml">&lt;i&gt;2nd International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements (ARCADE 2019)&lt;/i&gt;, 2019, Natal, Brazil</idno>
            <idno type="halRef">2nd International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements (ARCADE 2019), 2019, Natal, Brazil</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-2406673-2298390"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="LORIA2">Publications du LORIA</idno>
            <idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="CENTRALESUPELEC">Ecole CentraleSupélec</idno>
            <idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="LORIA">Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
            <idno type="stamp" n="LORIA-FM" corresp="LORIA">Department of Formal methods</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="CENTRALESUPELEC-SACLAY" corresp="UNIV-PARIS-SACLAY">CENTRALESUPELEC-SACLAY</idno>
            <idno type="stamp" n="INRIA-ALLEMAGNE">INRIA-ALLEMAGNE</idno>
            <idno type="stamp" n="AM2I-UL">Pôle scientifique Automatique, Mathématiques, Informatique et leurs Intéractions de l'Université de Lorraine</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">The Challenge of Unifying Semantic and Syntactic Inference Restrictions</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Christoph</forename>
                    <surname>Weidenbach</surname>
                  </persName>
                  <email type="md5">0320d88e0a93e2cbb431d6a771f453c8</email>
                  <email type="domain">mpi-inf.mpg.de</email>
                  <idno type="idhal" notation="numeric">992041</idno>
                  <idno type="halauthorid" notation="string">167869-992041</idno>
                  <affiliation ref="#struct-107895"/>
                  <affiliation ref="#struct-54489"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title>2nd International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements (ARCADE 2019)</title>
                  <date type="start">2019</date>
                  <settlement>Natal</settlement>
                  <country key="BR">Brazil</country>
                </meeting>
                <imprint>
                  <biblScope unit="serie">Electronic Proceedings in Theoretical Computer Science</biblScope>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-lo">Computer Science [cs]/Logic in Computer Science [cs.LO]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>While syntactic inference restrictions don't play an important role for SAT, they are an essential reasoning technique for more expressive logics, such as first-order logic, or fragments thereof. In particular, they can result in short proofs or model representations. On the other hand, semantically guided inference systems enjoy important properties, such as the generation of solely non-redundant clauses. I discuss to what extend the two paradigms may be unifiable.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-107895" status="VALID">
          <idno type="RNSR">201020692C</idno>
          <idno type="ROR">https://ror.org/0440j7g03</idno>
          <orgName>Modeling and Verification of Distributed Algorithms and Systems</orgName>
          <orgName type="acronym">VERIDIS</orgName>
          <date type="start">2012-07-01</date>
          <date type="end">2026-04-30</date>
          <desc>
            <address>
              <addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/veridis</ref>
          </desc>
          <listRelation>
            <relation active="#struct-129671" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-423084" type="direct"/>
            <relation active="#struct-206040" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-413289" type="indirect"/>
            <relation name="UMR7503" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-54489" status="VALID">
          <orgName>Max-Planck-Institut für Informatik</orgName>
          <orgName type="acronym">MPII</orgName>
          <desc>
            <address>
              <addrLine>Campus E-1 4, 66123 Saarbrücken, Germany</addrLine>
              <country key="DE"/>
            </address>
            <ref type="url">http://www.mpi-inf.mpg.de/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-5247" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-129671" status="VALID">
          <idno type="RNSR">198618246Y</idno>
          <idno type="ROR">https://ror.org/03fcjvn64</idno>
          <orgName>Centre Inria de l'Université de Lorraine</orgName>
          <desc>
            <address>
              <addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/nancy</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="department" xml:id="struct-423084" status="VALID">
          <orgName>Department of Formal Methods</orgName>
          <orgName type="acronym">LORIA - FM</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.loria.fr/en/research/departments/formal-methods/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-206040" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-413289" type="indirect"/>
            <relation name="UMR7503" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-206040" status="VALID">
          <idno type="IdRef">067077927</idno>
          <idno type="ISNI">0000000121795429</idno>
          <idno type="RNSR">198912571S</idno>
          <idno type="IdUnivLorraine">[UL]RSI--</idno>
          <idno type="ROR">https://ror.org/02vnf0c38</idno>
          <orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
          <orgName type="acronym">LORIA</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.loria.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation active="#struct-413289" type="direct"/>
            <relation name="UMR7503" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-413289" status="VALID">
          <idno type="IdRef">157040569</idno>
          <idno type="IdUnivLorraine">[UL]100--</idno>
          <idno type="ROR">https://ror.org/04vfs2w97</idno>
          <orgName>Université de Lorraine</orgName>
          <orgName type="acronym">UL</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lorraine.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-5247" status="VALID">
          <orgName>Max-Planck-Gesellschaft</orgName>
          <desc>
            <address>
              <addrLine>Jägerstrasse, 10-11, D-10117 Berlin</addrLine>
              <country key="DE"/>
            </address>
            <ref type="url">https://www.mpg.de/en</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>