Abstract
This paper studies the transformation of “predicate introduction”: replacing a complex formula in an existing logic program by a newly defined predicate. From a knowledge representation perspective, such transformations can be used to eliminate redundancy or to simplify a theory. From a more practical point of view, they can also be used to transform a theory into a normal form imposed by certain inference programs or theorems, e.g., through the elimination of universal quantifiers. In this paper, we study when predicate introduction is equivalence preserving under the stable and well-founded semantics. We do this in the algebraic framework of “approximation theory”; this is a fixpoint theory for non-monotone operators that generalizes all main semantics of various non-monotone logics, including Logic Programming, Default Logic and Autoepistemic Logic. We prove an abstract, algebraic equivalence result and then instantiate this abstract theorem to Logic Programming under the stable and well-founded semantics.
Works supported by FWO-Vlaanderen, IWT-Vlaanderen, and by GOA/2003/08.
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.
References
Balduccini, M., Gelfond, M.: Diagnostic reasoning with A-Prolog. TPLP 3(4-5), 425–461 (2003)
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., et al. (eds.) CL 2000. LNCS, vol. 1861, p. 703. Springer, Heidelberg (2000)
Denecker, M., Marek, V., Truszczyński, M.: Approximating operators, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning. In: Minker, J. (ed.) Logic-based Artificial Intelligence, ch. 6, pp. 127–144. Kluwer Academic Publishers, Dordrecht (2000)
Denecker, M., Marek, V., Truszczyński, M.: Uniform semantic treatment of default and autoepistemic logics. In: Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2000), Breckenridge, April 11-15, pp. 74–84. Morgan Kaufmann, San Francisco (2000)
Denecker, M., Marek, V., Truszczyński, M.: Uniform semantic treatment of default and autoepistemic logics. Artificial Intelligence 143(1), 79–122 (2003)
Denecker, M., Ternovska, E.: A logic of non-monotone inductive definitions and its modularity properties. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS, vol. 2923, pp. 47–60. Springer, Heidelberg (2003)
Dix, J.: A classification theory of semantics of normal logic programs: II. weak properties. Fundam. Inform. 22(3), 257–288 (1995)
Dix, J., Müller, M.: Partial evaluation and relevance for approximations of stable semantics. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS, vol. 869, pp. 511–520. Springer, Heidelberg (1994)
Fitting, M.: Fixpoint semantics for logic programming - a survey. Theoretical Computer Science 278, 25–51 (2002)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: International Joint Conference and Symposium on Logic Programming (JICSLP 1988), pp. 1070–1080. MIT Press, Cambridge (1988)
Gelfond, M., Przymusinska, H.: Towards a theory of elaboration tolerance: Logic programming approach. Journal on Software and Knowledge Engineering 6(1), 89–112 (1996)
Lloyd, J.W., Topor, R.W.: Making Prolog more expressive. Journal of Logic Programming 1(3), 225–240 (1984)
Wiktor Marek, V., Truszczyński, M.: Autoepistemic logic. J. ACM 38(3), 588–619 (1991)
Schrijvers, T., Serebrenik, A.: Improving Prolog Programs: Refactoring for Prolog. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 58–72. Springer, Heidelberg (2004)
Van Gelder, A.: The alternating fixpoint of logic programs with negation. Journal of Computer and System Sciences 47(1), 185–221 (1993)
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., Gilis, D., Denecker, M.: Splitting an operator: Algebraic modularity results for logics with fixpoint semantics. ACM Transactions on computational logic (TOCL) (to appear, 2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wittocx, J., Vennekens, J., Mariën, M., Denecker, M., Bruynooghe, M. (2006). Predicate Introduction Under Stable and Well-Founded Semantics. In: Etalle, S., Truszczyński, M. (eds) Logic Programming. ICLP 2006. Lecture Notes in Computer Science, vol 4079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11799573_19
Download citation
DOI: https://doi.org/10.1007/11799573_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36635-5
Online ISBN: 978-3-540-36636-2
eBook Packages: Computer ScienceComputer Science (R0)