TY - GEN
T1 - Solving goals in equational languages
AU - Dershowitz, Nachum
AU - Sivakumar, G.
N1 - Publisher Copyright:
© 1988, Springer-Verlag.
PY - 1988
Y1 - 1988
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85034852351&partnerID=8YFLogxK
U2 - 10.1007/3-540-19242-5_4
DO - 10.1007/3-540-19242-5_4
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:85034852351
SN - 9783540192428
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 45
EP - 55
BT - Conditional Term Rewriting Systems - 1st International Workshop, Proceedings
A2 - Kaplan, Stephane
A2 - Jouannaud, Jean-Pierre
PB - Springer Verlag
T2 - 1st International Workshop on Conditional Term Rewriting Systems, 1987
Y2 - 8 July 1987 through 10 July 1987
ER -