Abstract
It is well known that, under certain conditions, it is possible to split logic programs under stable model semantics, i.e. to divide such a program into a number of different “levels”, such that the models of the entire program can be constructed by incrementally constructing models for each level. Similar results exist for other non-monotonic formalisms, such as auto-epistemic logic and default logic. In this work, we present a general, algebraic splitting theory for programs/theories under a fixpoint semantics. Together with the framework of approximation theory, a general fixpoint theory for arbitrary operators, this gives us a uniform and powerful way of deriving splitting results for each logic with a fixpoint semantics. We demonstrate the usefulness of these results, by generalizing Lifschitz and Turner’s splitting theorem to other semantics for (non-disjunctive) logic programs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baral, C., Subrahmanian, V.: Duality between alternative semantics of logic programs and nonmonotonic formalisms. In: Nerode, A., Marek, W., Subrahmanian, V. (eds.) Intl. Workshop on Logic Programming and Nonmonotonic Reasoning, Washington DC, pp. 69–86. MIT Press, Cambridge (1991)
Denecker, M., Marek, V., Truszczynski, M.: Approximating operators, stable operators, well-founded fixpoints and applications in non-monotonic reasoning. In: Logic-based Artificial Intelligence. The Kluwer International Series in Engineering and Computer Science, pp. 127–144 (2000)
Denecker, M., Marek, V., Truszczynski, M.: Uniform semantic treatment of default and autoepistemic logics. Artificial Intelligence 143(1), 79–122 (2003)
Erdoğan, S.T., Lifschitz, V.: Definitions in Answer Set Programming. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 185–197. Springer, Heidelberg (2004)
Fitting, M.: A Kripke-Kleene Semantics for Logic Programs. Journal of Logic Programming 2(4), 295–312 (1985)
Fitting, M.: Bilattices and the semantics of logic programming. Journal of Logic Programming (1989)
Gelfond, M.: On Stratified Autoepistemic Theories. In: Proc. of AAAI 1987, pp. 207–211. Morgan Kaufmann, San Francisco (1987)
Gelfond, M., Przymusinska, H.: On consistency and completeness of autoepistemic theories. Fundamenta Informaticae 16(1), 59–92 (1992)
Lloyd, J.W.: Foundations of Logic Programming. Springer, Heidelberg (1987)
Leone, N., Rullo, P., Scarcello, F.: Declarative and fixpoints characterizations of disjunctive stable models. In: Proc. of International Logic Programming Ssymposium-ILPS 1995, pp. 399–413. MIT Press, Cambridge (1995)
Lifschitz, V., Turner, H.: Splitting a logic program. In: International Conference on Logic Programming, pp. 23–37 (1994)
Niemelä, I., Rintanen, J.: On the impact of stratification on the complexity of nonmonotonic reasoning. Journal of Applied Non-Classical Logics 4(2) (1994)
Tarski, A.: Lattice-theoretic fixpoint theorem and its applications. Pacific Journal of Mathematics 5, 285–309 (1955)
Turner, H.: Splitting a default theory. In: Proc. Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, pp. 645–651. AAAI Press, Menlo Park (1996)
Van Gelder, A., Ross, K.A., Schlipf, J.S.: The Well-Founded Semantics for General Logic Programs. Journal of the ACM 38(3), 620–650 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vennekens, J., Gilis, D., Denecker, M. (2004). Splitting an Operator. In: Demoen, B., Lifschitz, V. (eds) Logic Programming. ICLP 2004. Lecture Notes in Computer Science, vol 3132. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27775-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-27775-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22671-0
Online ISBN: 978-3-540-27775-0
eBook Packages: Springer Book Archive