Abstract
Well-known principles of induction include monotone induction and different sorts of non-monotone induction such as inflationary induction, induction over well-ordered sets and iterated induction. In this work, we define a logic formalizing induction over well-ordered sets and monotone and iterated induction. Just as the principle of positive induction has been formalized in FO(LFP), and the principle of inflationary induction has been formalized in FO(IFP), this paper formalizes the principle of iterated induction in a new logic for Non-Monotone Inductive Definitions (NMID-logic). The semantics of the logic is strongly influenced by the well-founded semantics of logic programming.
Our main result concerns the modularity properties of inductive definitions in NMID-logic. Specifically, we formulate conditions under which a simultaneous definition Δ of several relations is logically equivalent to a conjunction of smaller definitions Δ1 Λ... ΛΔ n with disjoint sets of defined predicates. The difficulty of the result comes from the fact that predicates P i and P j defined in Δ i and Δ j , respectively, may be mutually connected by simultaneous induction. Since logic programming and abductive logic programming under well-founded semantics are proper fragments of our logic, our modularity results are applicable there as well. As an example of application of our logic and theorems presented in this paper, we describe a temporal formalism, the inductive situation calculus, where causal dependencies are naturally represented as rules of inductive definitions.
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
Aczel, P.: An introduction to inductive definitions. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 739–782. Elsevier, Amsterdam (1977)
Denecker, M., Bruynooghe, M., Marek, V.: Logic programming revisited: Logic programs as inductive definitions. ASM Transactions on Computational Logic (TOCL) 4(2) (2001)
Denecker, M.: The well-founded semantics is the principle of inductive definitions. In: Dix, J., Fariñas del Cerro, L., Furbach, U. (eds.) JELIA 1998. LNCS (LNAI), vol. 1489, pp. 1–16. Springer, Heidelberg (1998)
Denecker, M.: Extending classical logic with inductive definitions. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, p. 703. Springer, Heidelberg (2000)
Dawar, A., Gurevich, Y.: Fixed point logics. The Bulletin of Symbolic Logic 8(1), 65–88 (2002)
Denecker, M., Marek, V., Truszczynski, M.: Approximating operators, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. In: Minker, J. (ed.) Logic-Based AI, pp. 127–144. Kluwer Academic Publishers, Dordrecht (2000)
Denecker, M., Theseider Duprè, D., Van Belleghem, K.: An inductive definition approach to ramifications. Linköping Electronic Articles in Computer and Information Science 3(7) (1998), http://www.ep.liu.se/ea/cis/1998/007/
Fitting, M.: Fixpoint semantics for logic programming - a survey. Theoretical Computer Science (2003) (to appear)
Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365–385 (1991)
Moschovakis, Y.N.: Elementary Induction on Abstract Structures. North Holland, Amsterdam (1974)
Reiter, R.: Knowledge in Action: Logical Foundations for Describing and Implementing Dynamical Systems. MIT Press, Cambridge (2001)
Schlipf, J.: The expressive powers of the logic programming semantics. Journal of Computer and System Sciences 51, 64–86 (1995)
Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5, 285–309 (1955)
Van Gelder, A.: An alternating fixpoint of logic programs with negation. Journal of computer and system sciences 47, 185–221 (1993)
Verbaeten, S., Denecker, M., De Scheye, D.: Compositionality of normal open logic programs. journal of Logic Programming 1(3), 151–183 (2000)
Van Gelder, A., Ross, K.A., Schlipf, J.S.: The well-founded semantics for general logic programs. Journal of Assoc. Comput. Mach. 38(3), 620–650 (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Denecker, M., Ternovska, E. (2003). A Logic of Non-monotone Inductive Definitions and Its Modularity Properties. In: Lifschitz, V., Niemelä, I. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2004. Lecture Notes in Computer Science(), vol 2923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24609-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-24609-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20721-4
Online ISBN: 978-3-540-24609-1
eBook Packages: Springer Book Archive