InforLorV4, PascalFrancis, Corpus, bibRecord, 000B21

The non-associative Lambek calculus with product in polynomial time

Identifieur interne : 000B21 ( PascalFrancis/Corpus ); précédent : 000B20; suivant : 000B22

The non-associative Lambek calculus with product in polynomial time

Auteurs : P. De Groote

Source :

Lecture notes in computer science [ 0302-9743 ] ; 1999.

RBID : Pascal:99-0374821

Descripteurs français

Pascal (Inist)
- Démonstration automatique, Démonstration théorème, Logique intuitionniste, Analyse syntaxique, Analyse sémantique.

English descriptors

KwdEn :
- Automatic proving, Intuitionistic logic, Semantic analysis, Syntactic analysis, Theorem proving.

Abstract

We prove, by introducing a new kind of sequent calculus, that the decision problem for the non-associative Lambek calculus with product belongs to PTIME. This solves an open problem.

Notice en format standard (ISO 2709)

Pour connaître la documentation sur le format Inist Standard.

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 1617`
A08	`01`	`1`	`ENG`	`@1 The non-associative Lambek calculus with product in polynomial time`
A09	`01`	`1`	`ENG`	`@1 Automated reasoning with analytic tableaux and related methods : Saratoga Springs NY, 7-11 June 1999`
A11	`01`	`1`		`@1 DE GROOTE (P.)`
A12	`01`	`1`		`@1 MURRAY (Neil V.) @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 128-139`
A21				`@1 1999`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-66086-0`
A43	`01`			`@1 INIST @2 16343 @5 354000084534670140`
A44				`@0 0000 @1 © 1999 INIST-CNRS. All rights reserved.`
A45				`@0 6 ref.`
A47	`01`	`1`		`@0 99-0374821`
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 prove, by introducing a new kind of sequent calculus, that the decision problem for the non-associative Lambek calculus with product belongs to PTIME. This solves an open problem.`
C02	`01`	`X`		`@0 001D02C01`
C03	`01`	`X`	`FRE`	`@0 Démonstration automatique @5 01`
C03	`01`	`X`	`ENG`	`@0 Automatic proving @5 01`
C03	`01`	`X`	`SPA`	`@0 Demostración automática @5 01`
C03	`02`	`X`	`FRE`	`@0 Démonstration théorème @5 02`
C03	`02`	`X`	`ENG`	`@0 Theorem proving @5 02`
C03	`02`	`X`	`SPA`	`@0 Demostración teorema @5 02`
C03	`03`	`X`	`FRE`	`@0 Logique intuitionniste @5 03`
C03	`03`	`X`	`ENG`	`@0 Intuitionistic logic @5 03`
C03	`03`	`X`	`SPA`	`@0 Lógica intuicionista @5 03`
C03	`04`	`X`	`FRE`	`@0 Analyse syntaxique @5 04`
C03	`04`	`X`	`ENG`	`@0 Syntactic analysis @5 04`
C03	`04`	`X`	`SPA`	`@0 Análisis sintáxico @5 04`
C03	`05`	`X`	`FRE`	`@0 Analyse sémantique @5 05`
C03	`05`	`X`	`ENG`	`@0 Semantic analysis @5 05`
C03	`05`	`X`	`SPA`	`@0 Análisis semántico @5 05`
N21				`@1 242`

A30	`01`	`1`	`ENG`	`@1 TABLEAUX '99. International conference @3 Saratoga Springs NY USA @4 1999-06-07`

Format Inist (serveur)

NO :	PASCAL 99-0374821 INIST
ET :	The non-associative Lambek calculus with product in polynomial time
AU :	DE GROOTE (P.); MURRAY (Neil V.)
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. 1617; Pp. 128-139; Bibl. 6 ref.
LA :	Anglais
EA :	We prove, by introducing a new kind of sequent calculus, that the decision problem for the non-associative Lambek calculus with product belongs to PTIME. This solves an open problem.
CC :	001D02C01
FD :	Démonstration automatique; Démonstration théorème; Logique intuitionniste; Analyse syntaxique; Analyse sémantique
ED :	Automatic proving; Theorem proving; Intuitionistic logic; Syntactic analysis; Semantic analysis
SD :	Demostración automática; Demostración teorema; Lógica intuicionista; Análisis sintáxico; Análisis semántico
LO :	INIST-16343.354000084534670140
ID :	99-0374821

Links to Exploration step

Pascal:99-0374821

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">The non-associative Lambek calculus with product in polynomial time</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>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">99-0374821</idno>
<date when="1999">1999</date>
<idno type="stanalyst">PASCAL 99-0374821 INIST</idno>
<idno type="RBID">Pascal:99-0374821</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000B21</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">The non-associative Lambek calculus with product in polynomial time</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>
</affiliation>
</author>
</analytic>
<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>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Automatic proving</term>
<term>Intuitionistic logic</term>
<term>Semantic analysis</term>
<term>Syntactic analysis</term>
<term>Theorem proving</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Démonstration automatique</term>
<term>Démonstration théorème</term>
<term>Logique intuitionniste</term>
<term>Analyse syntaxique</term>
<term>Analyse sémantique</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We prove, by introducing a new kind of sequent calculus, that the decision problem for the non-associative Lambek calculus with product belongs to PTIME. This solves an open problem.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>1617</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>The non-associative Lambek calculus with product in polynomial time</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Automated reasoning with analytic tableaux and related methods : Saratoga Springs NY, 7-11 June 1999</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>DE GROOTE (P.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>MURRAY (Neil V.)</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>128-139</s1>
</fA20>
<fA21><s1>1999</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-66086-0</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000084534670140</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 1999 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>6 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>99-0374821</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<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 prove, by introducing a new kind of sequent calculus, that the decision problem for the non-associative Lambek calculus with product belongs to PTIME. This solves an open problem.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02C01</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Démonstration automatique</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Automatic proving</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Demostración automática</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Démonstration théorème</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Theorem proving</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Demostración teorema</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Logique intuitionniste</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Intuitionistic logic</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Lógica intuicionista</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Analyse syntaxique</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Syntactic analysis</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Análisis sintáxico</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Analyse sémantique</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Semantic analysis</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Análisis semántico</s0>
<s5>05</s5>
</fC03>
<fN21><s1>242</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>TABLEAUX '99. International conference</s1>
<s3>Saratoga Springs NY USA</s3>
<s4>1999-06-07</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 99-0374821 INIST</NO>
<ET>The non-associative Lambek calculus with product in polynomial time</ET>
<AU>DE GROOTE (P.); MURRAY (Neil V.)</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. 1617; Pp. 128-139; Bibl. 6 ref.</SO>
<LA>Anglais</LA>
<EA>We prove, by introducing a new kind of sequent calculus, that the decision problem for the non-associative Lambek calculus with product belongs to PTIME. This solves an open problem.</EA>
<CC>001D02C01</CC>
<FD>Démonstration automatique; Démonstration théorème; Logique intuitionniste; Analyse syntaxique; Analyse sémantique</FD>
<ED>Automatic proving; Theorem proving; Intuitionistic logic; Syntactic analysis; Semantic analysis</ED>
<SD>Demostración automática; Demostración teorema; Lógica intuicionista; Análisis sintáxico; Análisis semántico</SD>
<LO>INIST-16343.354000084534670140</LO>
<ID>99-0374821</ID>
</server>
</inist>
</record>

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 000B21 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000B21 | 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-0374821
   |texte=   The non-associative Lambek calculus with product in polynomial time
}}

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

	Serveur d'exploration sur la recherche en informatique en Lorraine
	Attention, ce site est en cours de développement ! Attention, site généré par des moyens informatiques à partir de corpus bruts. Les informations ne sont donc pas validées.

Serveur d'exploration sur la recherche en informatique en Lorraine

The non-associative Lambek calculus with product in polynomial time

The non-associative Lambek calculus with product in polynomial time

Source :

Descripteurs français

English descriptors

Abstract

Notice en format standard (ISO 2709)

Format Inist (serveur)

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri