Splitting an Operator
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.
Unable to display preview. Download preview PDF.
- [BS91]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)Google Scholar
- [DMT00]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)Google Scholar
- [EL04]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)Google Scholar
- [Fit89]Fitting, M.: Bilattices and the semantics of logic programming. Journal of Logic Programming (1989)Google Scholar
- [Gel87]Gelfond, M.: On Stratified Autoepistemic Theories. In: Proc. of AAAI 1987, pp. 207–211. Morgan Kaufmann, San Francisco (1987)Google Scholar
- [LRS95]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)Google Scholar
- [LT94]Lifschitz, V., Turner, H.: Splitting a logic program. In: International Conference on Logic Programming, pp. 23–37 (1994)Google Scholar
- [NR94]Niemelä, I., Rintanen, J.: On the impact of stratification on the complexity of nonmonotonic reasoning. Journal of Applied Non-Classical Logics 4(2) (1994)Google Scholar
- [Tur96]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)Google Scholar