𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Transformations of logic programs

✍ Scribed by Olga Štěpánková; Petr Štěpánek

Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
863 KB
Volume
1
Category
Article
ISSN
0743-1066

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Unfold/fold transformations for disjunct
Unfold/fold transformations for disjunctive logic programs
✍ Manolis Gergatsoulis 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 627 KB

Unfold/fold transformation rules for disjunctive logic programs are proposed in this paper. Our transformation rules preserve the meaning of the programs. @ 1997 Elsevier Science B.V.

Transformation of Logic Programs to FP P
Transformation of Logic Programs to FP Programs Based on Dataflows
✍ Susumu Yamasaki; Kentaro Iida 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 692 KB

This paper is concerned with functionality of a logic program. Functionality based on input-output relations declared in predicates is not treated, but functionality of extensionalities of predicates, involved in a logic program, is realized by a dataflow computation and a functional programming (FP

Equivalent logic programs
Equivalent logic programs
✍ Chan Kwok Hung 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 823 KB
On transformations of programs
On transformations of programs
✍ Richard Bird 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 503 KB

A treatment is given of a class of program transformations X with the property that for each program P, both P and X(P) compute the same function. Many transformations encountered in the theory of computation can be shown to he in the class and, hence, formally proved to preserve equivalence. As an