𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Comments on “logic programming with equations”

✍ Scribed by Pier Giorgio Bosco; Elio Giovannetti; Corrado Moiso; Catuscia Palamidessi

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
343 KB
Volume
11
Category
Article
ISSN
0743-1066

No coin nor oath required. For personal study only.

✦ Synopsis

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 suggest how to correct it.

📜 SIMILAR VOLUMES

Comments on “general failure of logic pr
Comments on “general failure of logic programs”
✍ Joxan Jaffar; Jean-Louis Lassez; Michael J. Maher 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 258 KB

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 pre

Oriented Equational Logic Programming is
Oriented Equational Logic Programming is Complete
✍ CHRISTOPHER LYNCH 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 614 KB

We show the completeness of an extension of SLD-resolution to the equational setting. This proves a conjecture of Laurent Fribourg and shows the completeness of an implementation of his. It is the first completeness result for superposition of equational Horn clauses which reduces to SLD resolution

Logic programming on a neural network
Logic programming on a neural network
✍ Wan Ahmad Tajuddin Wan Abdullah 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 412 KB

We propose a method of doing logic programming on a Hopfield neural network. Optimization of logical consistency is carried out by the network after the connection strengths are defined from the logic program; the network relaxes to neural states corresponding to a valid (or near-valid) interpretati

Parallel Logic Programming Systems on Sc
Parallel Logic Programming Systems on Scalable Architectures
✍ Vı́tor Santos Costa; Ricardo Bianchini; Inês de Castro Dutra 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 273 KB

Parallel logic programming (PLP) systems are sophisticated examples of symbolic computing systems. PLP systems address problems such as allocating dynamic memory, scheduling irregular computations, and managing different types of implicit parallelism. Most PLP systems have been developed for busbase