Connection-based proof construction in non-commutative logic
Identifieur interne :
000698 ( PascalFrancis/Corpus );
précédent :
000697;
suivant :
000699
Connection-based proof construction in non-commutative logic
Auteurs : D. Galmiche ;
J.-M. NotinSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2003.
RBID : Pascal:04-0200594
Descripteurs français
English descriptors
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.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
| pA |
| A01 | 01 | 1 | | @0 0302-9743 |
|---|
| A05 | | | | @2 2850 |
|---|
| A08 | 01 | 1 | ENG | @1 Connection-based proof construction in non-commutative logic |
|---|
| A09 | 01 | 1 | ENG | @1 LPAR 2003 : logic for programming artificial intelligence, and reasoning : Almaty, 22-26 September 2003 |
|---|
| A11 | 01 | 1 | | @1 GALMICHE (D.) |
|---|
| A11 | 02 | 1 | | @1 NOTIN (J.-M.) |
|---|
| A12 | 01 | 1 | | @1 VARDI (Moshe Y.) @9 ed. |
|---|
| A12 | 02 | 1 | | @1 VORONKOV (Andrei) @9 ed. |
|---|
| A14 | 01 | | | @1 LORIA - Université Henri Poincaré @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut. |
|---|
| A20 | | | | @1 422-436 |
|---|
| A21 | | | | @1 2003 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-20101-7 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000117770190300 |
|---|
| A44 | | | | @0 0000 @1 © 2004 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 18 ref. |
|---|
| A47 | 01 | 1 | | @0 04-0200594 |
|---|
| A60 | | | | @1 P @2 C |
|---|
| A61 | | | | @0 A |
|---|
| A64 | 01 | 1 | | @0 Lecture notes in computer science |
|---|
| A66 | 01 | | | @0 DEU |
|---|
| C01 | 01 | | ENG | @0 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. |
|---|
| C02 | 01 | X | | @0 001D02B01 |
|---|
| C02 | 02 | X | | @0 001D02A04 |
|---|
| C02 | 03 | X | | @0 001D02C02 |
|---|
| C03 | 01 | X | FRE | @0 Programmation logique @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Logical programming @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Programación lógica @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Logique linéaire @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Linear logic @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Lógica lineal @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Etiquette @5 11 |
|---|
| C03 | 03 | X | ENG | @0 Label @5 11 |
|---|
| C03 | 03 | X | SPA | @0 Etiqueta @5 11 |
|---|
| C03 | 04 | X | FRE | @0 Polarisation @5 12 |
|---|
| C03 | 04 | X | ENG | @0 Polarization @5 12 |
|---|
| C03 | 04 | X | SPA | @0 Polarización @5 12 |
|---|
| C03 | 05 | X | FRE | @0 Logique multiplicative @4 CD @5 96 |
|---|
| C03 | 05 | X | ENG | @0 Multiplicative logic @4 CD @5 96 |
|---|
| C03 | 06 | X | FRE | @0 Réseau preuve @4 CD @5 97 |
|---|
| C03 | 06 | X | ENG | @0 Proof net @4 CD @5 97 |
|---|
| N21 | | | | @1 138 |
|---|
| N82 | | | | @1 PSI |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 Logic for programming, artificial intelligence and reasoning. International conference @2 10 @3 Almaty KAZ @4 2003-09-22 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 04-0200594 INIST |
|---|
| ET : | Connection-based proof construction in non-commutative logic |
|---|
| AU : | GALMICHE (D.); NOTIN (J.-M.); VARDI (Moshe Y.); VORONKOV (Andrei) |
|---|
| AF : | LORIA - Université Henri Poincaré/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2850; Pp. 422-436; Bibl. 18 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | 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. |
|---|
| CC : | 001D02B01; 001D02A04; 001D02C02 |
|---|
| FD : | Programmation logique; Logique linéaire; Etiquette; Polarisation; Logique multiplicative; Réseau preuve |
|---|
| ED : | Logical programming; Linear logic; Label; Polarization; Multiplicative logic; Proof net |
|---|
| SD : | Programación lógica; Lógica lineal; Etiqueta; Polarización |
|---|
| LO : | INIST-16343.354000117770190300 |
|---|
| ID : | 04-0200594 |
|---|
Links to Exploration step
Pascal:04-0200594
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">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><inist:fA14 i1="01"><s1>LORIA - Université Henri Poincaré</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Notin, J M" sort="Notin, J M" uniqKey="Notin J" first="J.-M." last="Notin">J.-M. Notin</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - Université Henri Poincaré</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0200594</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 04-0200594 INIST</idno>
<idno type="RBID">Pascal:04-0200594</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000698</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">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><inist:fA14 i1="01"><s1>LORIA - Université Henri Poincaré</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><author><name sortKey="Notin, J M" sort="Notin, J M" uniqKey="Notin J" first="J.-M." last="Notin">J.-M. Notin</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA - Université Henri Poincaré</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</inist:fA14><series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="2003">2003</date>
</imprint><seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Label</term>
<term>Linear logic</term>
<term>Logical programming</term>
<term>Multiplicative logic</term>
<term>Polarization</term>
<term>Proof net</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Programmation logique</term>
<term>Logique linéaire</term>
<term>Etiquette</term>
<term>Polarisation</term>
<term>Logique multiplicative</term>
<term>Réseau preuve</term>
</keywords><front><div type="abstract" xml:lang="en">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><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>2850</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Connection-based proof construction in non-commutative logic</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>LPAR 2003 : logic for programming artificial intelligence, and reasoning : Almaty, 22-26 September 2003</s1>
</fA09><fA11 i1="01" i2="1"><s1>GALMICHE (D.)</s1>
</fA11><fA11 i1="02" i2="1"><s1>NOTIN (J.-M.)</s1>
</fA11><fA12 i1="01" i2="1"><s1>VARDI (Moshe Y.)</s1>
<s9>ed.</s9>
</fA12><fA12 i1="02" i2="1"><s1>VORONKOV (Andrei)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>LORIA - Université Henri Poincaré</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
</fA14><fA20><s1>422-436</s1>
</fA20><fA21><s1>2003</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-20101-7</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000117770190300</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>18 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>04-0200594</s0>
</fA47><fA60><s1>P</s1>
<s2>C</s2>
</fA60><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0>
</fA64><fA66 i1="01"><s0>DEU</s0>
</fA66><fC01 i1="01" l="ENG"><s0>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.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02B01</s0>
</fC02><fC02 i1="02" i2="X"><s0>001D02A04</s0>
</fC02><fC02 i1="03" i2="X"><s0>001D02C02</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Programmation logique</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Logical programming</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Programación lógica</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Logique linéaire</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Linear logic</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Lógica lineal</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Etiquette</s0>
<s5>11</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Label</s0>
<s5>11</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Etiqueta</s0>
<s5>11</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Polarisation</s0>
<s5>12</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Polarization</s0>
<s5>12</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Polarización</s0>
<s5>12</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Logique multiplicative</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Multiplicative logic</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Réseau preuve</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Proof net</s0>
<s4>CD</s4>
<s5>97</s5>
</fC03><fN21><s1>138</s1>
</fN21><fN82><s1>PSI</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>Logic for programming, artificial intelligence and reasoning. International conference</s1>
<s2>10</s2>
<s3>Almaty KAZ</s3>
<s4>2003-09-22</s4>
</fA30><server><NO>PASCAL 04-0200594 INIST</NO>
<ET>Connection-based proof construction in non-commutative logic</ET>
<AU>GALMICHE (D.); NOTIN (J.-M.); VARDI (Moshe Y.); VORONKOV (Andrei)</AU>
<AF>LORIA - Université Henri Poincaré/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2850; Pp. 422-436; Bibl. 18 ref.</SO>
<LA>Anglais</LA>
<EA>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.</EA>
<CC>001D02B01; 001D02A04; 001D02C02</CC>
<FD>Programmation logique; Logique linéaire; Etiquette; Polarisation; Logique multiplicative; Réseau preuve</FD>
<ED>Logical programming; Linear logic; Label; Polarization; Multiplicative logic; Proof net</ED>
<SD>Programación lógica; Lógica lineal; Etiqueta; Polarización</SD>
<LO>INIST-16343.354000117770190300</LO>
<ID>04-0200594</ID>
</server>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000698 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000698 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Corpus
|type= RBID
|clé= Pascal:04-0200594
|texte= Connection-based proof construction in non-commutative logic
}}
| This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022 |  |
