Abstract
The logic FO(ID) uses ideas from the field of logic programming to extend first order logic with non-monotone inductive definitions. The goal of this paper is to extend Gentzen’s sequent calculus to obtain a deductive inference method for FO(ID). The main difficulty in building such a proof system is the representation and inference of unfounded sets. It turns out that we can represent unfounded sets by least fixpoint expressions borrowed from stratified least fixpoint logic (SLFP), which is a logic with a least fixpoint operator and characterizes the expressibility of stratified logic programs. Therefore, in this paper, we integrate least fixpoint expressions into FO(ID) and define the logic FO(ID,SLFP). We investigate a sequent calculus for FO(ID,SLFP), which extends the sequent calculus for SLFP with inference rules for the inductive definitions of FO(ID). We show that this proof system is sound with respect to a slightly restricted fragment of FO(ID) and complete for a more restricted fragment of FO(ID).
This work is supported by FWO-Vlaanderen and by GOA/2003/08.
Chapter PDF
References
Baral, C., Brewka, G., Schlipf, J. (eds.): LPNMR 2007. LNCS (LNAI), vol. 4483. Springer, Heidelberg (2007)
Brachman, R.J., Levesque, H.J.: Competence in knowledge representation. In: National Conference on Artificial Intelligence (AAAI 1982), pp. 189–192 (1982)
Brotherston, J.: Sequent Calculus Proof System for Inductive Definitions. PhD thesis, University of Edinburgh (2006)
Buss, S.R.: Handbook of Proof Theory. Elsevier, Amsterdam (1998)
Compton, K.J.: Stratified least fixpoint logic. Theoretical Computer Science 131(1), 95–120 (1994)
Denecker, M.: The well-founded semantics is the principle of inductive definition. 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., Bruynooghe, M., Marek, V.: Logic programming revisited: Logic programs as inductive definitions. ACM Transactions on Computational Logic (TOCL) 2(4), 623–654 (2001)
Denecker, M., Ternovska, E.: Inductive Situation Calculus. In: Ninth International Conference on Principles of Knowledge Representation and Reasoning (KR 2004), pp. 545–553 (2004)
Denecker, M., Ternovska, E.: A logic of non-monotone inductive definitions. ACM Transactions On Computational Logic (TOCL) 9(2) (March 2008)
Denecker, M., Vennekens, J.: Well-founded semantics and the algebraic theory of non-monotone inductive definitions. In: Baral et al [1], pp. 84–96
Gebser, M., Schaub, T.: Tableau calculi for answer set programming. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 11–25. Springer, Heidelberg (2006)
Gentzen, G.: Untersuchungen über das logische schließen. Mathematische Zeitschrift 39, 176–210, 405–431 (1935)
Hagiya, M., Sakurai, T.: Foundation of Logic Programming Based on Inductive Definition. New Generation Computing 2, 59–77 (1984)
Hou, P., Wittocx, J., Denecker, M.: A deductive system for PC(ID). In: Baral et al [1], pp. 162–174
Mariën, M., Gilis, D., Denecker, M.: On the relation between ID-Logic and Answer Set Programming. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 108–120. Springer, Heidelberg (2004)
Mariën, M., Wittocx, J., Denecker, M., Bruynooghe, M.: SAT(ID): Satisfiability of propositional logic extended with inductive definitions. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 211–224. Springer, Heidelberg (2008)
Martin-Löf, P.: Hauptsatz for the intuitionistic theory of iterated inductive definitions. In: Fenstad, J.e. (ed.) Second Scandinavian Logic Symposium, pp. 179–216 (1971)
Szabo, M.E. (ed.): The Collected Papers of Gerhard Gentzen. North-Holland Publishing Co., Amsterdam (1969)
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)
Vennekens, J., Denecker, M.: FO(ID) as an extension of DL with rules. In: The 6th Annual European Semantic Web Conference (accepted, 2009)
Zhang, L., Malik, S.: Validating sat solvers using an independent resolution-based checker: Practical implementations and other applications. In: 2003 Design, Automation and Test in Europe Conference and Exposition (DATE 2003), Munich, Germany, March 3-7, pp. 10880–10885. IEEE Computer Society, Los Alamitos (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hou, P., Denecker, M. (2009). A Deductive System for FO(ID) Based on Least Fixpoint Logic. In: Erdem, E., Lin, F., Schaub, T. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2009. Lecture Notes in Computer Science(), vol 5753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04238-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-04238-6_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04237-9
Online ISBN: 978-3-642-04238-6
eBook Packages: Computer ScienceComputer Science (R0)