Consistency of Clark's Completion and Existence of Stable Models (1994)
| Citations: | 121 - 2 self |
BibTeX
@MISC{Fages94consistencyof,
author = {François Fages},
title = {Consistency of Clark's Completion and Existence of Stable Models},
year = {1994}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The most general notion of canonical model for a logic program with negation is the one of stable model [9]. In [7] the stable models of a logic program are characterized by the well-supported Herbrand models of the program, and a new fixed point semantics that formalizes the bottom-up truth maintenance procedure of [4] is based on that characterization. Here we focus our attention on the abstract notion of well-supportedness in order to derive sufficient conditions for the existence of stable models. We show that if a logic program \Pi is positive-order-consistent (i.e. there is no infinite decreasing chain w.r.t. the positive dependencies in the atom dependency graph of \Pi) then the Herbrand models of comp(\Pi) coincide with the stable models of \Pi. From this result and the ones of [10] [17] [2] on the consistency of Clark's completion, we obtain sufficient conditions for the existence of stable models for positive-order-consistent programs. Then we show that a negative cycle free ...
