Abstract
In [Prz91], Przymusinski introduced the partial (or 3-valued) stable model semantics which extends the (2-valued) stable model semantics defined originally by Gelfond and Lifschitz [GL88]. In this paper we describe a procedure to compute the collection of all partial stable models of an extended disjunctive logic program. This procedure consists in transforming an extended disjunctive logic program into a constrained disjunctive program free of negation-by-default whose set of 2-valued minimal models corresponds to the set of partial stable models of the original program.
Support for this paper was provided by the Air Force Office of Scientific Research under grant number 91-0350, and the National Science Foundation under grant numbers IRI-8916059 and IRI 9300691.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Aho, J. Hopcroft, and J. Ullman. Data Structures and Algorithms. Addison-Wesley, 1983.
C. Bell, A. Nerode, R. Ng, and V.S. Subrahmanian. Implementing stable model semantics by linear programming. In Proceedings of the 1993 International Workshop on Logic Programming and Non-monotonic Reasoning, June 1993.
T. Eiter and G. Gottlob. Complexity aspects of various semantics for disjunctive databases. In Proceedings of the Twelfth ACM SIGART-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-93), pages 158–167. ACM Press, May 1993.
F. Fages. A new fixpoint semantics for general logic programs compared with the well-founded and the stable model semantics. New Generation Computing, 9:425–443, 1991.
M. Fitting. A Kripke-Kleene semantics of logic programs. Journal of Logic Programming, 2(4):295–312, December 1985.
M. Fitting. The family of stable models. Journal of Logic Programming, 17(2, 3 & 4):197–226, 1993.
J.A. Fernández, J. Lobo, J. Minker, and V.S. Subrahmanian. Disjunctive lp + integrity constrains = stable model semantics. Annals of Mathematics and Artificial Intelligence, 8(3–4):449–474, 1993.
M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. Bowen, editors, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 1070–1080, Seattle, WA, USA, Aug. 1988. The MIT Press.
K. Inoue, M. Koshimura, and R. Hasegawa. Embedding negation as failure into a model generation theorem prover. In D. Kapur, editor, Proceedings of the Eleventh International Conference on Automated Deduction, pages 400–415, Saratoga Springs NY, USA, June 1992. Springer-Verlag.
J. Minker and A. Rajasekar. A fixpoint semantics for disjunctive logic programs. Journal of Logic Programming, 9(1):45–74, July 1990.
J. Minker and C. Ruiz. On extended disjunctive logic programs. In J. Komorowski and Z.W. Raś, editors, Proceedings of the Seventh International Symposium on Methodologies for Intelligent Systems, pages 1–18. Lecture Notes in AI. Springer-Verlag, June 1993. (Invited Paper).
J. Minker and C. Ruiz. Semantics for disjunctive logic programs with explicit and default negation. Fundamenta Informaticae, 20(3/4):145–192, 1994. Anniversary Issue edited by H. Rasiowa.
T. C. Przymusinski. Stable semantics for disjunctive programs. New Generation Computing, 9:401–424, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ruiz, C., Minker, J. (1995). Computing stable and partial stable models of extended disjunctive logic programs. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds) Non-Monotonic Extensions of Logic Programming. NMELP 1994. Lecture Notes in Computer Science, vol 927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030666
Download citation
DOI: https://doi.org/10.1007/BFb0030666
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59467-3
Online ISBN: 978-3-540-49272-6
eBook Packages: Springer Book Archive