Solving goals in equational languages
Identifieur interne : 003377 ( Istex/Curation ); précédent : 003376; suivant : 003378Solving goals in equational languages
Auteurs : Nachum Dershowitz [États-Unis] ; G. Sivakumar [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: Solving equations in equational Horn-clause theories is a programming paradigm that combines logic programming and functional programming in a clean manner. Languages like Eqlog, Slog and Rite, express programs as conditional rewrite rules and goals as equations to be solved. Procedures for completion of conditional equational theories, in a manner akin to that of Knuth and Bendix for unconditional theories, also require methods for solving equations appearing in conditions. Rewrite-based logic-programming uses (conditional) narrowing to solve equational goals. Recently a different, topdown equation solving procedure was proposed for unconditional rewrite systems. In this paper, we express equational goal solving using conditional rules. Some refinements are described: the notion of operator derivability is used to prune useless paths in the search tree and our use of oriented goals eliminates some redundant paths leading to non-normalized solutions. Our goal-directed method can also be extended to handle conditional systems.
Url:
DOI: 10.1007/3-540-19242-5_4
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :003419
Links to Exploration step
ISTEX:DAFE3FFB5C021A43F7A79564074B2AB6FFF9AE65Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Solving goals in equational languages</title><author><name sortKey="Dershowitz, Nachum" sort="Dershowitz, Nachum" uniqKey="Dershowitz N" first="Nachum" last="Dershowitz">Nachum Dershowitz</name><affiliation wicri:level="1"><mods:affiliation>Department of Computer Science, University of Illinois at Urbana-Champaign, 61801, Urbana, Illinois, U.S.A.</mods:affiliation><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science, University of Illinois at Urbana-Champaign, 61801, Urbana, Illinois</wicri:regionArea></affiliation></author><author><name sortKey="Sivakumar, G" sort="Sivakumar, G" uniqKey="Sivakumar G" first="G." last="Sivakumar">G. Sivakumar</name><affiliation wicri:level="1"><mods:affiliation>Department of Computer Science, University of Illinois at Urbana-Champaign, 61801, Urbana, Illinois, U.S.A.</mods:affiliation><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science, University of Illinois at Urbana-Champaign, 61801, Urbana, Illinois</wicri:regionArea></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:DAFE3FFB5C021A43F7A79564074B2AB6FFF9AE65</idno><date when="1988" year="1988">1988</date><idno type="doi">10.1007/3-540-19242-5_4</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-J8141ZJN-1/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003419</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003419</idno><idno type="wicri:Area/Istex/Curation">003377</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Solving goals in equational languages</title><author><name sortKey="Dershowitz, Nachum" sort="Dershowitz, Nachum" uniqKey="Dershowitz N" first="Nachum" last="Dershowitz">Nachum Dershowitz</name><affiliation wicri:level="1"><mods:affiliation>Department of Computer Science, University of Illinois at Urbana-Champaign, 61801, Urbana, Illinois, U.S.A.</mods:affiliation><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science, University of Illinois at Urbana-Champaign, 61801, Urbana, Illinois</wicri:regionArea></affiliation></author><author><name sortKey="Sivakumar, G" sort="Sivakumar, G" uniqKey="Sivakumar G" first="G." last="Sivakumar">G. Sivakumar</name><affiliation wicri:level="1"><mods:affiliation>Department of Computer Science, University of Illinois at Urbana-Champaign, 61801, Urbana, Illinois, U.S.A.</mods:affiliation><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science, University of Illinois at Urbana-Champaign, 61801, Urbana, Illinois</wicri:regionArea></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Solving equations in equational Horn-clause theories is a programming paradigm that combines logic programming and functional programming in a clean manner. Languages like Eqlog, Slog and Rite, express programs as conditional rewrite rules and goals as equations to be solved. Procedures for completion of conditional equational theories, in a manner akin to that of Knuth and Bendix for unconditional theories, also require methods for solving equations appearing in conditions. Rewrite-based logic-programming uses (conditional) narrowing to solve equational goals. Recently a different, topdown equation solving procedure was proposed for unconditional rewrite systems. In this paper, we express equational goal solving using conditional rules. Some refinements are described: the notion of operator derivability is used to prune useless paths in the search tree and our use of oriented goals eliminates some redundant paths leading to non-normalized solutions. Our goal-directed method can also be extended to handle conditional systems.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003377 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 003377 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Curation
|type= RBID
|clé= ISTEX:DAFE3FFB5C021A43F7A79564074B2AB6FFF9AE65
|texte= Solving goals in equational languages
}}
| This area was generated with Dilib version V0.6.33. |  |