✦ LIBER ✦

Associative concurrent evaluation of logic programs

✍ Scribed by Katsuhiko Nakamura

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 655 KB
Volume: 1
Category: Article
ISSN: 0743-1066
DOI: 10.1016/0743-1066(84)90026-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Continuation compilation for concurrent

Continuation compilation for concurrent logic programming

✍ B Kemp; P Soper; A King 📂 Article 📅 1994 🏛 Elsevier Science ⚖ 913 KB

Constraint Satisfaction in Distributed C

Constraint Satisfaction in Distributed Concurrent Logic Programming

✍ HO-FUNG LEUNG; KEITH L. CLARK 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 602 KB

In constraint logic programming, unification is replaced by more general constraint satisfaction. To support constraint solving in a committed-choice concurrent logic programming language, the constraint solver also needs to determine the status of the 'ask'-constraints with respect to the current c

∏11-universality of some propositional l

∏11-universality of some propositional logics of concurrent programs

✍ M.K. Valiev 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 686 KB

Modeling advanced manufacturing systems

Modeling advanced manufacturing systems using concurrent logic programming

✍ D. Ben-Arieh; I. Miron 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 728 KB

Compiling associativity into logic progr

Compiling associativity into logic programs

✍ D.R. Brough; C.J. Hogger 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 1013 KB

We show how a simple but important class of recursive logic programs can be mechanically transformed to take advantage of the associativity of auxiliary relations. This often results in improved efficiency through the introduction of tail recursion. We give proofs of correctness both for the transfo

Transformations of logic programs

✍ Olga Štěpánková; Petr Štěpánek 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 863 KB