Superposition with equivalence reasoning and delayed clause normal form transformation
Identifieur interne :
000700 ( PascalFrancis/Corpus );
précédent :
000699;
suivant :
000701
Superposition with equivalence reasoning and delayed clause normal form transformation
Auteurs : Harald Ganzinger ;
Jürgen StuberSource :
-
Lecture notes in computer science [ 0302-9743 ] ; 2003.
RBID : Pascal:04-0200068
Descripteurs français
English descriptors
Abstract
This paper describes a superposition calculus where quantifiers are eliminated lazily. Superposition and simplification inferences may employ equivalences that have arbitrary formulas at their smaller side. A closely related calculus is implemented in the Saturate system and has shown useful on many examples, in particular in set theory. The paper presents a completeness proof and reports on practical experience obtained with the Saturate system.
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 Superposition with equivalence reasoning and delayed clause normal form transformation |
|---|
| A09 | 01 | 1 | ENG | @1 Automated deduction - CADE-19 : Miami Beach FL, 28 July - 2 August 2003 |
|---|
| A11 | 01 | 1 | | @1 GANZINGER (Harald) |
|---|
| A11 | 02 | 1 | | @1 STUBER (Jürgen) |
|---|
| A12 | 01 | 1 | | @1 BAADER (Franz) @9 ed. |
|---|
| A14 | 01 | | | @1 MPI für Informatik @2 66123 Saarbrücken @3 DEU @Z 1 aut. |
|---|
| A14 | 02 | | | @1 LORIA École des Mines de Nancy 615 Rue du Jardin Botanique @2 54600 Villers-lès-Nancy @3 FRA @Z 2 aut. |
|---|
| A20 | | | | @1 335-349 |
|---|
| A21 | | | | @1 2003 |
|---|
| A23 | 01 | | | @0 ENG |
|---|
| A26 | 01 | | | @0 3-540-40559-3 |
|---|
| A43 | 01 | | | @1 INIST @2 16343 @5 354000117776390280 |
|---|
| A44 | | | | @0 0000 @1 © 2004 INIST-CNRS. All rights reserved. |
|---|
| A45 | | | | @0 19 ref. |
|---|
| A47 | 01 | 1 | | @0 04-0200068 |
|---|
| 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 describes a superposition calculus where quantifiers are eliminated lazily. Superposition and simplification inferences may employ equivalences that have arbitrary formulas at their smaller side. A closely related calculus is implemented in the Saturate system and has shown useful on many examples, in particular in set theory. The paper presents a completeness proof and reports on practical experience obtained with the Saturate system. |
|---|
| 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 Retard @5 02 |
|---|
| C03 | 02 | X | ENG | @0 Delay @5 02 |
|---|
| C03 | 02 | X | SPA | @0 Retraso @5 02 |
|---|
| C03 | 03 | X | FRE | @0 Forme normale @5 03 |
|---|
| C03 | 03 | X | ENG | @0 Normal form @5 03 |
|---|
| C03 | 03 | X | SPA | @0 Forma normal @5 03 |
|---|
| C03 | 04 | X | FRE | @0 Transformation @5 04 |
|---|
| C03 | 04 | X | ENG | @0 Transformation @5 04 |
|---|
| C03 | 04 | X | SPA | @0 Transformación @5 04 |
|---|
| C03 | 05 | X | FRE | @0 Inférence @5 05 |
|---|
| C03 | 05 | X | ENG | @0 Inference @5 05 |
|---|
| C03 | 05 | X | SPA | @0 Inferencia @5 05 |
|---|
| C03 | 06 | X | FRE | @0 Théorie ensemble @5 06 |
|---|
| C03 | 06 | X | ENG | @0 Set theory @5 06 |
|---|
| C03 | 06 | X | SPA | @0 Teoría conjunto @5 06 |
|---|
| C03 | 07 | X | FRE | @0 Superposition @5 11 |
|---|
| C03 | 07 | X | ENG | @0 Superposition @5 11 |
|---|
| C03 | 07 | X | SPA | @0 Superposición @5 11 |
|---|
| C03 | 08 | X | FRE | @0 Quantificateur @5 12 |
|---|
| C03 | 08 | X | ENG | @0 Quantifier @5 12 |
|---|
| C03 | 08 | X | SPA | @0 Cuantificador @5 12 |
|---|
| C03 | 09 | X | FRE | @0 Complétude @5 16 |
|---|
| C03 | 09 | X | ENG | @0 Completeness @5 16 |
|---|
| C03 | 09 | X | SPA | @0 Completitud @5 16 |
|---|
| 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-0200068 INIST |
|---|
| ET : | Superposition with equivalence reasoning and delayed clause normal form transformation |
|---|
| AU : | GANZINGER (Harald); STUBER (Jürgen); BAADER (Franz) |
|---|
| AF : | MPI für Informatik/66123 Saarbrücken/Allemagne (1 aut.); LORIA École des Mines de Nancy 615 Rue du Jardin Botanique/54600 Villers-lès-Nancy/France (2 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. 335-349; Bibl. 19 ref. |
|---|
| LA : | Anglais |
|---|
| EA : | This paper describes a superposition calculus where quantifiers are eliminated lazily. Superposition and simplification inferences may employ equivalences that have arbitrary formulas at their smaller side. A closely related calculus is implemented in the Saturate system and has shown useful on many examples, in particular in set theory. The paper presents a completeness proof and reports on practical experience obtained with the Saturate system. |
|---|
| CC : | 001D02B01; 001D02A04 |
|---|
| FD : | Démonstration automatique; Retard; Forme normale; Transformation; Inférence; Théorie ensemble; Superposition; Quantificateur; Complétude |
|---|
| ED : | Automatic proving; Delay; Normal form; Transformation; Inference; Set theory; Superposition; Quantifier; Completeness |
|---|
| SD : | Demostración automática; Retraso; Forma normal; Transformación; Inferencia; Teoría conjunto; Superposición; Cuantificador; Completitud |
|---|
| LO : | INIST-16343.354000117776390280 |
|---|
| ID : | 04-0200068 |
|---|
Links to Exploration step
Pascal:04-0200068
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Superposition with equivalence reasoning and delayed clause normal form transformation</title>
<author><name sortKey="Ganzinger, Harald" sort="Ganzinger, Harald" uniqKey="Ganzinger H" first="Harald" last="Ganzinger">Harald Ganzinger</name>
<affiliation><inist:fA14 i1="01"><s1>MPI für Informatik</s1>
<s2>66123 Saarbrücken</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14><author><name sortKey="Stuber, Jurgen" sort="Stuber, Jurgen" uniqKey="Stuber J" first="Jürgen" last="Stuber">Jürgen Stuber</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA École des Mines de Nancy 615 Rue du Jardin Botanique</s1>
<s2>54600 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14><publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">04-0200068</idno>
<date when="2003">2003</date>
<idno type="stanalyst">PASCAL 04-0200068 INIST</idno>
<idno type="RBID">Pascal:04-0200068</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000700</idno>
</publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Superposition with equivalence reasoning and delayed clause normal form transformation</title>
<author><name sortKey="Ganzinger, Harald" sort="Ganzinger, Harald" uniqKey="Ganzinger H" first="Harald" last="Ganzinger">Harald Ganzinger</name>
<affiliation><inist:fA14 i1="01"><s1>MPI für Informatik</s1>
<s2>66123 Saarbrücken</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14><author><name sortKey="Stuber, Jurgen" sort="Stuber, Jurgen" uniqKey="Stuber J" first="Jürgen" last="Stuber">Jürgen Stuber</name>
<affiliation><inist:fA14 i1="02"><s1>LORIA École des Mines de Nancy 615 Rue du Jardin Botanique</s1>
<s2>54600 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<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>Automatic proving</term>
<term>Completeness</term>
<term>Delay</term>
<term>Inference</term>
<term>Normal form</term>
<term>Quantifier</term>
<term>Set theory</term>
<term>Superposition</term>
<term>Transformation</term>
</keywords><keywords scheme="Pascal" xml:lang="fr"><term>Démonstration automatique</term>
<term>Retard</term>
<term>Forme normale</term>
<term>Transformation</term>
<term>Inférence</term>
<term>Théorie ensemble</term>
<term>Superposition</term>
<term>Quantificateur</term>
<term>Complétude</term>
</keywords><front><div type="abstract" xml:lang="en">This paper describes a superposition calculus where quantifiers are eliminated lazily. Superposition and simplification inferences may employ equivalences that have arbitrary formulas at their smaller side. A closely related calculus is implemented in the Saturate system and has shown useful on many examples, in particular in set theory. The paper presents a completeness proof and reports on practical experience obtained with the Saturate system.</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>Superposition with equivalence reasoning and delayed clause normal form transformation</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>GANZINGER (Harald)</s1>
</fA11><fA11 i1="02" i2="1"><s1>STUBER (Jürgen)</s1>
</fA11><fA12 i1="01" i2="1"><s1>BAADER (Franz)</s1>
<s9>ed.</s9>
</fA12><fA14 i1="01"><s1>MPI für Informatik</s1>
<s2>66123 Saarbrücken</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</fA14><fA14 i1="02"><s1>LORIA École des Mines de Nancy 615 Rue du Jardin Botanique</s1>
<s2>54600 Villers-lès-Nancy</s2>
<s3>FRA</s3>
<sZ>2 aut.</sZ>
</fA14><fA20><s1>335-349</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>354000117776390280</s5>
</fA43><fA44><s0>0000</s0>
<s1>© 2004 INIST-CNRS. All rights reserved.</s1>
</fA44><fA45><s0>19 ref.</s0>
</fA45><fA47 i1="01" i2="1"><s0>04-0200068</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 describes a superposition calculus where quantifiers are eliminated lazily. Superposition and simplification inferences may employ equivalences that have arbitrary formulas at their smaller side. A closely related calculus is implemented in the Saturate system and has shown useful on many examples, in particular in set theory. The paper presents a completeness proof and reports on practical experience obtained with the Saturate system.</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>Retard</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="ENG"><s0>Delay</s0>
<s5>02</s5>
</fC03><fC03 i1="02" i2="X" l="SPA"><s0>Retraso</s0>
<s5>02</s5>
</fC03><fC03 i1="03" i2="X" l="FRE"><s0>Forme normale</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="ENG"><s0>Normal form</s0>
<s5>03</s5>
</fC03><fC03 i1="03" i2="X" l="SPA"><s0>Forma normal</s0>
<s5>03</s5>
</fC03><fC03 i1="04" i2="X" l="FRE"><s0>Transformation</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="ENG"><s0>Transformation</s0>
<s5>04</s5>
</fC03><fC03 i1="04" i2="X" l="SPA"><s0>Transformación</s0>
<s5>04</s5>
</fC03><fC03 i1="05" i2="X" l="FRE"><s0>Inférence</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="ENG"><s0>Inference</s0>
<s5>05</s5>
</fC03><fC03 i1="05" i2="X" l="SPA"><s0>Inferencia</s0>
<s5>05</s5>
</fC03><fC03 i1="06" i2="X" l="FRE"><s0>Théorie ensemble</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="X" l="ENG"><s0>Set theory</s0>
<s5>06</s5>
</fC03><fC03 i1="06" i2="X" l="SPA"><s0>Teoría conjunto</s0>
<s5>06</s5>
</fC03><fC03 i1="07" i2="X" l="FRE"><s0>Superposition</s0>
<s5>11</s5>
</fC03><fC03 i1="07" i2="X" l="ENG"><s0>Superposition</s0>
<s5>11</s5>
</fC03><fC03 i1="07" i2="X" l="SPA"><s0>Superposición</s0>
<s5>11</s5>
</fC03><fC03 i1="08" i2="X" l="FRE"><s0>Quantificateur</s0>
<s5>12</s5>
</fC03><fC03 i1="08" i2="X" l="ENG"><s0>Quantifier</s0>
<s5>12</s5>
</fC03><fC03 i1="08" i2="X" l="SPA"><s0>Cuantificador</s0>
<s5>12</s5>
</fC03><fC03 i1="09" i2="X" l="FRE"><s0>Complétude</s0>
<s5>16</s5>
</fC03><fC03 i1="09" i2="X" l="ENG"><s0>Completeness</s0>
<s5>16</s5>
</fC03><fC03 i1="09" i2="X" l="SPA"><s0>Completitud</s0>
<s5>16</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-0200068 INIST</NO>
<ET>Superposition with equivalence reasoning and delayed clause normal form transformation</ET>
<AU>GANZINGER (Harald); STUBER (Jürgen); BAADER (Franz)</AU>
<AF>MPI für Informatik/66123 Saarbrücken/Allemagne (1 aut.); LORIA École des Mines de Nancy 615 Rue du Jardin Botanique/54600 Villers-lès-Nancy/France (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. 2741; Pp. 335-349; Bibl. 19 ref.</SO>
<LA>Anglais</LA>
<EA>This paper describes a superposition calculus where quantifiers are eliminated lazily. Superposition and simplification inferences may employ equivalences that have arbitrary formulas at their smaller side. A closely related calculus is implemented in the Saturate system and has shown useful on many examples, in particular in set theory. The paper presents a completeness proof and reports on practical experience obtained with the Saturate system.</EA>
<CC>001D02B01; 001D02A04</CC>
<FD>Démonstration automatique; Retard; Forme normale; Transformation; Inférence; Théorie ensemble; Superposition; Quantificateur; Complétude</FD>
<ED>Automatic proving; Delay; Normal form; Transformation; Inference; Set theory; Superposition; Quantifier; Completeness</ED>
<SD>Demostración automática; Retraso; Forma normal; Transformación; Inferencia; Teoría conjunto; Superposición; Cuantificador; Completitud</SD>
<LO>INIST-16343.354000117776390280</LO>
<ID>04-0200068</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 000700 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000700 | 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-0200068
|texte= Superposition with equivalence reasoning and delayed clause normal form transformation
}}
| 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 |  |
