✦ LIBER ✦

Optimal fixedpoints of logic programs

✍ Scribed by J.-L. Lassez; M.J. Maher

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 683 KB
Volume: 39
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(85)90128-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Transformations of logic programs

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

Completions of perpetual logic programs

✍ James Hein 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 876 KB

Industrial linear optimization problems

Industrial linear optimization problems solved by constraint logic programming

✍ R. Bisdorff; S. Laurent 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1007 KB

Associative concurrent evaluation of log

Associative concurrent evaluation of logic programs

✍ Katsuhiko Nakamura 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 655 KB

Argument-based explanation of logic prog

Argument-based explanation of logic programs

✍ T.J.M. Bench-Capon; D. Lowes; A.M. McEnery 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 686 KB

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