✦ LIBER ✦

Argument-based explanation of logic programs

✍ Scribed by T.J.M. Bench-Capon; D. Lowes; A.M. McEnery

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 686 KB
Volume: 4
Category: Article
ISSN: 0950-7051
DOI: 10.1016/0950-7051(91)90007-o

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A conservative explanation of a Machian

A conservative explanation of a Machian argument

✍ Michael Reinhardt 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 69 KB

Transformations of logic programs

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

The OR-forest-based parallel execution m

The OR-forest-based parallel execution model of logic programs

✍ Sun Chengzheng; Ci Yungui 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 768 KB

Completions of perpetual logic programs

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

Optimal fixedpoints of logic programs

✍ J.-L. Lassez; M.J. Maher 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 683 KB