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
The Refined Extension Principle for Semantics of Dynamic Logic Programming
✍ Scribed by José Júlio Alferes; Federico Banti; Antonio Brogi; João Alexandre Leite
- Publisher
- Springer Netherlands
- Year
- 2005
- Tongue
- English
- Weight
- 355 KB
- Volume
- 79
- Category
- Article
- ISSN
- 0039-3215
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This paper presents a formal semantic basis for the termination analysis of logic programs. The semantics exhibits the termination properties of a logic program through its binary unfoldings ± a possibly in®nite set of binary clauses. Termination of a program P and goal G is determined by the absenc
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