<?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-00098989</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 Plans and Proof Nets in Linear Logic -Abstract -</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>
            <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:41:00</date>
              <date type="whenModified">2025-11-04 12:04:51</date>
              <date type="whenReleased">2006-09-28 15:22:45</date>
              <date type="whenProduced">1999</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-00098989</idno>
            <idno type="halUri">https://inria.hal.science/inria-00098989</idno>
            <idno type="halBibtex">galmiche:inria-00098989</idno>
            <idno type="halRefHtml">&lt;i&gt;Floc'99 Workshop on Strategies in Automated Deduction&lt;/i&gt;, 1999, Trento, Italy, 2 p</idno>
            <idno type="halRef">Floc'99 Workshop on Strategies in Automated Deduction, 1999, Trento, Italy, 2 p</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">Colloque avec actes et comité de lecture.</note>
            <note type="audience" n="1">Not set</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">Proof Plans and Proof Nets in Linear Logic -Abstract -</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>
              </analytic>
              <monogr>
                <idno type="localRef">99-R-111 || galmiche99b</idno>
                <meeting>
                  <title>Floc'99 Workshop on Strategies in Automated Deduction</title>
                  <date type="start">1999</date>
                  <settlement>Trento, Italy</settlement>
                </meeting>
                <imprint>
                  <biblScope unit="pp">2 p</biblScope>
                  <date type="datePub">1999</date>
                </imprint>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="fr">linear logic</term>
                <term xml:lang="fr">proof plan</term>
                <term xml:lang="fr">proof net</term>
                <term xml:lang="fr">plan de preuve</term>
                <term xml:lang="fr">réseaux de preuve</term>
                <term xml:lang="fr">stratégies</term>
                <term xml:lang="fr">logique linéaire</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-oh">Computer Science [cs]/Other [cs.OH]</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>After recalling more classical strategies used for automated proof search in fragments of linear logic, we aim to present the specific planning strategies that are based on principles for proof nets construction. They will be illustrated by examples in the commutative and non-commutative cases, the later emphasising the interest of this approach mainly in case of non-provability. Moreover such strategies can be seen as strategies for some connection methods.</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>