A uniform approach to logic programming semantics

Part of the theory of logic programming and nonmonotonic reasoning concerns the study of fixed-point semantics for these paradigms. Several different semantics have been proposed during the last two decades, and some have been more successful and acknowledged than others. The rationales behind those various semantics have been manifold, depending on one's point of view, which may be that of a programmer or inspired by commonsense reasoning, and consequently the constructions which lead to these semantics are technically very diverse, and the exact relationships between them have not yet been fully understood. In this paper, we present a conceptually new method, based on level mappings, which allows to provide uniform characterizations of different semantics for logic programs. We will display our approach by giving new and uniform characterizations of some of the major semantics, more particular of the least model semantics for definite programs, of the Fitting semantics, and of the well-founded semantics. A novel characterization of the weakly perfect model semantics will also be provided.

[1]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[2]  Pascal Hitzler,et al.  Towards a Systematic Account of Different Logic Programming Semantics , 2003, KI.

[3]  Sarit Kraus,et al.  Nonmonotonic Reasoning, Preferential Models and Cumulative Logics , 1990, Artif. Intell..

[4]  Dov M. Gabbay,et al.  Handbook of Logic in Artificial Intelligence and Logic Programming: Volume 3: Nonmonotonic Reasoning and Uncertain Reasoning , 1994 .

[5]  Arnon Avron,et al.  Logical bilattices and inconsistent data , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[6]  Victor W. Marek,et al.  Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning , 2000 .

[7]  A RossKenneth,et al.  The well-founded semantics for general logic programs , 1991 .

[8]  Steffen Hölldobler,et al.  Approximating the Semantics of Logic Programs by Recurrent Neural Networks , 1999, Applied Intelligence.

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

[10]  Vladimir Lifschitz,et al.  Answer set programming and plan generation , 2002, Artif. Intell..

[11]  Melvin Fitting,et al.  The Family of Stable Models , 1993, J. Log. Program..

[12]  M. Ginsberg,et al.  Multivalued Logics: a Uniform Approach to Inference in Artiicial Intelligence Multivalued Logics: a Uniform Approach to Inference in Artiicial Intelligence , 1988 .

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

[14]  Viggo Stoltenberg-Hansen,et al.  Mathematical theory of domains , 1994, Cambridge tracts in theoretical computer science.

[15]  Elena Marchiori.  On Termination of General Logic Programs w.r.t. Constructive Negation , 1996, J. Log. Program..

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

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

[18]  David Pearce,et al.  A New Logical Characterisation of Stable Models and Answer Sets , 1996, NMELP.

[19]  P. Hitzler.  Generalized Metrics and Topology in Logic Programming Semantics , 2001 .

[20]  H. Przymusinska,et al.  Weakly stratified logic programs , 1990 .

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

[22]  Pascal Hitzler,et al.  Continuity of Semantic Operators in Logic Programming and Their Approximation by Artificial Neural Networks , 2003, KI.

[23]  Jürgen Dix,et al.  A Classification Theory of Semantics of Normal Logic Programs: I. Strong Properties , 1995, Fundam. Informaticae.

[24]  J. Lloyd.  Foundations of Logic Programming , 1984, Symbolic Computation.

[25]  Timo Soininen,et al.  Extending and implementing the stable model semantics , 2000, Artif. Intell..

[26]  Teodor C. Przymusinski,et al.  Loop Checking and the Wll-Founded Semantics , 1995, LPNMR.

[27]  Allen Van Gelder,et al.  Negation as Failure using Tight Derivations for General Logic Programs , 1988, J. Log. Program..

[28]  Pascal Hitzler,et al.  Unique Supported-Model Classes of Logic Programs , 2001 .

[29]  Melvin Fitting.  Well-Founded Semantics, Generalized , 1991, ISLP.

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

[31]  David Makinson,et al.  General patterns in nonmonotonic reasoning , 1994 .

[32]  Gerald Pfeifer,et al.  A Deductive System for Non-Monotonic Reasoning , 1997, LPNMR.

[33]  Pascal Hitzler,et al.  Generalized metrics and uniquely determined logic programs , 2003, Theor. Comput. Sci..

[34]  François Fages,et al.  Consistency of Clark's completion and existence of stable models , 1992, Methods Log. Comput. Sci..

[35]  Ofer Arieli,et al.  Paraconsistent Declarative Semantics for Extended Logic Programs , 2010 .

[36]  Dino Pedreschi,et al.  Reasoning about Termination of Pure Prolog Programs , 1993, Inf. Comput..

[37]  S. Ginsburg,et al.  Acyclic logic programs and the completeness of SLDNF-resolution , 1991 .

[38]  Ulf Nilsson,et al.  A Simple Fixed Point Characterization of Three-Valued Stable Model Semantics , 1991, Inf. Process. Lett..

[39]  Pascal Hitzler,et al.  The Well-Founded Semantics Is a Stratified Fitting Semantics , 2002, KI.

[40]  Weakly Strati.  Weakly Stratiied Logic Programs , 1990 .

[41]  Alan van Gelser.  Negation as failure using tight derivations for general logic programs , 1989 .

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

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

[44]  Melvin Fitting,et al.  Metric Methods Three Examples and a Theorem , 1994, J. Log. Program..

[45]  Nuel D. Belnap,et al.  A Useful Four-Valued Logic , 1977 .

[46]  Adrian Walker,et al.  Towards a Theory of Declarative Knowledge , 1988, Foundations of Deductive Databases and Logic Programming..

[47]  Arnon Avron,et al.  The Value of the Four Values , 1998, Artif. Intell..

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

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

[50]  Dino Pedreschi,et al.  Classes of terminating logic programs , 2001, Theory and Practice of Logic Programming.

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

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

[53]  Hudson Turner,et al.  Order-consistent programs are cautiously monotonic , 2000, Theory and Practice of Logic Programming.

[54]  Pascal Hitzler,et al.  A Note on the Relationships Between Logic Programs and Neural Networks , 2000, IWFM.

[55]  P. Daniel Hestand,et al.  Mathematical theory of domains , 2002, SIGA.

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

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