InforLorV4, PascalFrancis, Corpus, bibRecord, 000811

LINK: A proof environment based on proof nets

Identifieur interne : 000811 ( PascalFrancis/Corpus ); précédent : 000810; suivant : 000812

LINK: A proof environment based on proof nets

Auteurs : L. Habert ; J.-M. Notin ; D. Galmiche

Source :

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

RBID : Pascal:03-0185507

Descripteurs français

Pascal (Inist)
- Programmation logique, Démonstration théorème, Démonstration automatique, Réseau preuve.

English descriptors

KwdEn :
- Automatic proving, Logical programming, Proof net, Theorem proving.

Notice en format standard (ISO 2709)

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

A01	`01`	`1`		`@0 0302-9743`
A05				`@2 2381`
A08	`01`	`1`	`ENG`	`@1 LINK: A proof environment based on proof nets`
A09	`01`	`1`	`ENG`	`@1 TABLEAUX 2002 : automated reasoning with analytic tableaux and related methods : Copenhagen, 30 July - 1 August 2002`
A11	`01`	`1`		`@1 HABERT (L.)`
A11	`02`	`1`		`@1 NOTIN (J.-M.)`
A11	`03`	`1`		`@1 GALMICHE (D.)`
A12	`01`	`1`		`@1 EGLY (Uwe) @9 ed.`
A12	`02`	`1`		`@1 FERMULLER (Christian G.) @9 ed.`
A14	`01`			`@1 LORIA-Université Henri Poincaré, Campus Scientifique, BP 239 @2 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut.`
A20				`@1 330-334`
A21				`@1 2002`
A23	`01`			`@0 ENG`
A26	`01`			`@0 3-540-43929-3`
A43	`01`			`@1 INIST @2 16343 @5 354000108477710220`
A44				`@0 0000 @1 © 2003 INIST-CNRS. All rights reserved.`
A45				`@0 11 ref.`
A47	`01`	`1`		`@0 03-0185507`
A60				`@1 P @2 C`
A61				`@0 A`
A64	`01`	`1`		`@0 Lecture notes in computer science`
A66	`01`			`@0 DEU`
C02	`01`	`X`		`@0 001D02A04`
C03	`01`	`X`	`FRE`	`@0 Programmation logique @5 03`
C03	`01`	`X`	`ENG`	`@0 Logical programming @5 03`
C03	`01`	`X`	`SPA`	`@0 Programación lógica @5 03`
C03	`02`	`X`	`FRE`	`@0 Démonstration théorème @5 06`
C03	`02`	`X`	`ENG`	`@0 Theorem proving @5 06`
C03	`02`	`X`	`SPA`	`@0 Demostración teorema @5 06`
C03	`03`	`X`	`FRE`	`@0 Démonstration automatique @5 07`
C03	`03`	`X`	`ENG`	`@0 Automatic proving @5 07`
C03	`03`	`X`	`SPA`	`@0 Demostración automática @5 07`
C03	`04`	`X`	`FRE`	`@0 Réseau preuve @4 CD @5 96`
C03	`04`	`X`	`ENG`	`@0 Proof net @4 CD @5 96`
N21				`@1 104`
N82				`@1 PSI`

A30	`01`	`1`	`ENG`	`@1 International conference on automated reasoning with analytical tableaux and related methods @3 Copenhagen DNK @4 2002-07-30`

Format Inist (serveur)

NO :	PASCAL 03-0185507 INIST
ET :	LINK: A proof environment based on proof nets
AU :	HABERT (L.); NOTIN (J.-M.); GALMICHE (D.); EGLY (Uwe); FERMULLER (Christian G.)
AF :	LORIA-Université Henri Poincaré, Campus Scientifique, BP 239/Vandœuvre-lès-Nancy/France (1 aut., 2 aut., 3 aut.)
DT :	Publication en série; Congrès; Niveau analytique
SO :	Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2002; Vol. 2381; Pp. 330-334; Bibl. 11 ref.
LA :	Anglais
CC :	001D02A04
FD :	Programmation logique; Démonstration théorème; Démonstration automatique; Réseau preuve
ED :	Logical programming; Theorem proving; Automatic proving; Proof net
SD :	Programación lógica; Demostración teorema; Demostración automática
LO :	INIST-16343.354000108477710220
ID :	03-0185507

Links to Exploration step

Pascal:03-0185507

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">LINK: A proof environment based on proof nets</title>
<author><name sortKey="Habert, L" sort="Habert, L" uniqKey="Habert L" first="L." last="Habert">L. Habert</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-Université Henri Poincaré, Campus Scientifique, BP 239</s1>
<s2>Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</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><inist:fA14 i1="01"><s1>LORIA-Université Henri Poincaré, Campus Scientifique, BP 239</s1>
<s2>Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<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é, Campus Scientifique, BP 239</s1>
<s2>Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">03-0185507</idno>
<date when="2002">2002</date>
<idno type="stanalyst">PASCAL 03-0185507 INIST</idno>
<idno type="RBID">Pascal:03-0185507</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000811</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">LINK: A proof environment based on proof nets</title>
<author><name sortKey="Habert, L" sort="Habert, L" uniqKey="Habert L" first="L." last="Habert">L. Habert</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-Université Henri Poincaré, Campus Scientifique, BP 239</s1>
<s2>Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</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><inist:fA14 i1="01"><s1>LORIA-Université Henri Poincaré, Campus Scientifique, BP 239</s1>
<s2>Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<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é, Campus Scientifique, BP 239</s1>
<s2>Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 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="2002">2002</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>Logical programming</term>
<term>Proof net</term>
<term>Theorem proving</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Programmation logique</term>
<term>Démonstration théorème</term>
<term>Démonstration automatique</term>
<term>Réseau preuve</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>2381</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>LINK: A proof environment based on proof nets</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>TABLEAUX 2002 : automated reasoning with analytic tableaux and related methods : Copenhagen, 30 July - 1 August 2002</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>HABERT (L.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>NOTIN (J.-M.)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>GALMICHE (D.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>EGLY (Uwe)</s1>
<s9>ed.</s9>
</fA12>
<fA12 i1="02" i2="1"><s1>FERMULLER (Christian G.)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>LORIA-Université Henri Poincaré, Campus Scientifique, BP 239</s1>
<s2>Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA20><s1>330-334</s1>
</fA20>
<fA21><s1>2002</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-43929-3</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000108477710220</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2003 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>11 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>03-0185507</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>
<fC02 i1="01" i2="X"><s0>001D02A04</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Programmation logique</s0>
<s5>03</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Logical programming</s0>
<s5>03</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Programación lógica</s0>
<s5>03</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Démonstration théorème</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Theorem proving</s0>
<s5>06</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Demostración teorema</s0>
<s5>06</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Démonstration automatique</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Automatic proving</s0>
<s5>07</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Demostración automática</s0>
<s5>07</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Réseau preuve</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Proof net</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21><s1>104</s1>
</fN21>
<fN82><s1>PSI</s1>
</fN82>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>International conference on automated reasoning with analytical tableaux and related methods</s1>
<s3>Copenhagen DNK</s3>
<s4>2002-07-30</s4>
</fA30>
</pR>
</standard>
<server><NO>PASCAL 03-0185507 INIST</NO>
<ET>LINK: A proof environment based on proof nets</ET>
<AU>HABERT (L.); NOTIN (J.-M.); GALMICHE (D.); EGLY (Uwe); FERMULLER (Christian G.)</AU>
<AF>LORIA-Université Henri Poincaré, Campus Scientifique, BP 239/Vandœuvre-lès-Nancy/France (1 aut., 2 aut., 3 aut.)</AF>
<DT>Publication en série; Congrès; Niveau analytique</DT>
<SO>Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2002; Vol. 2381; Pp. 330-334; Bibl. 11 ref.</SO>
<LA>Anglais</LA>
<CC>001D02A04</CC>
<FD>Programmation logique; Démonstration théorème; Démonstration automatique; Réseau preuve</FD>
<ED>Logical programming; Theorem proving; Automatic proving; Proof net</ED>
<SD>Programación lógica; Demostración teorema; Demostración automática</SD>
<LO>INIST-16343.354000108477710220</LO>
<ID>03-0185507</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 000811 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000811 | 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:03-0185507
   |texte=   LINK: A proof environment based on proof nets
}}

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

LINK: A proof environment based on proof nets

LINK: A proof environment based on proof nets

Source :

Descripteurs français

English descriptors

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