| Translating Logic Programs into Conditional Rewriting Systems (1997) | |||||||||||||||||
Abstract | |||||||||||||||||
| In this paper a translation from a subclass of logic programs consisting of the simply moded logic programs into rewriting systems is defined. In these rewriting systems conditions and explicit substitutions may be present. We argue that our translation is more natural than previously studied ones and establish a result showing its correctness. 1 Introduction Logic and functional programming are both instances of declarative programming and hence it is not surprising that the relationship between them has been studied. However, the work so far has in our opinion not yet resulted in clear cut and simple to state results clarifying this relationship. Moreover, most of the work in the area concerns only termination of logic programming, via a translation into term rewriting systems. See Section 5 for a discussion of related work. The aim of the present paper is to relate in a precise way the operational semantics of logic programming, resolution, to the operational semantics of functiona... | |||||||||||||||||
Details der Publikation | |||||||||||||||||
| |||||||||||||||||