<?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 inria-00099227</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-23T06:13:06+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Proof-search and Proof nets in Mixed Linear Logic</title>
            <author role="aut">
              <persName>
                <forename type="first">Didier</forename>
                <surname>Galmiche</surname>
              </persName>
              <email type="md5">c77c5dadf00da14ec32229d4d389af57</email>
              <email type="domain">loria.fr</email>
              <idno type="idhal" notation="string">didier-galmiche</idno>
              <idno type="idhal" notation="numeric">746081</idno>
              <idno type="halauthorid" notation="string">12370-746081</idno>
              <orgName ref="#struct-0"/>
              <affiliation ref="#struct-2580"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Jean-Marie</forename>
                <surname>Notin</surname>
              </persName>
              <idno type="halauthorid">168075-0</idno>
              <orgName ref="#struct-0"/>
              <affiliation ref="#struct-2580"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Publications</forename>
                <surname>Loria</surname>
              </persName>
              <email type="md5">5ee6acd102a820bf4e187a1ec952273f</email>
              <email type="domain">loria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2006-09-26 08:52:00</date>
              <date type="whenModified">2025-11-04 12:01:40</date>
              <date type="whenReleased">2006-09-28 15:22:46</date>
              <date type="whenProduced">2001</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="108626">
                <persName>
                  <forename>Publications</forename>
                  <surname>Loria</surname>
                </persName>
                <email type="md5">5ee6acd102a820bf4e187a1ec952273f</email>
                <email type="domain">loria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">inria-00099227</idno>
            <idno type="halUri">https://inria.hal.science/inria-00099227</idno>
            <idno type="halBibtex">galmiche:inria-00099227</idno>
            <idno type="halRefHtml">&lt;i&gt;Electronic Notes in Theoretical Computer Science&lt;/i&gt;, 2001, 37, pp.1-33</idno>
            <idno type="halRef">Electronic Notes in Theoretical Computer Science, 2001, 37, pp.1-33</idno>
            <availability status="restricted"/>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INPL">Institut National Polytechnique de Lorraine</idno>
            <idno type="stamp" n="LABO-LORIA-SET">LABO-LORIA-SET</idno>
            <idno type="stamp" n="LORIA2">Publications du LORIA</idno>
            <idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
            <idno type="stamp" n="LORIA">Laboratoire Lorrain de Recherche en Informatique et ses Applications</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="commentary">Article dans revue scientifique avec comité de lecture.</note>
            <note type="audience" n="1">Not set</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Proof-search and Proof nets in Mixed Linear Logic</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Didier</forename>
                    <surname>Galmiche</surname>
                  </persName>
                  <email type="md5">c77c5dadf00da14ec32229d4d389af57</email>
                  <email type="domain">loria.fr</email>
                  <idno type="idhal" notation="string">didier-galmiche</idno>
                  <idno type="idhal" notation="numeric">746081</idno>
                  <idno type="halauthorid" notation="string">12370-746081</idno>
                  <orgName ref="#struct-0"/>
                  <affiliation ref="#struct-2580"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Jean-Marie</forename>
                    <surname>Notin</surname>
                  </persName>
                  <idno type="halauthorid">168075-0</idno>
                  <orgName ref="#struct-0"/>
                  <affiliation ref="#struct-2580"/>
                </author>
              </analytic>
              <monogr>
                <idno type="localRef">A00-R-339 || galmiche00e</idno>
                <idno type="halJournalId" status="VALID">12842</idno>
                <idno type="issn">1571-0661</idno>
                <title level="j">Electronic Notes in Theoretical Computer Science</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">37</biblScope>
                  <biblScope unit="pp">1-33</biblScope>
                  <date type="datePub">2001</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="fr">mixed linear logic</term>
                <term xml:lang="fr">proof search</term>
                <term xml:lang="fr">recherche de preuves</term>
                <term xml:lang="fr">réseaux de preuve</term>
                <term xml:lang="fr">proof nets</term>
                <term xml:lang="fr">logique linéaire mixte</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>In this paper we study how to design proof-search methods for the multiplicative fragment of Mixed Linear Logic which combines both commutative and non-commutative connectives. After an analysis of the interaction and relationships between these connectives, we propose two different proof-search algorithms, both based on the construction of labelled proof nets. The labels allow in the former to fix some constraints to satisfy during the proof net search and in the latter to propagate some informations useful to guide and control the search. Such based-on proof nets methods are useful to efficiently detect the non-provability and could lead to the generation of some countermodels.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-2580" status="OLD">
          <orgName>Logic, proof Theory and Programming</orgName>
          <orgName type="acronym">TYPES</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.loria.fr/la-recherche-en/equipes/types</ref>
          </desc>
          <listRelation>
            <relation active="#struct-466633" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-300291" type="indirect"/>
            <relation active="#struct-300292" type="indirect"/>
            <relation active="#struct-300293" type="indirect"/>
            <relation name="UMR7503" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-466633" status="OLD">
          <orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
          <orgName type="acronym">LORIA</orgName>
          <date type="start">1997-01-01</date>
          <date type="end">2011-12-31</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-300291" type="direct"/>
            <relation active="#struct-300292" type="direct"/>
            <relation active="#struct-300293" type="direct"/>
            <relation name="UMR7503" active="#struct-441569" 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="institution" xml:id="struct-300291" status="OLD">
          <orgName>Université Henri Poincaré - Nancy 1</orgName>
          <orgName type="acronym">UHP</orgName>
          <date type="end">2011-12-31</date>
          <desc>
            <address>
              <addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300292" status="OLD">
          <orgName>Université Nancy 2</orgName>
          <date type="end">2011-12-31</date>
          <desc>
            <address>
              <addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300293" status="OLD">
          <orgName>Institut National Polytechnique de Lorraine</orgName>
          <orgName type="acronym">INPL</orgName>
          <date type="end">2011-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </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>
      </listOrg>
    </back>
  </text>
</TEI>