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
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
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
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