Abstract
The stable model semantics is the most widely acknowledged semantics for disjunctive logic programs.
The paper investigates computational aspects related to the stable model semantics of (function-free) disjunctive logic programs. In particular, an efficient algorithm for solving the (co-NP-hard decision) problem of checking if a model is stable is provided. The correctness of the proposed method is formally proven, and its computational complexity is analyzed. In general, the algorithm runs in polynomial space and single exponential time (in the worst case). However, the algorithm runs in polynomial time on the class of head-cycle free programs and, in case of general disjunctive logic programs, it limits the inefficient part of the computation only to the components of the program which are not head-cycle free. Some optimization techniques are also employed to reduce the amount of computation to be performed in practice.
Work partially supported by Christian Doppler Lab. for Expert Systems, Istituto per la Sistemistica e l'Informatica, ISICNR, the EC-US project “DEUS EX MACHINA” and by a MURST grant (40% share) under the project “Sistemi formali e strumenti per basi di dati evolute”.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Baral, C., Gelfond, M., Logic Programming and Knowledge Representation Journal of Logic Programming, Vol. 19/20, May/July 1994, pp. 73–148.
Ben-Eliyahu, R., Dechter, R., Propositional Semantics for Disjunctive Logic Programs, Annals of Mathematics and Artificial Intelligence, Vol. 12, 1994, pp. 53–87.
Ben-Eliyahu, R., Palopoli, L., Reasoning with Minimal Models: Efficient Algorithms and Applications, Proc. Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR-94), 1994, pp. 39–50.
Eiter, T., Gottlob, G., and Mannila, H., Adding Disjunction to Datalog, Proceedings ACM PODS-94, May 1994, pp. 267–278.
Eiter, T., Gottlob, G., On the Computational Cost of Disjunctive Logic Programming: Propositional Case, Annals of Mathematics and Artificial Intelligence, J. C. Baltzer AG, Science Publishers, Vol. 15, 1995, pp. 289–323.
Elkan, C., A rational Reconstruction of Nonmonotonic Truth Maintenance Systems, Artificial Intelligence, Vol. 43, 1990, pp. 219–234.
Gelfond, M., Lifschitz, V., The Stable Model Semantics for Logic Programming, Proceedings Fifth Logic Programming Symposium, MIT Press, Cambridge Mass., 1988, pp. 1070–1080.
Gelfond, M., Lifschitz, V., Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing, Vol. 9, 1991, pp. 365–385.
Gottlob, G., Complexity and Expressive Power of Disjunctive Logic Programming, In M. Bruynooghe, editor, Proc. of the International Logic Programming Symposium (ILPS-'94), Ithaca NY, MIT Press, 1994, pp. 23–42.
IFIP-GI Workshop: Disjunctive Logic Programming and Disjunctive Databases, 13th IFIP World Computer Congress.
Leone, N., Rullo, P., Scarcello, F., Declarative and Fixpoint Characterizations of Disjunctive Stable Models, Proceedings of International Logic Programming Symposium-ILPS'95, Portland, Oregon, December 4–7, 1995.
Leone, N., Rullo, P., Scarcello, F., On the Computation of Disjunctive Stable Models, Proc. DEXA '96, September 1996.
Lobo, J., Minker, J., Rajasekar, A., Foundations of disjunctive logic programming, The MIT Press, 1992.
Marek, W., Truszczyński, M., Autoepistemic Logic, Journal of the ACM, Vol. 38, No. 3, 1991, pp. 588–619.
Przymusinski, T., Stable Semantics for Disjunctive Programs, New Generation Computing, Vol. 9, 1991, pp. 401–424.
Sakama, C., Inoue, K., Embedding Circumscriptive Theories in General Disjunctive Programs, Proc. LPNMR '95, June 1995.
Van Gelder, A., Ross, K. A., Schlipf, J. S., The Well-Founded Semantics for General Logic Programs, Journal of ACM, Vol. 38, No. 3, 1991, pp. 620–650.
Vardi, M., Complexity of relational query languages, Proceedings 14th ACM STOC, 1982, pp. 137–146.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leone, N., Rullo, P., Scarcello, F. (1996). Stable model checking for disjunctive logic programs. In: Pedreschi, D., Zaniolo, C. (eds) Logic in Databases. LID 1996. Lecture Notes in Computer Science, vol 1154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031746
Download citation
DOI: https://doi.org/10.1007/BFb0031746
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61814-0
Online ISBN: 978-3-540-70683-0
eBook Packages: Springer Book Archive