Disjunctive LP+integrity constraints= stable model semantics |
| |
Authors: | José Alberto Fernández Jorge Lobo Jack Minker V S Subrahmanian |
| |
Affiliation: | (1) Department of Computer Science, University of Maryland, 20742 College Park, MD, USA;(2) Institute for Advanced Computer Studies, University of Maryland, 20742 College Park, MD, USA;(3) Department of Electrical Engineering and Computer Science, University of Illinois at Chicago, 60680, IL, USA |
| |
Abstract: | 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 thatsatisfy the integrity constraints. As a consequence, the stable model semantics can be characterized using theextended 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|