Disjunctive LP+integrity constraints= stable model semantics

José Alberto Fernández*, Jorge Lobo, Jack Minker, V. S. Subrahmanian

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

38 Scopus citations


We show that stable models of logic programs may be viewed as minimal models of programs that satisfy certain additional constraints. To do so, we transform the normal programs into disjunctive logic programs and sets of integrity constraints. We show that the stable models of the normal program coincide with the minimal models of the disjunctive program that satisfy the integrity constraints. As a consequence, the stable model semantics can be characterized using the extended generalized closed world assumption for disjunctive logic programs. Using this result, we develop a bottomup algorithm for function-free logic programs to find all stable models of a normal program by computing the perfect models of a disjunctive stratified logic program and checking them for consistency with the integrity constraints. The integrity constraints provide a rationale as to why some normal logic programs have no stable models.

Original languageEnglish (US)
Pages (from-to)449-474
Number of pages26
JournalAnnals of Mathematics and Artificial Intelligence
Issue number3-4
StatePublished - Sep 1993
Externally publishedYes

ASJC Scopus subject areas

  • Artificial Intelligence
  • Applied Mathematics


Dive into the research topics of 'Disjunctive LP+integrity constraints= stable model semantics'. Together they form a unique fingerprint.

Cite this