Proof search and proof check for equational and inductive theorems
Identifieur interne :
000703 ( PascalFrancis/Corpus );
précédent :
000702;
suivant :
000704
Proof search and proof check for equational and inductive theorems
Auteurs : Eric Deplagne ;
Claude Kirchner ;
Hélène Kirchner ;
Quang Huy NguyenSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2003.
RBID : Pascal:04-0199445
Descripteurs français
English descriptors
Abstract
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the strong constraint of safe cooperation of both. In practice, we instantiate the theoretical study on the Coq proof assistant and the ELAN rewriting based system, focusing first on equational and then on inductive proofs. Different concepts, especially rewriting calculus and deduction modulo, contribute to define and to relate proof search, proof representation and proof check.
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 2741 |
|---|
| A08 | 01 | 1 | ENG | @1 Proof search and proof check for equational and inductive theorems |
|---|
| A09 | 01 | 1 | ENG | @1 Automated deduction - CADE-19 : Miami Beach FL, 28 July - 2 August 2003 |
|---|
| A11 | 01 | 1 | | @1 DEPLAGNE (Eric) |
|---|
| A11 | 02 | 1 | | @1 KIRCHNER (Claude) |
|---|
| A11 | 03 | 1 | | @1 KIRCHNER (Hélène) |
|---|
| A11 | 04 | 1 | | @1 NGUYEN (Quang Huy) |
|---|
| A12 | 01 | 1 | | @1 BAADER (Franz) @9 ed. |
|---|
| A14 | 01 | | | @1 LORIA-INRIA-CNRS, BP 239 @2 54506 Vandœuvre-lès-Nancy @3 FRA @Z 1 aut. @Z 2 aut. @Z 3 aut. @Z 4 aut. |
|---|
| A20 | | | | @1 297-316 |
|---|
| A21 | | | | @1 2003 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-40559-3 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000117776390240 |
|---|
| A44 | | | | @0 0000 @1 © 2004 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 2 p.1/4 |
|---|
| A47 | 01 | 1 | | @0 04-0199445 |
|---|
| 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 This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the strong constraint of safe cooperation of both. In practice, we instantiate the theoretical study on the Coq proof assistant and the ELAN rewriting based system, focusing first on equational and then on inductive proofs. Different concepts, especially rewriting calculus and deduction modulo, contribute to define and to relate proof search, proof representation and proof check. |
|---|
| C02 | 01 | X | | @0 001D02B01 |
|---|
| C02 | 02 | X | | @0 001D02A04 |
|---|
| 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 | 3 | FRE | @0 Système réécriture @5 04 |
|---|
| C03 | 03 | 3 | ENG | @0 Rewriting systems @5 04 |
|---|
| C03 | 04 | X | FRE | @0 Théorie équationnelle @5 05 |
|---|
| C03 | 04 | X | ENG | @0 Equational theory @5 05 |
|---|
| C03 | 04 | X | SPA | @0 Teoría ecuaciónal @5 05 |
|---|
| C03 | 05 | X | FRE | @0 Induction @5 06 |
|---|
| C03 | 05 | X | ENG | @0 Induction @5 06 |
|---|
| C03 | 05 | X | SPA | @0 Inducción @5 06 |
|---|
| C03 | 06 | X | FRE | @0 Réécriture @5 11 |
|---|
| C03 | 06 | X | ENG | @0 Rewriting @5 11 |
|---|
| C03 | 06 | X | SPA | @0 Reescritura @5 11 |
|---|
| C03 | 07 | X | FRE | @0 Déduction @5 12 |
|---|
| C03 | 07 | X | ENG | @0 Deduction @5 12 |
|---|
| C03 | 07 | X | SPA | @0 Deducción @5 12 |
|---|
| N21 | | | | @1 138 |
|---|
| N82 | | | | @1 OTO |
|---|
|
|---|
| pR |
| A30 | 01 | 1 | ENG | @1 International conference on automated deduction @2 19 @3 Miami Beach FL USA @4 2003-07-28 |
|---|
|
|---|
Format Inist (serveur)
| NO : | PASCAL 04-0199445 INIST |
|---|
| ET : | Proof search and proof check for equational and inductive theorems |
|---|
| AU : | DEPLAGNE (Eric); KIRCHNER (Claude); KIRCHNER (Hélène); NGUYEN (Quang Huy); BAADER (Franz) |
|---|
| AF : | LORIA-INRIA-CNRS, BP 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut., 3 aut., 4 aut.) |
|---|
| DT : | Publication en série; Congrès; Niveau analytique |
|---|
| SO : | Lecture notes in computer science; ISSN 0302-9743; Allemagne; Da. 2003; Vol. 2741; Pp. 297-316; Bibl. 2 p.1/4 |
|---|
| LA : | Anglais |
|---|
| EA : | This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the strong constraint of safe cooperation of both. In practice, we instantiate the theoretical study on the Coq proof assistant and the ELAN rewriting based system, focusing first on equational and then on inductive proofs. Different concepts, especially rewriting calculus and deduction modulo, contribute to define and to relate proof search, proof representation and proof check. |
|---|
| CC : | 001D02B01; 001D02A04 |
|---|
| FD : | Démonstration automatique; Démonstration théorème; Système réécriture; Théorie équationnelle; Induction; Réécriture; Déduction |
|---|
| ED : | Automatic proving; Theorem proving; Rewriting systems; Equational theory; Induction; Rewriting; Deduction |
|---|
| SD : | Demostración automática; Demostración teorema; Teoría ecuaciónal; Inducción; Reescritura; Deducción |
|---|
| LO : | INIST-16343.354000117776390240 |
|---|
| ID : | 04-0199445 |
|---|
Links to Exploration step
Pascal:04-0199445
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Proof search and proof check for equational and inductive theorems</title>
<author><name sortKey="Deplagne, Eric" sort="Deplagne, Eric" uniqKey="Deplagne E" first="Eric" last="Deplagne">Eric Deplagne</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA-CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA-CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA-CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Nguyen, Quang Huy" sort="Nguyen, Quang Huy" uniqKey="Nguyen Q" first="Quang Huy" last="Nguyen">Quang Huy Nguyen</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA-CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0199445</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 04-0199445 INIST</idno>
<idno type="RBID">Pascal:04-0199445</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000703</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Proof search and proof check for equational and inductive theorems</title>
<author><name sortKey="Deplagne, Eric" sort="Deplagne, Eric" uniqKey="Deplagne E" first="Eric" last="Deplagne">Eric Deplagne</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA-CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA-CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Kirchner, Helene" sort="Kirchner, Helene" uniqKey="Kirchner H" first="Hélène" last="Kirchner">Hélène Kirchner</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA-CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</inist:fA14><author><name sortKey="Nguyen, Quang Huy" sort="Nguyen, Quang Huy" uniqKey="Nguyen Q" first="Quang Huy" last="Nguyen">Quang Huy Nguyen</name>
<affiliation><inist:fA14 i1="01"><s1>LORIA-INRIA-CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 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>Automatic proving</term>
<term>Deduction</term>
<term>Equational theory</term>
<term>Induction</term>
<term>Rewriting</term>
<term>Rewriting systems</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>Système réécriture</term>
<term>Théorie équationnelle</term>
<term>Induction</term>
<term>Réécriture</term>
<term>Déduction</term>
</keywords><front><div type="abstract" xml:lang="en">This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the strong constraint of safe cooperation of both. In practice, we instantiate the theoretical study on the Coq proof assistant and the ELAN rewriting based system, focusing first on equational and then on inductive proofs. Different concepts, especially rewriting calculus and deduction modulo, contribute to define and to relate proof search, proof representation and proof check.</div>
</front><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01><fA05><s2>2741</s2>
</fA05><fA08 i1="01" i2="1" l="ENG"><s1>Proof search and proof check for equational and inductive theorems</s1>
</fA08><fA09 i1="01" i2="1" l="ENG"><s1>Automated deduction - CADE-19 : Miami Beach FL, 28 July - 2 August 2003</s1>
</fA09><fA11 i1="01" i2="1"><s1>DEPLAGNE (Eric)</s1>
</fA11><fA11 i1="02" i2="1"><s1>KIRCHNER (Claude)</s1>
</fA11><fA11 i1="03" i2="1"><s1>KIRCHNER (Hélène)</s1>
</fA11><fA11 i1="04" i2="1"><s1>NGUYEN (Quang Huy)</s1>
</fA11><fA12 i1="01" i2="1"><s1>BAADER (Franz)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>LORIA-INRIA-CNRS, BP 239</s1>
<s2>54506 Vandœuvre-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>1 aut.</sZ>
<sZ>2 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
</fA14><fA20><s1>297-316</s1>
</fA20><fA21><s1>2003</s1>
</fA21><fA23 i1="01"><s0>ENG</s0>
</fA23><fA26 i1="01"><s0>3-540-40559-3</s0>
</fA26><fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000117776390240</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>2 p.1/4</s0>
</fA45><fA47 i1="01" i2="1"><s0>04-0199445</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>This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the strong constraint of safe cooperation of both. In practice, we instantiate the theoretical study on the Coq proof assistant and the ELAN rewriting based system, focusing first on equational and then on inductive proofs. Different concepts, especially rewriting calculus and deduction modulo, contribute to define and to relate proof search, proof representation and proof check.</s0>
</fC01><fC02 i1="01" i2="X"><s0>001D02B01</s0>
</fC02><fC02 i1="02" i2="X"><s0>001D02A04</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="3" l="FRE"><s0>Système réécriture</s0>
<s5>04</s5>
</fC03><fC03 i1="03" i2="3" l="ENG"><s0>Rewriting systems</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Théorie équationnelle</s0>
<s5>05</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Equational theory</s0>
<s5>05</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Teoría ecuaciónal</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Induction</s0>
<s5>06</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Induction</s0>
<s5>06</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Inducción</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Réécriture</s0>
<s5>11</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Rewriting</s0>
<s5>11</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Reescritura</s0>
<s5>11</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Déduction</s0>
<s5>12</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Deduction</s0>
<s5>12</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Deducción</s0>
<s5>12</s5>
</fC03><fN21><s1>138</s1>
</fN21><fN82><s1>OTO</s1>
</fN82><pR><fA30 i1="01" i2="1" l="ENG"><s1>International conference on automated deduction</s1>
<s2>19</s2>
<s3>Miami Beach FL USA</s3>
<s4>2003-07-28</s4>
</fA30><server><NO>PASCAL 04-0199445 INIST</NO>
<ET>Proof search and proof check for equational and inductive theorems</ET>
<AU>DEPLAGNE (Eric); KIRCHNER (Claude); KIRCHNER (Hélène); NGUYEN (Quang Huy); BAADER (Franz)</AU>
<AF>LORIA-INRIA-CNRS, BP 239/54506 Vandœuvre-lès-Nancy/France (1 aut., 2 aut., 3 aut., 4 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. 2741; Pp. 297-316; Bibl. 2 p.1/4</SO>
<LA>Anglais</LA>
<EA>This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the strong constraint of safe cooperation of both. In practice, we instantiate the theoretical study on the Coq proof assistant and the ELAN rewriting based system, focusing first on equational and then on inductive proofs. Different concepts, especially rewriting calculus and deduction modulo, contribute to define and to relate proof search, proof representation and proof check.</EA>
<CC>001D02B01; 001D02A04</CC>
<FD>Démonstration automatique; Démonstration théorème; Système réécriture; Théorie équationnelle; Induction; Réécriture; Déduction</FD>
<ED>Automatic proving; Theorem proving; Rewriting systems; Equational theory; Induction; Rewriting; Deduction</ED>
<SD>Demostración automática; Demostración teorema; Teoría ecuaciónal; Inducción; Reescritura; Deducción</SD>
<LO>INIST-16343.354000117776390240</LO>
<ID>04-0199445</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 000703 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000703 | 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-0199445
|texte= Proof search and proof check for equational and inductive theorems
}}
| 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 |  |
