<?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-01402046</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-21T15:09:22+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Primal Infon Logic with Conjunctions as Sets</title>
            <author role="aut">
              <persName>
                <forename type="first">Carlos</forename>
                <surname>Cotrini</surname>
              </persName>
              <idno type="halauthorid">1083836-0</idno>
              <affiliation ref="#struct-180925"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Yuri</forename>
                <surname>Gurevich</surname>
              </persName>
              <idno type="halauthorid">1083837-0</idno>
              <affiliation ref="#struct-28609"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Ori</forename>
                <surname>Lahav</surname>
              </persName>
              <idno type="halauthorid">1083838-0</idno>
              <affiliation ref="#struct-63133"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Artem</forename>
                <surname>Melentyev</surname>
              </persName>
              <idno type="halauthorid">1083839-0</idno>
              <affiliation ref="#struct-409793"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Hal</forename>
                <surname>Ifip</surname>
              </persName>
              <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2016-11-24 10:52:01</date>
              <date type="whenModified">2025-11-11 10:28:03</date>
              <date type="whenReleased">2016-11-24 11:14:10</date>
              <date type="whenProduced">2014-09-01</date>
              <date type="whenEndEmbargoed">2017-01-01</date>
              <ref type="file" target="https://inria.hal.science/hal-01402046v1/document">
                <date notBefore="2017-01-01"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-01402046v1/file/978-3-662-44602-7_19_Chapter.pdf" id="file-1402046-1487646">
                <date notBefore="2017-01-01"/>
              </ref>
              <ref type="externalLink" target="http://research.microsoft.com/en-us/um/people/gurevich/Opera/221.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="200187">
                <persName>
                  <forename>Hal</forename>
                  <surname>Ifip</surname>
                </persName>
                <email type="md5">2073ac78024b6e13f2714db96e9b1e63</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01402046</idno>
            <idno type="halUri">https://inria.hal.science/hal-01402046</idno>
            <idno type="halBibtex">cotrini:hal-01402046</idno>
            <idno type="halRefHtml">&lt;i&gt;8th IFIP International Conference on Theoretical Computer Science (TCS)&lt;/i&gt;, Sep 2014, Rome, Italy. pp.236-249, &lt;a target="_blank" href="https://dx.doi.org/10.1007/978-3-662-44602-7_19"&gt;&amp;#x27E8;10.1007/978-3-662-44602-7_19&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.236-249, &amp;#x27E8;10.1007/978-3-662-44602-7_19&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by/4.0/">CC BY 4.0 - Attribution<ref corresp="#file-1402046-1487646"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="IFIP-LNCS" corresp="IFIP">IFIP - Lecture Notes in Computer Science</idno>
            <idno type="stamp" n="IFIP">IFIP - International Federation for Information Processing</idno>
            <idno type="stamp" n="IFIP-TC" corresp="IFIP">IFIP Technical Committees </idno>
            <idno type="stamp" n="IFIP-TC2" corresp="IFIP-TC">IFIP TC 2: Software:Theory and Practice</idno>
            <idno type="stamp" n="IFIP-LNCS-8705" corresp="IFIP-LNCS">Theoretical Computer Science</idno>
            <idno type="stamp" n="IFIP-TCS">IFIP-TCS</idno>
            <idno type="stamp" n="IFIP-WG2-2">WG2-2: Formal Description of Programming Concepts</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">Part 2: Track B: Logic, Semantics, Specification and Verification</note>
            <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">Primal Infon Logic with Conjunctions as Sets</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Carlos</forename>
                    <surname>Cotrini</surname>
                  </persName>
                  <idno type="halauthorid">1083836-0</idno>
                  <affiliation ref="#struct-180925"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Yuri</forename>
                    <surname>Gurevich</surname>
                  </persName>
                  <idno type="halauthorid">1083837-0</idno>
                  <affiliation ref="#struct-28609"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Ori</forename>
                    <surname>Lahav</surname>
                  </persName>
                  <idno type="halauthorid">1083838-0</idno>
                  <affiliation ref="#struct-63133"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Artem</forename>
                    <surname>Melentyev</surname>
                  </persName>
                  <idno type="halauthorid">1083839-0</idno>
                  <affiliation ref="#struct-409793"/>
                </author>
              </analytic>
              <monogr>
                <title level="m">Lecture Notes in Computer Science</title>
                <meeting>
                  <title>8th IFIP International Conference on Theoretical Computer Science (TCS)</title>
                  <date type="start">2014-09-01</date>
                  <date type="end">2014-09-03</date>
                  <settlement>Rome</settlement>
                  <country key="IT">Italy</country>
                </meeting>
                <editor>Josep Diaz</editor>
                <editor>Ivan Lanese</editor>
                <editor>Davide Sangiorgi</editor>
                <imprint>
                  <publisher>Springer</publisher>
                  <biblScope unit="serie">Theoretical Computer Science</biblScope>
                  <biblScope unit="volume">LNCS-8705</biblScope>
                  <biblScope unit="pp">236-249</biblScope>
                  <date type="datePub">2014</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1007/978-3-662-44602-7_19</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</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>Primal infon logic was proposed by Gurevich and Neeman as an efficient yet expressive logic for policy and trust management. It is a propositional multimodal subintuitionistic logic decidable in linear time. However in that logic the principle of the replacement of equivalents fails. For example, $\left(x \land y\right) \to z$ does not entail $\left(y \land x\right) \to z$, and similarly $w \to \left(\left(x \land y\right)\land z\right)$ does not entail $w \to \left(x \land \left(y \land z\right)\right)$. Imposing the full principle of the replacement of equivalents leads to an NP-hard logic according to a recent result of Beklemishev and Prokhorov. In this paper we suggest a way to regain the part of this principle restricted to conjunction: We introduce a version of propositional primal logic that treats conjunctions as sets, and show that the derivation problem for this logic can be decided in linear expected time and quadratic worst-case time.</p>
            </abstract>
            <particDesc>
              <org type="consortium">TC 1</org>
              <org type="consortium">TC 2</org>
              <org type="consortium">WG 2.2</org>
            </particDesc>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-180925" status="VALID">
          <idno type="ROR">https://ror.org/05a28rw58</idno>
          <orgName>Eidgenössische Technische Hochschule - Swiss Federal Institute of Technology  [Zürich]</orgName>
          <orgName type="acronym">ETH Zürich</orgName>
          <desc>
            <address>
              <addrLine>Hauptgebäude, Rämistrasse 101, 8092 Zürich</addrLine>
              <country key="CH"/>
            </address>
            <ref type="url">https://www.ethz.ch/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-28609" status="VALID">
          <orgName>Microsoft Research [Redmond]</orgName>
          <desc>
            <address>
              <addrLine>Microsoft Building 99, 14820 NE 36th Street, Redmond, Washington, 98052 USA</addrLine>
              <country key="US"/>
            </address>
            <ref type="url">https://www.microsoft.com/en-us/research/lab/microsoft-research-redmond/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-379481" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-63133" status="VALID">
          <idno type="ROR">https://ror.org/04mhzgx49</idno>
          <orgName>Tel Aviv University</orgName>
          <orgName type="acronym">TAU</orgName>
          <desc>
            <address>
              <addrLine>Tel Aviv 699780</addrLine>
              <country key="IL"/>
            </address>
            <ref type="url">https://english.tau.ac.il/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-409793" status="VALID">
          <orgName>Ural Federal University [Ekaterinburg]</orgName>
          <orgName type="acronym">UrFU</orgName>
          <desc>
            <address>
              <addrLine>620002, 19 Mira street, Ekaterinburg</addrLine>
              <country key="RU"/>
            </address>
            <ref type="url">http://urfu.ru/en/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-379481" status="VALID">
          <orgName>Microsoft Corporation [Redmond, Wash.]</orgName>
          <desc>
            <address>
              <country key="US"/>
            </address>
            <ref type="url">https://www.microsoft.com/fr-fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>