✦ LIBER ✦

Semantics of Horn and disjunctive logic programs

✍ Scribed by Jorge Lobo; Arcot Rajasekar; Jack Minker

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 927 KB
Volume: 86
Category: Article
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90006-n

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Top-down semantics of fair computations

Top-down semantics of fair computations of logic programs

✍ M.H.van Emden; M.A. Nait Abdallah 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 634 KB

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

Disjunctive logic programming with types

Disjunctive logic programming with types and objects: The DLV+ system

✍ Francesco Ricca; Nicola Leone 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 878 KB

The paper presents DLV + , a Disjunctive Logic Programming (DLP) system with object-oriented constructs, including classes, objects, (multiple) inheritance, and types. DLV + is built on top of DLV (a state-of-the art DLP system), and provides a graphical user interface that allows one to specify, up

Reducts of propositional theories, satis

Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs

✍ Miroslaw Truszczyński 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 310 KB

On the Semantics of Comparative Logic

✍ Pierluigi Minari 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 781 KB

A note on semantics of logic programs wi

A note on semantics of logic programs with equality based on complete sets of E-unifiers

✍ Anatoli Degtyarev; Andrei Voronkov 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 538 KB

We discuss semantics of equational Horn-clause programs based on the notion of a complete set of E-unifiers. We prove incompleteness of SLDE tresolution in the general case. SLDELresolution was introduced by Gallier and Raatz who proved its completeness for the case of well-behaved programs. We also