Some Issues Concerning Fixed Points in Computational Logic: Quasi-Metrics, Multivalued Mappings and

Many questions concerning the semantics of disjunctive databases and of logic pro gramming systems depend on the xed points of various multivalued mappings and operators determined by the database or program We discuss known versions for mul tivalued mappings of the Knaster Tarski theorem and of the Banach contraction map ping theorem and formulate a version of the classical xed point theorem sometimes attributed to Kleene which is new All these results have applications to the semantics of disjunctive logic programs and we will describe a class of programs to which the new theorem can be applied We also show that a uni cation of the latter two theorems is possible using quasi metrics which parallels the well known uni cation of Rutten and Smyth in the case of conventional programming language semantics MSC Subject Classi cations H N

[1]  Michael B. Smyth,et al.  Quasi Uniformities: Reconciling Domains with Metric Spaces , 1987, MFPS.

[2]  Pascal Hitzler,et al.  Topology and Iterates in Computational Logic , 1997 .

[3]  Anthony Karel Seda.  Quasi-Metrics and the Semantics of Logic Programs , 1997, Fundam. Informaticae.

[4]  Guo-Qiang Zhang,et al.  Experimenting with Power Default Reasoning , 1998, AAAI/IAAI.

[5]  A. Seda.  Topology And The Semantics Of Logic Programs , 1995 .

[6]  William C. Rounds,et al.  Semantics of Logic Programs and Representation of Smyth Powerdomain , 2001 .

[7]  Pascal Hitzler,et al.  Strictly Level-Decreasing Logic Programs , 1998, IWFM.

[8]  Victor W. Marek,et al.  Stable models and an alternative logic programming paradigm , 1998, The Logic Programming Paradigm.

[9]  A New Fixed-Point Theorem for Logic , 2000 .

[10]  Danny De Schreye,et al.  Answer Set Planning , 1999 .

[11]  Classes of Logic Programs which Possess Unique Supported Models , 2000 .

[12]  Lawrence Cavedon,et al.  Acyclic Logic Programs and the Completeness of SLDNF-Resolution , 1991, Theor. Comput. Sci..

[13]  Jan J. M. M. Rutten,et al.  Elements of Generalized Ultrametric Domain Theory , 1996, Theor. Comput. Sci..

[14]  Pascal Hitzler,et al.  Characterizations of Classes of Programs by Three-Valued Operators , 1999, LPNMR.

[15]  Guo-Qiang Zhang,et al.  Clausal Logic and Logic Programming in Algebraic Domains , 2001, Inf. Comput..

[16]  Jorge Lobo,et al.  Foundations of disjunctive logic programming , 1992, Logic Programming.

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

[18]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[19]  Christine Froidevaux,et al.  Negation by Default and Unstratifiable Logic Programs , 1991, Theor. Comput. Sci..

[20]  Mohamed A. Khamsi,et al.  Disjunctive Signed Logic Programs , 1997, Fundam. Informaticae.

[21]  Pascal Hitzler,et al.  Multivalued Mappings, Fixed-Point Theorems and Disjunctive Databases , 1999, IWFM.

[22]  Vladik Kreinovich,et al.  A NEW METHOD OF PROVING THE EXISTENCE OF ANSWER SETS FOR DISJUNCTIVE LOGIC PROGRAMS: A METRIC FIXED POINT THEOREM FOR MULTI-VALUED MAPS , 1993 .

[23]  Pascal Hitzler,et al.  A New Fixed-Point Theorem for Logic Programming Semantics , 2000 .

[24]  Marc Bezem,et al.  Characterizing Termination of Logic Programs with Level Mappings , 1989, NACLP.

[25]  Guo-Qiang Zhang,et al.  Complexity of power default reasoning , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[26]  Guo-Qiang Zhang,et al.  Power Defaults (preliminary Report) , 1997 .

[27]  Alexander Bochman.  Default Consequence Relations as a Logical Framework for Logic Programs , 1995, LPNMR.