Ultimate approximation and its application in nonmonotonic knowledge representation systems

In this paper we study fixpoints of operators on lattices and bilattices in a systematic and principled way. The key concept is that of an approximating operator, a monotone operator on the product bilattice, which gives approximate information on the original operator in an intuitive and well-defined way. With any given approximating operator our theory associates several different types of fixpoints, including the Kripke-Kleene fixpoint, stable fixpoints, and the well-founded fixpoint, and relates them to fixpoints of operator being approximated. Compared to our earlier work on approximation theory, the contribution of this paper is that we provide an alternative, more intuitive, and better motivated construction of the well-founded and stable fixpoints. In addition, we study the space of approximating operators by means of a precision ordering and show that each lattice operator O has a unique most precise-we call it ultimale-approximation. We demonstrate that fixpoints of this ultimate approximation provide useful insights into fixpoints of the operator O. We then discuss applications of these results in logic programming.

[1]  Kenneth Kunen,et al.  Negation in Logic Programming , 1987, J. Log. Program..

[2]  Maurice Bruynooghe,et al.  Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates , 2001, ICLP.

[3]  G. Markowsky.  Chain-complete posets and directed sets with applications , 1976 .

[4]  A. Tarski.  A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[5]  Jack Minker,et al.  Logic-Based Artificial Intelligence , 2000 .

[6]  Melvin Fitting.  Tableaux for logic programming , 2004, Journal of Automated Reasoning.

[7]  Melvin Fitting,et al.  A Kripke-Kleene Semantics for Logic Programs , 1985, J. Log. Program..

[8]  Allen Van Gelder,et al.  The Alternating Fixpoint of Logic Programs with Negation , 1993, J. Comput. Syst. Sci..

[9]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[10]  Peter Aczel,et al.  An Introduction to Inductive Definitions , 1977 .

[11]  Vladimir Lifschitz,et al.  On Open Defaults , 1990 .

[12]  H. Keisler,et al.  Handbook of mathematical logic , 1977 .

[13]  Melvin Fitting,et al.  Fixpoint Semantics for Logic Programming a Survey , 2001, Theor. Comput. Sci..

[14]  Victor W. Marek,et al.  Uniform semantic treatment of default and autoepistemic logics , 2000, Artif. Intell..

[15]  Krzysztof R. Apt,et al.  Contributions to the Theory of Logic Programming , 1982, JACM.

[16]  D. Fensel.  Principles of knowledge representation and reasoning : proceedings of the eighth International Conference (KR2002), Toulouse, France, April 22-25, 2002 , 2002 .

[17]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[18]  V. S. Subrahmanian,et al.  Dualities between alternative semantics for logic programming and nonmonotonic reasoning , 2004, Journal of Automated Reasoning.

[19]  Victor W. Marek,et al.  Autoepistemic logic , 1991, JACM.

[20]  Kurt Konolige,et al.  On the Relation Between Default and Autoepistemic Logic , 1987, Artif. Intell..

[21]  Teodor C. Przymusinski.  The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics , 1990, Fundam. Inform..

[22]  Victor W. Marek,et al.  Logic programming revisited , 2001, ACM Trans. Comput. Log..

[23]  Kenneth A. Ross,et al.  The well-founded semantics for general logic programs , 1991, JACM.

[24]  Marc Denecker,et al.  The Well-Founded Semantics Is the Principle of Inductive Definition , 1998, JELIA.

[25]  Melvin Fitting,et al.  Bilattices and the Semantics of Logic Programming , 1991, J. Log. Program..

[26]  Robert C. Moore.  Possible-World Semantics for Autoepistemic Logic , 1987, NMR.

[27]  Matthew L. Ginsberg,et al.  Multivalued logics: a uniform approach to reasoning in artificial intelligence , 1988, Comput. Intell..

[28]  Victor W. Marek,et al.  Ultimate Approximations in Nonmonotonic Knowledge Representation Systems , 2002, KR.

[29]  Victor W. Marek,et al.  Fixpoint 3-Valued Semantics for Autoepistemic Logic , 1998, AAAI/IAAI.

[30]  Jack Minker,et al.  Logic and Data Bases , 1978, Springer US.

[31]  B. V. Fraassen.  Singular Terms, Truth-Value Gaps, and Free Logic , 1966 .

[32]  Raymond Reiter,et al.  Logical Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter , 2001 .

[33]  K. U. LeuvenCelestijnenlaan,et al.  Approximations, Stable Operators, Well-founded Fixpoints and Applications in Nonmonotonic Reasoning , 2000 .