Sciweavers

Share
PODS
1990
ACM

Stable Models and Non-Determinism in Logic Programs with Negation

9 years 5 months ago
Stable Models and Non-Determinism in Logic Programs with Negation
Previous researchers have proposed generalizations of Horn clause logic to support negation and nondeterminism as two separate extensions. In this paper, we show that the stable model semantics for logic programs provides a unitied basis for the treatment of both concepts. Fit, we introduce the concepts of partial models, stable models, strongly founded models and deterministic models and other interesting classes of partial models and study their relationships. We show that the maximal determini stic model of a program is a subset of the intersection of all its stable models and that the well-founded model of a program is a subset of its maximal deterministic model. Then, we show that the use of stable models subsumes the use of the non-deterministic choice construct in LDL and provides an alternative definition of the
Domenico Saccà, Carlo Zaniolo
Added 11 Aug 2010
Updated 11 Aug 2010
Type Conference
Year 1990
Where PODS
Authors Domenico Saccà, Carlo Zaniolo
Comments (0)
books