Mechanizing Inductive Reasoning
Identifieur interne : 000873 ( Crin/Curation ); précédent : 000872; suivant : 000874Mechanizing Inductive Reasoning
Auteurs : E. Kounalis ; M. RusinowitchSource :
English descriptors
- KwdEn :
Abstract
We present a method to prove (and disprove) automatically inductive properties in conditional theories by using well-suited induction schemes, derived from test-sets, and, as the only inference rule, pure algebraic simplification. This method avoids completion and explicit induction. We feel that it can challenge successfully the alternative method proposed by Boyer and Moore.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000873
Links to Exploration step
CRIN:kounalis90aLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="288">Mechanizing Inductive Reasoning</title></titleStmt><publicationStmt><idno type="RBID">CRIN:kounalis90a</idno><date when="1990" year="1990">1990</date><idno type="wicri:Area/Crin/Corpus">000873</idno><idno type="wicri:Area/Crin/Curation">000873</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">000873</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Mechanizing Inductive Reasoning</title><author><name sortKey="Kounalis, E" sort="Kounalis, E" uniqKey="Kounalis E" first="E." last="Kounalis">E. Kounalis</name></author><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>Horn clauses</term><term>induction</term><term>reasoning</term><term>rewriting</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="954">We present a method to prove (and disprove) automatically inductive properties in conditional theories by using well-suited induction schemes, derived from test-sets, and, as the only inference rule, pure algebraic simplification. This method avoids completion and explicit induction. We feel that it can challenge successfully the alternative method proposed by Boyer and Moore.</div></front></TEI><BibTex type="inproceedings"><ref>kounalis90a</ref><crinnumber>90-R-030</crinnumber><category>3</category><equipe>EURECA</equipe><author><e>Kounalis, E.</e><e>Rusinowitch, M.</e></author><title>Mechanizing Inductive Reasoning</title><booktitle>{Proceedings 8th Conference AAAI (American Association for Artificial Intelligence), Boston (Massachussetts, USA)}</booktitle><year>1990</year><month>jul</month><keywords><e>reasoning</e><e>induction</e><e>rewriting</e><e>Horn clauses</e></keywords><abstract>We present a method to prove (and disprove) automatically inductive properties in conditional theories by using well-suited induction schemes, derived from test-sets, and, as the only inference rule, pure algebraic simplification. This method avoids completion and explicit induction. We feel that it can challenge successfully the alternative method proposed by Boyer and Moore.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000873 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Curation/biblio.hfd -nk 000873 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Curation
|type= RBID
|clé= CRIN:kounalis90a
|texte= Mechanizing Inductive Reasoning
}}
| This area was generated with Dilib version V0.6.33. |  |