𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A note on the stable model semantics for logic programs

✍ Scribed by Michael Kaminski


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
900 KB
Volume
96
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

✦ Synopsis


The stable model semantics for logic programs is extended from ground literals onto open literals by augmenting the program language with an infinite set of new constants. This, in turn, leads to a natural translation of logic programs into open default theories. @


πŸ“œ SIMILAR VOLUMES


On the equivalence of semantics for norm
✍ 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

A note on semantics of logic programs wi
✍ 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

A residualizing semantics for the partia
✍ Elvira Albert; Michael Hanus; GermΓ‘n Vidal πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 103 KB

Recent proposals for multi-paradigm declarative programming combine the most important features of functional, logic and concurrent programming into a single framework. The operational semantics of these languages is usually based on a combination of narrowing and residuation. In this paper, we intr