Connection-Based Proof Construction in Non-commutative Logic
Identifieur interne : 000301 ( Istex/Corpus ); précédent : 000300; suivant : 000302Connection-Based Proof Construction in Non-commutative Logic
Auteurs : D. Galmiche ; J. M. NotinSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract.: We propose a connection-based characterization of the multiplicative fragment of non-commutative logic (MNL), that is a conservative extension of both commutative (MLL) and non-commutative or cyclic (MCyLL) linear logic. It is based on a characterization for MLL together with the introduction of labels and constraints from a formula polarization process. We also study a similar characterization for the intuitionistic fragment of MNL. Finally, we consider the relationships between these results and proof nets construction in MNL based on labels and constraints.
Url:
DOI: 10.1007/978-3-540-39813-4_30
Links to Exploration step
ISTEX:0DCF7396E9D9B84A9FE7C582A039BFA9C1E7C28ALe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Connection-Based Proof Construction in Non-commutative Logic</title><author><name sortKey="Galmiche, D" sort="Galmiche, D" uniqKey="Galmiche D" first="D." last="Galmiche">D. Galmiche</name><affiliation><mods:affiliation>LORIA – Université Henri Poincaré, 54506, Vandœuvre-lés-Nancy Cedex, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: galmiche@loria.fr</mods:affiliation></affiliation></author><author><name sortKey="Notin, J M" sort="Notin, J M" uniqKey="Notin J" first="J. M." last="Notin">J. M. Notin</name><affiliation><mods:affiliation>LORIA – Université Henri Poincaré, 54506, Vandœuvre-lés-Nancy Cedex, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: notin@loria.fr</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:0DCF7396E9D9B84A9FE7C582A039BFA9C1E7C28A</idno><date when="2003" year="2003">2003</date><idno type="doi">10.1007/978-3-540-39813-4_30</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-39W1GLVN-9/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000301</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000301</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Connection-Based Proof Construction in Non-commutative Logic</title><author><name sortKey="Galmiche, D" sort="Galmiche, D" uniqKey="Galmiche D" first="D." last="Galmiche">D. Galmiche</name><affiliation><mods:affiliation>LORIA – Université Henri Poincaré, 54506, Vandœuvre-lés-Nancy Cedex, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: galmiche@loria.fr</mods:affiliation></affiliation></author><author><name sortKey="Notin, J M" sort="Notin, J M" uniqKey="Notin J" first="J. M." last="Notin">J. M. Notin</name><affiliation><mods:affiliation>LORIA – Université Henri Poincaré, 54506, Vandœuvre-lés-Nancy Cedex, France</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: notin@loria.fr</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract.: We propose a connection-based characterization of the multiplicative fragment of non-commutative logic (MNL), that is a conservative extension of both commutative (MLL) and non-commutative or cyclic (MCyLL) linear logic. It is based on a characterization for MLL together with the introduction of labels and constraints from a formula polarization process. We also study a similar characterization for the intuitionistic fragment of MNL. Finally, we consider the relationships between these results and proof nets construction in MNL based on labels and constraints.</div></front></TEI><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>D. Galmiche</name><affiliations><json:string>LORIA – Université Henri Poincaré, 54506, Vandœuvre-lés-Nancy Cedex, France</json:string><json:string>E-mail: galmiche@loria.fr</json:string></affiliations></json:item><json:item><name>J. -M. Notin</name><affiliations><json:string>LORIA – Université Henri Poincaré, 54506, Vandœuvre-lés-Nancy Cedex, France</json:string><json:string>E-mail: notin@loria.fr</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-39W1GLVN-9</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><abstract>Abstract.: We propose a connection-based characterization of the multiplicative fragment of non-commutative logic (MNL), that is a conservative extension of both commutative (MLL) and non-commutative or cyclic (MCyLL) linear logic. It is based on a characterization for MLL together with the introduction of labels and constraints from a formula polarization process. We also study a similar characterization for the intuitionistic fragment of MNL. Finally, we consider the relationships between these results and proof nets construction in MNL based on labels and constraints.</abstract><qualityIndicators><score>7.984</score><pdfWordCount>6608</pdfWordCount><pdfCharCount>32389</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>15</pdfPageCount><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>82</abstractWordCount><abstractCharCount>577</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>Connection-Based Proof Construction in Non-commutative Logic</title><chapterId><json:string>30</json:string><json:string>Chap30</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>2003</copyrightDate><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><editor><json:item><name>Gerhard Goos</name><affiliations><json:string>Karlsruhe University, Germany</json:string></affiliations></json:item><json:item><name>Juris Hartmanis</name><affiliations><json:string>Cornell University, NY, USA</json:string></affiliations></json:item><json:item><name>Jan van Leeuwen</name><affiliations><json:string>Utrecht University, The Netherlands</json:string></affiliations></json:item></editor></serie><host><title>Logic for Programming, Artificial Intelligence, and Reasoning</title><language><json:string>unknown</json:string></language><copyrightDate>2003</copyrightDate><doi><json:string>10.1007/b13986</json:string></doi><issn><json:string>0302-9743</json:string></issn><eissn><json:string>1611-3349</json:string></eissn><eisbn><json:string>978-3-540-39813-4</json:string></eisbn><bookId><json:string>978-3-540-39813-4</json:string></bookId><isbn><json:string>978-3-540-20101-4</json:string></isbn><volume>2850</volume><pages><first>422</first><last>436</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Department of Computer Science, Rice University, 77251-1892, Houston, TX, U.S.A.</json:string><json:string>E-mail: vardi@cs.rice.edu</json:string></affiliations></json:item><json:item><name>Andrei Voronkov</name><affiliations><json:string>University of Manchester, UK</json:string><json:string>E-mail: voronkov@cs.man.ac.uk</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Programming Techniques</value></json:item><json:item><value>Software Engineering</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-39W1GLVN-9</json:string></ark><publicationDate>2003</publicationDate><copyrightDate>2003</copyrightDate><doi><json:string>10.1007/978-3-540-39813-4_30</json:string></doi><id>0DCF7396E9D9B84A9FE7C582A039BFA9C1E7C28A</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-39W1GLVN-9/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-39W1GLVN-9/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-39W1GLVN-9/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Connection-Based Proof Construction in Non-commutative Logic</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag Berlin Heidelberg</licence></availability><date when="2003">2003</date></publicationStmt><notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note><note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Connection-Based Proof Construction in Non-commutative Logic</title><author><persName><forename type="first">D.</forename><surname>Galmiche</surname></persName><email>galmiche@loria.fr</email><affiliation><orgName type="institution">LORIA – Université Henri Poincaré</orgName><address><postCode>54506</postCode><settlement>Vandœuvre-lés-Nancy Cedex</settlement><country key="FR">FRANCE</country></address></affiliation></author><author><persName><forename type="first">J.</forename><forename type="first">-M.</forename><surname>Notin</surname></persName><email>notin@loria.fr</email><affiliation><orgName type="institution">LORIA – Université Henri Poincaré</orgName><address><postCode>54506</postCode><settlement>Vandœuvre-lés-Nancy Cedex</settlement><country key="FR">FRANCE</country></address></affiliation></author><idno type="istex">0DCF7396E9D9B84A9FE7C582A039BFA9C1E7C28A</idno><idno type="ark">ark:/67375/HCB-39W1GLVN-9</idno><idno type="DOI">10.1007/978-3-540-39813-4_30</idno></analytic><monogr><title level="m" type="main">Logic for Programming, Artificial Intelligence, and Reasoning</title><title level="m" type="sub">10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003. Proceedings</title><idno type="DOI">10.1007/b13986</idno><idno type="book-id">978-3-540-39813-4</idno><idno type="ISBN">978-3-540-20101-4</idno><idno type="eISBN">978-3-540-39813-4</idno><idno type="chapter-id">Chap30</idno><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><email>vardi@cs.rice.edu</email><affiliation><orgName type="department">Department of Computer Science</orgName><orgName type="institution">Rice University</orgName><address><postCode>77251-1892</postCode><settlement>Houston</settlement><region>TX</region><country key="US">UNITED STATES</country></address></affiliation></editor><editor><persName><forename type="first">Andrei</forename><surname>Voronkov</surname></persName><email>voronkov@cs.man.ac.uk</email><affiliation><orgName type="institution">University of Manchester</orgName><address><country key="GB">UNITED KINGDOM</country></address></affiliation></editor><imprint><biblScope unit="vol">2850</biblScope><biblScope unit="page" from="422">422</biblScope><biblScope unit="page" to="436">436</biblScope><biblScope unit="chapter-count">30</biblScope></imprint></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName><affiliation><orgName type="institution">Karlsruhe University</orgName><address><country key="DE">GERMANY</country></address></affiliation></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName><affiliation><orgName type="institution">Cornell University</orgName><address><region>NY</region><country key="US">UNITED STATES</country></address></affiliation></editor><editor><persName><forename type="first">Jan</forename><nameLink>van</nameLink><surname>Leeuwen</surname></persName><affiliation><orgName type="institution">Utrecht University</orgName><address><country key=""></country></address></affiliation></editor><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesID">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><abstract xml:lang="en"><head>Abstract.</head><p>We propose a connection-based characterization of the multiplicative fragment of non-commutative logic (MNL), that is a conservative extension of both commutative (MLL) and non-commutative or cyclic (MCyLL) linear logic. It is based on a characterization for MLL together with the introduction of labels and constraints from a formula polarization process. We also study a similar characterization for the intuitionistic fragment of MNL. Finally, we consider the relationships between these results and proof nets construction in MNL based on labels and constraints.</p></abstract><textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label><item><term type="Primary">Computer Science</term></item><label>I21017</label><item><term type="Secondary" subtype="priority-1">Artificial Intelligence (incl. Robotics)</term></item><label>I14010</label><item><term type="Secondary" subtype="priority-2">Programming Techniques</term></item><label>I14029</label><item><term type="Secondary" subtype="priority-3">Software Engineering</term></item><label>I1603X</label><item><term type="Secondary" subtype="priority-4">Logics and Meanings of Programs</term></item><label>I16048</label><item><term type="Secondary" subtype="priority-5">Mathematical Logic and Formal Languages</term></item></list></keywords></textClass><langUsage><language ident="EN"></language></langUsage></profileDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-39W1GLVN-9/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Karlsruhe University</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Cornell University</OrgName><OrgAddress><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>Utrecht University</OrgName><OrgAddress><Country>The Netherlands</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><SubSeries><SubSeriesInfo><SubSeriesID>1244</SubSeriesID><SubSeriesPrintISSN>0302-9743</SubSeriesPrintISSN><SubSeriesElectronicISSN>1611-3349</SubSeriesElectronicISSN><SubSeriesTitle Language="En">Lecture Notes in Artificial Intelligence</SubSeriesTitle></SubSeriesInfo><SubSeriesHeader><EditorGroup><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jaime</GivenName><GivenName>G.</GivenName><FamilyName>Carbonell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Jörg</GivenName><FamilyName>Siekmann</FamilyName></EditorName></Editor><Affiliation ID="Aff4"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>University of Saarland</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SubSeriesHeader></SubSeries><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-540-39813-4</BookID><BookTitle>Logic for Programming, Artificial Intelligence, and Reasoning</BookTitle><BookSubTitle>10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003. Proceedings</BookSubTitle><BookVolumeNumber>2850</BookVolumeNumber><BookSequenceNumber>2850</BookSequenceNumber><BookDOI>10.1007/b13986</BookDOI><BookTitleID>80007</BookTitleID><BookPrintISBN>978-3-540-20101-4</BookPrintISBN><BookElectronicISBN>978-3-540-39813-4</BookElectronicISBN><BookChapterCount>30</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2003</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I21017" Priority="1" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I14010" Priority="2" Type="Secondary">Programming Techniques</BookSubject><BookSubject Code="I14029" Priority="3" Type="Secondary">Software Engineering</BookSubject><BookSubject Code="I1603X" Priority="4" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="I16048" Priority="5" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID><SubSeriesID>1244</SubSeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName><Contact><Email>vardi@cs.rice.edu</Email></Contact></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Andrei</GivenName><FamilyName>Voronkov</FamilyName></EditorName><Contact><Email>voronkov@cs.man.ac.uk</Email></Contact></Editor><Affiliation ID="Aff6"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>Rice University</OrgName><OrgAddress><Postcode>77251-1892</Postcode><City>Houston</City><State>TX</State><Country>U.S.A.</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>University of Manchester</OrgName><OrgAddress><Country>UK</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Chapter ID="Chap30" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>30</ChapterID><ChapterDOI>10.1007/978-3-540-39813-4_30</ChapterDOI><ChapterSequenceNumber>30</ChapterSequenceNumber><ChapterTitle Language="En">Connection-Based Proof Construction in Non-commutative Logic</ChapterTitle><ChapterFirstPage>422</ChapterFirstPage><ChapterLastPage>436</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2003</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><BookID>978-3-540-39813-4</BookID><BookTitle>Logic for Programming, Artificial Intelligence, and Reasoning</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff8"><AuthorName DisplayOrder="Western"><GivenName>D.</GivenName><FamilyName>Galmiche</FamilyName></AuthorName><Contact><Email>galmiche@loria.fr</Email></Contact></Author><Author AffiliationIDS="Aff8"><AuthorName DisplayOrder="Western"><GivenName>J.</GivenName><GivenName>-M.</GivenName><FamilyName>Notin</FamilyName></AuthorName><Contact><Email>notin@loria.fr</Email></Contact></Author><Affiliation ID="Aff8"><OrgName>LORIA – Université Henri Poincaré</OrgName><OrgAddress><Postcode>54506</Postcode><City>Vandœuvre-lés-Nancy Cedex</City><Country>France</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract.</Heading><Para>We propose a connection-based characterization of the multiplicative fragment of non-commutative logic (MNL), that is a conservative extension of both commutative (MLL) and non-commutative or cyclic (MCyLL) linear logic. It is based on a characterization for MLL together with the introduction of labels and constraints from a formula polarization process. We also study a similar characterization for the intuitionistic fragment of MNL. Finally, we consider the relationships between these results and proof nets construction in MNL based on labels and constraints.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Connection-Based Proof Construction in Non-commutative Logic</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>Connection-Based Proof Construction in Non-commutative Logic</title></titleInfo><name type="personal"><namePart type="given">D.</namePart><namePart type="family">Galmiche</namePart><affiliation>LORIA – Université Henri Poincaré, 54506, Vandœuvre-lés-Nancy Cedex, France</affiliation><affiliation>E-mail: galmiche@loria.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">J.</namePart><namePart type="given">-M.</namePart><namePart type="family">Notin</namePart><affiliation>LORIA – Université Henri Poincaré, 54506, Vandœuvre-lés-Nancy Cedex, France</affiliation><affiliation>E-mail: notin@loria.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2003</dateIssued><copyrightDate encoding="w3cdtf">2003</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract lang="en">Abstract.: We propose a connection-based characterization of the multiplicative fragment of non-commutative logic (MNL), that is a conservative extension of both commutative (MLL) and non-commutative or cyclic (MCyLL) linear logic. It is based on a characterization for MLL together with the introduction of labels and constraints from a formula polarization process. We also study a similar characterization for the intuitionistic fragment of MNL. Finally, we consider the relationships between these results and proof nets construction in MNL based on labels and constraints.</abstract><relatedItem type="host"><titleInfo><title>Logic for Programming, Artificial Intelligence, and Reasoning</title><subTitle>10th International Conference, LPAR 2003, Almaty, Kazakhstan, September 22-26, 2003. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Department of Computer Science, Rice University, 77251-1892, Houston, TX, U.S.A.</affiliation><affiliation>E-mail: vardi@cs.rice.edu</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Andrei</namePart><namePart type="family">Voronkov</namePart><affiliation>University of Manchester, UK</affiliation><affiliation>E-mail: voronkov@cs.man.ac.uk</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2003</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I14010">Programming Techniques</topic><topic authority="SpringerSubjectCodes" authorityURI="I14029">Software Engineering</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic></subject><identifier type="DOI">10.1007/b13986</identifier><identifier type="ISBN">978-3-540-20101-4</identifier><identifier type="eISBN">978-3-540-39813-4</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">80007</identifier><identifier type="BookID">978-3-540-39813-4</identifier><identifier type="BookChapterCount">30</identifier><identifier type="BookVolumeNumber">2850</identifier><identifier type="BookSequenceNumber">2850</identifier><part><date>2003</date><detail type="volume"><number>2850</number><caption>vol.</caption></detail><extent unit="pages"><start>422</start><end>436</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2003</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><affiliation>Karlsruhe University, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><affiliation>Cornell University, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><affiliation>Utrecht University, The Netherlands</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2003</copyrightDate><issuance>serial</issuance></originInfo><relatedItem type="constituent"><titleInfo><title>Lecture Notes in Artificial Intelligence</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><affiliation>Karlsruhe University, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><affiliation>Cornell University, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><affiliation>Utrecht University, The Netherlands</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jaime</namePart><namePart type="given">G.</namePart><namePart type="family">Carbonell</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jörg</namePart><namePart type="family">Siekmann</namePart><affiliation>University of Saarland, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Department of Computer Science, Rice University, 77251-1892, Houston, TX, U.S.A.</affiliation><affiliation>E-mail: vardi@cs.rice.edu</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Andrei</namePart><namePart type="family">Voronkov</namePart><affiliation>University of Manchester, UK</affiliation><affiliation>E-mail: voronkov@cs.man.ac.uk</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="sub-series"></genre><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SubSeriesID">1244</identifier></relatedItem><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2003</recordOrigin></recordInfo></relatedItem><identifier type="istex">0DCF7396E9D9B84A9FE7C582A039BFA9C1E7C28A</identifier><identifier type="ark">ark:/67375/HCB-39W1GLVN-9</identifier><identifier type="DOI">10.1007/978-3-540-39813-4_30</identifier><identifier type="ChapterID">30</identifier><identifier type="ChapterID">Chap30</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2003</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2003</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-39W1GLVN-9/record.json</uri></json:item></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000301 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000301 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:0DCF7396E9D9B84A9FE7C582A039BFA9C1E7C28A
|texte= Connection-Based Proof Construction in Non-commutative Logic
}}
| This area was generated with Dilib version V0.6.33. |  |