Theorem-proving with Resolution and Superposition : An Extension of Knuth and Bendix Procedure as a Complete Set of Inference Rules.
Identifieur interne : 000656 ( Crin/Corpus ); précédent : 000655; suivant : 000657Theorem-proving with Resolution and Superposition : An Extension of Knuth and Bendix Procedure as a Complete Set of Inference Rules.
Auteurs : M. RusinowitchSource :
English descriptors
- KwdEn :
Abstract
We present a refutation complete set of inferences rules for first-order logic with equality. Except x=x, no equality axiom is needed. Equalities are oriented by a well-founded ordering and can be used safely for demodulation, without loosing completeness. When restricted so equality units, this strategy reduces to Knuth-Bendix procedure.
Links to Exploration step
CRIN:rusinowitch88aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="402">Theorem-proving with Resolution and Superposition : An Extension of Knuth and Bendix Procedure as a Complete Set of Inference Rules.</title></titleStmt><publicationStmt><idno type="RBID">CRIN:rusinowitch88a</idno><date when="1988" year="1988">1988</date><idno type="wicri:Area/Crin/Corpus">000656</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Theorem-proving with Resolution and Superposition : An Extension of Knuth and Bendix Procedure as a Complete Set of Inference Rules.</title><author><name sortKey="Rusinowitch, M" sort="Rusinowitch, M" uniqKey="Rusinowitch M" first="M." last="Rusinowitch">M. Rusinowitch</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Knuth and Bendix procedure</term><term>completeness</term><term>demodulation</term><term>paramodulation</term><term>refutations</term><term>resolution</term><term>semantic tree</term><term>simplification orderings</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="531">We present a refutation complete set of inferences rules for first-order logic with equality. Except x=x, no equality axiom is needed. Equalities are oriented by a well-founded ordering and can be used safely for demodulation, without loosing completeness. When restricted so equality units, this strategy reduces to Knuth-Bendix procedure.</div></front></TEI><BibTex type="inproceedings"><ref>rusinowitch88a</ref><crinnumber>88-R-138</crinnumber><category>3</category><equipe>INCONNUE</equipe><author><e>Rusinowitch, M.</e></author><title>Theorem-proving with Resolution and Superposition : An Extension of Knuth and Bendix Procedure as a Complete Set of Inference Rules.</title><booktitle>{Proceedings International Conference on Fifth Generation Computer Systems, Tokyo (Japon)}</booktitle><year>1988</year><month>nov</month><keywords><e>refutations</e><e>completeness</e><e>resolution</e><e>paramodulation</e><e>demodulation</e><e>semantic tree</e><e>Knuth and Bendix procedure</e><e>simplification orderings</e></keywords><abstract>We present a refutation complete set of inferences rules for first-order logic with equality. Except x=x, no equality axiom is needed. Equalities are oriented by a well-founded ordering and can be used safely for demodulation, without loosing completeness. When restricted so equality units, this strategy reduces to Knuth-Bendix procedure.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000656 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Corpus/biblio.hfd -nk 000656 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Corpus
|type= RBID
|clé= CRIN:rusinowitch88a
|texte= Theorem-proving with Resolution and Superposition : An Extension of Knuth and Bendix Procedure as a Complete Set of Inference Rules.
}}
| This area was generated with Dilib version V0.6.33. |  |