<?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-00674150</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-18T01:35:44+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">DEL-sequents for progression</title>
            <author role="crp">
              <persName>
                <forename type="first">Guillaume</forename>
                <surname>Aucher</surname>
              </persName>
              <email type="md5">ce5c48a8e351fc860616023748d7ce26</email>
              <email type="domain">univ-rennes1.fr</email>
              <idno type="idhal" notation="string">guillaume-aucher</idno>
              <idno type="idhal" notation="numeric">754897</idno>
              <idno type="halauthorid" notation="string">54987-754897</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-2781-2688</idno>
              <affiliation ref="#struct-2515"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Guillaume</forename>
                <surname>Aucher</surname>
              </persName>
              <email type="md5">ce5c48a8e351fc860616023748d7ce26</email>
              <email type="domain">univ-rennes1.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2015-09-07 17:25:04</date>
              <date type="whenModified">2025-03-28 03:10:17</date>
              <date type="whenReleased">2015-09-08 15:43:34</date>
              <date type="whenProduced">2011</date>
              <date type="whenEndEmbargoed">2015-09-07</date>
              <ref type="file" target="https://inria.hal.science/hal-00674150v1/document">
                <date notBefore="2015-09-07"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-00674150v1/file/JANCL11.pdf" id="file-1194418-1277591">
                <date notBefore="2015-09-07"/>
              </ref>
              <ref type="externalLink" target="https://hal.inria.fr/hal-00674150/file/JANCL11.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="156493">
                <persName>
                  <forename>Guillaume</forename>
                  <surname>Aucher</surname>
                </persName>
                <email type="md5">ce5c48a8e351fc860616023748d7ce26</email>
                <email type="domain">univ-rennes1.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00674150</idno>
            <idno type="halUri">https://inria.hal.science/hal-00674150</idno>
            <idno type="halBibtex">aucher:hal-00674150</idno>
            <idno type="halRefHtml">&lt;i&gt;Journal of Applied Non-Classical Logics&lt;/i&gt;, 2011, 21 (3-4), pp.289-321. &lt;a target="_blank" href="https://dx.doi.org/10.3166/jancl.21.289-321"&gt;&amp;#x27E8;10.3166/jancl.21.289-321&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Journal of Applied Non-Classical Logics, 2011, 21 (3-4), pp.289-321. &amp;#x27E8;10.3166/jancl.21.289-321&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1194418-1277591"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="EC-PARIS">Ecole Centrale Paris</idno>
            <idno type="stamp" n="UNIV-RENNES1">Université de Rennes 1</idno>
            <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="INSA-RENNES">Institut National des Sciences Appliquées de Rennes</idno>
            <idno type="stamp" n="INRIA-RENNES">INRIA Rennes - Bretagne Atlantique</idno>
            <idno type="stamp" n="IRISA">Irisa</idno>
            <idno type="stamp" n="IRISA_SET">IRISA_SET</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="IRISA-D2">RÉSEAUX, TÉLÉCOMMUNICATION ET SERVICES</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="UR1-HAL">Publications labos UR1 dans HAL-Rennes 1</idno>
            <idno type="stamp" n="UR1-MATH-STIC">UR1 - publications Maths-STIC</idno>
            <idno type="stamp" n="UR1-UFR-ISTIC">UFR ISTIC Informatique et électronique</idno>
            <idno type="stamp" n="TEST-UNIV-RENNES">TEST Université de Rennes</idno>
            <idno type="stamp" n="TEST-UR-CSS">TEST Université de Rennes CSS</idno>
            <idno type="stamp" n="UNIV-RENNES">Université de Rennes</idno>
            <idno type="stamp" n="INRIA-RENGRE">INRIA-RENGRE</idno>
            <idno type="stamp" n="INSA-GROUPE">Groupe INSA</idno>
            <idno type="stamp" n="UR1-MATH-NUM">Pôle UnivRennes - Mathématiques - Numérique </idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">DEL-sequents for progression</title>
                <author role="crp">
                  <persName>
                    <forename type="first">Guillaume</forename>
                    <surname>Aucher</surname>
                  </persName>
                  <email type="md5">ce5c48a8e351fc860616023748d7ce26</email>
                  <email type="domain">univ-rennes1.fr</email>
                  <idno type="idhal" notation="string">guillaume-aucher</idno>
                  <idno type="idhal" notation="numeric">754897</idno>
                  <idno type="halauthorid" notation="string">54987-754897</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-2781-2688</idno>
                  <affiliation ref="#struct-2515"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">39557</idno>
                <idno type="issn">1958-5780</idno>
                <idno type="eissn">1166-3081</idno>
                <title level="j">Journal of Applied Non-Classical Logics</title>
                <imprint>
                  <publisher>Taylor &amp; Francis</publisher>
                  <biblScope unit="volume">21</biblScope>
                  <biblScope unit="issue">3-4</biblScope>
                  <biblScope unit="pp">289-321</biblScope>
                  <date type="datePub">2011</date>
                  <date type="dateEpub">2012-04-13</date>
                </imprint>
              </monogr>
              <idno type="doi">10.3166/jancl.21.289-321</idno>
              <ref type="publisher">http://jancl.e-revues.com/article.jsp?articleId=17077</ref>
            </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="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>Dynamic Epistemic Logic (DEL) deals with the representation and the study in a multi-agent setting of knowledge and belief change. It can express in a uniform way epistemic statements about: (i) what is true about an initial situation (ii) what is true about an event occurring in this situation (iii) what is true about the resulting situation after the event has occurred. We axiomatize within the DEL framework what we can infer about (iii) given (i) and (ii). Given three formulas φ, φ and φ describing respectively (i), (ii) and (iii), we also show how to build a formula φ ⊗ φ which captures all the information which can be inferred about (iii) from φ and φ. We show how our results extend to other modal logics than K. In our proofs and definitions, we resort to a large extent to the normal form formulas for modal logic originally introduced by Kit Fine. In a companion paper [Aucher, 2012], we axiomatize what we can infer about (ii) given (i) and (iii), and what we can infer about (i) given (ii) and (iii), and show how to build two formulas φ φ and φ φ which capture respectively all the information which can be inferred about (ii) from φ and φ , and all the information which can be inferred about (i) from φ and φ .</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-2515" status="OLD">
          <idno type="RNSR">200418351J</idno>
          <orgName>Distributed and Iterative Algorithms for the Management of Telecommunications Systems</orgName>
          <orgName type="acronym">DISTRIBCOM</orgName>
          <date type="start">2004-05-03</date>
          <date type="end">2012-12-31</date>
          <desc>
            <address>
              <addrLine>Campus de Beaulieu 35042 Rennes cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/distribcom</ref>
          </desc>
          <listRelation>
            <relation active="#struct-2494" type="direct"/>
            <relation active="#struct-105160" type="indirect"/>
            <relation active="#struct-117606" type="indirect"/>
            <relation active="#struct-301232" type="indirect"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation name="ESA6074 / URA227" active="#struct-441569" type="indirect"/>
            <relation active="#struct-419153" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-2494" status="OLD">
          <orgName>Institut de Recherche en Informatique et Systèmes Aléatoires</orgName>
          <orgName type="acronym">IRISA</orgName>
          <date type="start">1980-01-01</date>
          <date type="end">1999-12-31</date>
          <desc>
            <address>
              <addrLine>Campus universitaire de Beaulieu - 35042 Rennes</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.irisa.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-105160" type="direct"/>
            <relation active="#struct-117606" type="direct"/>
            <relation active="#struct-301232" type="indirect"/>
            <relation active="#struct-300009" type="direct"/>
            <relation name="ESA6074 / URA227" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-105160" status="VALID">
          <idno type="IdRef">26693823X</idno>
          <idno type="ROR">https://ror.org/015m7wh34</idno>
          <orgName>Université de Rennes</orgName>
          <orgName type="acronym">UR</orgName>
          <desc>
            <address>
              <addrLine>Campus de Beaulieu, 263 avenue Général Leclerc, CS 74205, 35042 RENNES CEDEX</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.univ-rennes.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-117606" status="VALID">
          <idno type="ROR">https://ror.org/04xaa4j22</idno>
          <orgName>Institut National des Sciences Appliquées - Rennes</orgName>
          <orgName type="acronym">INSA Rennes</orgName>
          <desc>
            <address>
              <addrLine>20, avenue des Buttes de Coësmes - CS 70839 - 35708 Rennes cedex 7</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.insa-rennes.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301232" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301232" status="VALID">
          <idno type="IdRef">162105150</idno>
          <orgName>Institut National des Sciences Appliquées</orgName>
          <orgName type="acronym">INSA</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </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="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="laboratory" xml:id="struct-419153" status="VALID">
          <idno type="RNSR">198018249C</idno>
          <idno type="ROR">https://ror.org/04040yw90</idno>
          <orgName>Centre Inria de l'Université de Rennes</orgName>
          <desc>
            <address>
              <addrLine>Campus de beaulieu35042 Rennes cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/rennes</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>