On Using Mode Input-output for Transforming Logic Programs
Identifieur interne : 000C72 ( Crin/Curation ); précédent : 000C71; suivant : 000C73On Using Mode Input-output for Transforming Logic Programs
Auteurs : F. Alexandre ; Khaled Bsaies ; A. QuéréSource :
English descriptors
- KwdEn :
Abstract
This paper discusses the transformation of logic programs by using mode input-output. We consider a system based on the Unfold/Fold transformations. First we introduce a notion of well-moded clause and well-moded definite program. We prove that under certain conditions the application of the Unfold/Fold transformations preserves the notion of well-modedness. We also define a transformation of a definite program into term rewriting system and we establish the correctness of this transformation.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000C72
Links to Exploration step
CRIN:alexandre91dLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="283">On Using Mode Input-output for Transforming Logic Programs</title></titleStmt><publicationStmt><idno type="RBID">CRIN:alexandre91d</idno><date when="1991" year="1991">1991</date><idno type="wicri:Area/Crin/Corpus">000C72</idno><idno type="wicri:Area/Crin/Curation">000C72</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">000C72</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">On Using Mode Input-output for Transforming Logic Programs</title><author><name sortKey="Alexandre, F" sort="Alexandre, F" uniqKey="Alexandre F" first="F." last="Alexandre">F. Alexandre</name></author><author><name sortKey="Bsaies, Khaled" sort="Bsaies, Khaled" uniqKey="Bsaies K" first="Khaled" last="Bsaies">Khaled Bsaies</name></author><author><name sortKey="Quere, A" sort="Quere, A" uniqKey="Quere A" first="A." last="Quéré">A. Quéré</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>definite program</term><term>folding</term><term>mode input-output</term><term>strategy</term><term>term rewrite system</term><term>transformation</term><term>unfolding</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="1489">This paper discusses the transformation of logic programs by using mode input-output. We consider a system based on the Unfold/Fold transformations. First we introduce a notion of well-moded clause and well-moded definite program. We prove that under certain conditions the application of the Unfold/Fold transformations preserves the notion of well-modedness. We also define a transformation of a definite program into term rewriting system and we establish the correctness of this transformation.</div></front></TEI><BibTex type="inproceedings"><ref>alexandre91d</ref><crinnumber>91-R-223</crinnumber><category>3</category><equipe>PROGRAIS</equipe><author><e>Alexandre, F.</e><e>Bsaies, Khaled</e><e>Quéré, A.</e></author><title>On Using Mode Input-output for Transforming Logic Programs</title><booktitle>{Proceedings Workshop on Logic Program Synthesis and Transformation, Manchester (UK)}</booktitle><year>1991</year><month>jul</month><publisher>Springer Verlag</publisher><keywords><e>transformation</e><e>mode input-output</e><e>strategy</e><e>definite program</e><e>folding</e><e>unfolding</e><e>term rewrite system</e></keywords><abstract>This paper discusses the transformation of logic programs by using mode input-output. We consider a system based on the Unfold/Fold transformations. First we introduce a notion of well-moded clause and well-moded definite program. We prove that under certain conditions the application of the Unfold/Fold transformations preserves the notion of well-modedness. We also define a transformation of a definite program into term rewriting system and we establish the correctness of this transformation.</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 000C72 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Curation/biblio.hfd -nk 000C72 | 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:alexandre91d
|texte= On Using Mode Input-output for Transforming Logic Programs
}}
| This area was generated with Dilib version V0.6.33. |  |