A dynamic programming approach to categorical deduction
Identifieur interne :
000B12 ( PascalFrancis/Corpus );
précédent :
000B11;
suivant :
000B13
A dynamic programming approach to categorical deduction
Auteurs : P. De GrooteSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 1999.
RBID : Pascal:99-0420847
Descripteurs français
English descriptors
Abstract
We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, allows us to derive an automatic categorial deduction algorithm akin to the well-known Cocke-Kasami-Younger parsing algorithm.
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 1632 |
|---|
| A08 | 01 | 1 | ENG | @1 A dynamic programming approach to categorical deduction |
|---|
| A09 | 01 | 1 | ENG | @1 Automated deduction - CADE-16 : Trento, 7-10 July 1999 |
|---|
| A11 | 01 | 1 | | @1 DE GROOTE (P.) |
|---|
| A12 | 01 | 1 | | @1 GANZINGER (Harald) @9 ed. |
|---|
| A14 | 01 | | | @1 LORIA UMR n° 7503 - INRIA, Campus Scientifique, B.P. 239 @2 54506 Vandœuvre lès Nancy @3 FRA @Z 1 aut. |
|---|
| A20 | | | | @1 1-15 |
|---|
| A21 | | | | @1 1999 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-66222-7 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000084546970010 |
|---|
| A44 | | | | @0 0000 @1 © 1999 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 11 ref. |
|---|
| A47 | 01 | 1 | | @0 99-0420847 |
|---|
| 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 reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, allows us to derive an automatic categorial deduction algorithm akin to the well-known Cocke-Kasami-Younger parsing algorithm. |
|---|
| C02 | 01 | X | | @0 001D02C05 |
|---|
| C03 | 01 | X | FRE | @0 Intelligence artificielle @5 01 |
|---|
| C03 | 01 | X | ENG | @0 Artificial intelligence @5 01 |
|---|
| C03 | 01 | X | SPA | @0 Inteligencia artificial @5 01 |
|---|
| C03 | 02 | X | FRE | @0 Programmation dynamique @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Dynamic programming @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Programación dinámica @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Programmation logique @5 03 |
|---|
| C03 | 03 | X | ENG | @0 Logical programming @5 03 |
|---|
| C03 | 03 | X | SPA | @0 Programación lógica @5 03 |
|---|
| C03 | 04 | X | FRE | @0 Programmation linéaire @5 04 |
|---|
| C03 | 04 | X | ENG | @0 Linear programming @5 04 |
|---|
| C03 | 04 | X | SPA | @0 Programación lineal @5 04 |
|---|
| C03 | 05 | X | FRE | @0 Preuve programme @5 05 |
|---|
| C03 | 05 | X | ENG | @0 Program proof @5 05 |
|---|
| C03 | 05 | X | SPA | @0 Prueba programa @5 05 |
|---|
| C03 | 06 | X | FRE | @0 Sémantique formelle @5 06 |
|---|
| C03 | 06 | X | ENG | @0 Formal semantics @5 06 |
|---|
| C03 | 06 | X | SPA | @0 Semántica formal @5 06 |
|---|
| C03 | 07 | X | FRE | @0 Déduction automatique @4 CD @5 96 |
|---|
| C03 | 07 | X | ENG | @0 Automatic deduction @4 CD @5 96 |
|---|
| N21 | | | | @1 270 |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 International conference on automated deduction @2 16 @3 Trento ITA @4 1999-07-07 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 99-0420847 INIST |
|---|
| ET : | A dynamic programming approach to categorical deduction |
|---|
| AU : | DE GROOTE (P.); GANZINGER (Harald) |
|---|
| AF : | LORIA UMR n° 7503 - INRIA, Campus Scientifique, B.P. 239/54506 Vandœuvre lès Nancy/France (1 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1999; Vol. 1632; Pp. 1-15; Bibl. 11 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, allows us to derive an automatic categorial deduction algorithm akin to the well-known Cocke-Kasami-Younger parsing algorithm. |
|---|
| CC : | 001D02C05 |
|---|
| FD : | Intelligence artificielle; Programmation dynamique; Programmation logique; Programmation linéaire; Preuve programme; Sémantique formelle; Déduction automatique |
|---|
| ED : | Artificial intelligence; Dynamic programming; Logical programming; Linear programming; Program proof; Formal semantics; Automatic deduction |
|---|
| SD : | Inteligencia artificial; Programación dinámica; Programación lógica; Programación lineal; Prueba programa; Semántica formal |
|---|
| LO : | INIST-16343.354000084546970010 |
|---|
| ID : | 99-0420847 |
|---|
Links to Exploration step
Pascal:99-0420847
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A dynamic programming approach to categorical deduction</title>
<author><name sortKey="De Groote, P" sort="De Groote, P" uniqKey="De Groote P" first="P." last="De Groote">P. De Groote</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA UMR n° 7503 - INRIA, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandœuvre lès Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">99-0420847</idno>
<date when="1999">1999</date>
<idno type="stanalyst">PASCAL 99-0420847 INIST</idno>
<idno type="RBID">Pascal:99-0420847</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000B12</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A dynamic programming approach to categorical deduction</title>
<author><name sortKey="De Groote, P" sort="De Groote, P" uniqKey="De Groote P" first="P." last="De Groote">P. De Groote</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA UMR n° 7503 - INRIA, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandœuvre lès Nancy</s2>
<s3>FRA</s3>
<sZ>1 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="1999">1999</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>Artificial intelligence</term>
<term>Automatic deduction</term>
<term>Dynamic programming</term>
<term>Formal semantics</term>
<term>Linear programming</term>
<term>Logical programming</term>
<term>Program proof</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Intelligence artificielle</term>
<term>Programmation dynamique</term>
<term>Programmation logique</term>
<term>Programmation linéaire</term>
<term>Preuve programme</term>
<term>Sémantique formelle</term>
<term>Déduction automatique</term>
</keywords><front><div type="abstract" xml:lang="en">We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, allows us to derive an automatic categorial deduction algorithm akin to the well-known Cocke-Kasami-Younger parsing algorithm.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>1632</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>A dynamic programming approach to categorical deduction</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Automated deduction - CADE-16 : Trento, 7-10 July 1999</s1>
</fA09><fA11 i1="01" i2="1"><s1>DE GROOTE (P.)</s1>
</fA11><fA12 i1="01" i2="1"><s1>GANZINGER (Harald)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>LORIA UMR n° 7503 - INRIA, Campus Scientifique, B.P. 239</s1>
<s2>54506 Vandœuvre lès Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
</fA14><fA20><s1>1-15</s1>
</fA20><fA21><s1>1999</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-66222-7</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000084546970010</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 1999 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>11 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>99-0420847</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 reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, allows us to derive an automatic categorial deduction algorithm akin to the well-known Cocke-Kasami-Younger parsing algorithm.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02C05</s0>
</fC02><fC03 i1="01" i2="X" l="FRE"><s0>Intelligence artificielle</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="ENG"><s0>Artificial intelligence</s0>
<s5>01</s5>
</fC03><fC03 i1="01" i2="X" l="SPA"><s0>Inteligencia artificial</s0>
<s5>01</s5>
</fC03><fC03 i1="02" i2="X" l="FRE"><s0>Programmation dynamique</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Dynamic programming</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Programación dinámica</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Programmation logique</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Logical programming</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Programación lógica</s0>
<s5>03</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Programmation linéaire</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Linear programming</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Programación lineal</s0>
<s5>04</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Preuve programme</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Program proof</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Prueba programa</s0>
<s5>05</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Sémantique formelle</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Formal semantics</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Semántica formal</s0>
<s5>06</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Déduction automatique</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Automatic deduction</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03><fN21><s1>270</s1>
</fN21><pR><fA30 i1="01" i2="1" l="ENG"><s1>International conference on automated deduction</s1>
<s2>16</s2>
<s3>Trento ITA</s3>
<s4>1999-07-07</s4>
</fA30><server><NO>PASCAL 99-0420847 INIST</NO>
<ET>A dynamic programming approach to categorical deduction</ET>
<AU>DE GROOTE (P.); GANZINGER (Harald)</AU>
<AF>LORIA UMR n° 7503 - INRIA, Campus Scientifique, B.P. 239/54506 Vandœuvre lès Nancy/France (1 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 1999; Vol. 1632; Pp. 1-15; Bibl. 11 ref.</SO>
<LA>Anglais</LA>
<EA>We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, allows us to derive an automatic categorial deduction algorithm akin to the well-known Cocke-Kasami-Younger parsing algorithm.</EA>
<CC>001D02C05</CC>
<FD>Intelligence artificielle; Programmation dynamique; Programmation logique; Programmation linéaire; Preuve programme; Sémantique formelle; Déduction automatique</FD>
<ED>Artificial intelligence; Dynamic programming; Logical programming; Linear programming; Program proof; Formal semantics; Automatic deduction</ED>
<SD>Inteligencia artificial; Programación dinámica; Programación lógica; Programación lineal; Prueba programa; Semántica formal</SD>
<LO>INIST-16343.354000084546970010</LO>
<ID>99-0420847</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 000B12 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000B12 | 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:99-0420847
|texte= A dynamic programming approach to categorical deduction
}}
| 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 |  |
