Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation
Identifieur interne : 007978 ( Main/Merge ); précédent : 007977; suivant : 007979Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation
Auteurs : Harald Ganzinger ; Juergen StuberSource :
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.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 003B78
- to stream Crin, to step Curation: 003B78
- to stream Crin, to step Checkpoint: 000B31
Links to Exploration step
CRIN:ganzinger03aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="419">Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation</title>
</titleStmt>
<publicationStmt><idno type="RBID">CRIN:ganzinger03a</idno>
<date when="2003" year="2003">2003</date>
<idno type="wicri:Area/Crin/Corpus">003B78</idno>
<idno type="wicri:Area/Crin/Curation">003B78</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">003B78</idno>
<idno type="wicri:Area/Crin/Checkpoint">000B31</idno>
<idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">000B31</idno>
<idno type="wicri:Area/Main/Merge">007978</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">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>
</author>
<author><name sortKey="Stuber, Juergen" sort="Stuber, Juergen" uniqKey="Stuber J" first="Juergen" last="Stuber">Juergen Stuber</name>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>simplification</term>
<term>superposition</term>
<term>superposition calculus</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en" wicri:score="418">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>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 007978 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 007978 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Merge |type= RBID |clé= CRIN:ganzinger03a |texte= Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |