𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Comments on “general failure of logic programs”

✍ Scribed by Joxan Jaffar; Jean-Louis Lassez; Michael J. Maher

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
258 KB
Volume
3
Category
Article
ISSN
0743-1066

No coin nor oath required. For personal study only.

✦ Synopsis

The paper [1] purports to present a classification of the general failure sets of logic programs and a simple proof of the theorem on the soundness and completeness of the negation-as-failure rule. In this note we clarify some conflicting terminology between [1] and the papers [2, 3] to which it predominantly refers. Our main purpose, however, is to point out major errors, in particular, one in the proof of the above mentioned theorem.

📜 SIMILAR VOLUMES

Comments on “logic programming with equa
Comments on “logic programming with equations”
✍ Pier Giorgio Bosco; Elio Giovannetti; Corrado Moiso; Catuscia Palamidessi 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 343 KB

This note discusses the results of the compilational approach of equational logic programming developed by Van Emden and Yukawa, and compares them with similar results obtained by Bosco et al. and by Fribourg. We show that Van Emden and Yukawa's completeness result contains an inaccuracy, and we sug

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

On the equivalence of semantics for norm
On the equivalence of semantics for normal logic programs
✍ Jia-Huai You; Li Yan Yuan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 699 KB

Despite the frequent comment that there is no general agreement on the semantics of logic programs, this paper shows that a number of independently proposed extensions to the stable model semantics coincide: the regular model semantics proposed by You and Yuan, the partial stable model semantics by