A Survey of Paraconsistent Semantics for

In this chapter we motivate the use of paraconsistency, and survey the most salient paraconsistent semantics for (extended) logic programs , which are brieey deened and explained. Most of the semantics are accompanied with their multi-valued model theory, giving them a new perspective. The survey also presents new results regarding the embedding of part of these semantics into normal logic programs under Well-Founded Semantics 20], Partial Stable Model Semantics (or stationary semantics) 48], and Stable Model Semantics 21]. Furthermore, a concise recapitulation of other related paraconsistent formalisms is made. The reader is assumed to have a good knowledge of the semantics of normal logic programs. We believe a comprehensive coverage of the topic as it stands at present is attained here.

[1]  David Pearce,et al.  Answer Sets and Constructive Logic, II: Extended Logic Programs and Related Nonmonotonic Formalisms , 1993, LPNMR.

[2]  Chiaki Sakama.  Studies on disjunctive logic programming , 1995 .

[3]  David Pearce.  Reasoning with Negative Information, II: Hard Negation, Strong Negation and Logic Programs , 1990, Nonclassical Logics and Information Processing.

[4]  Mark Wallace,et al.  Tight, Consistent and Computable Completions for Unrestricted Logic Programs , 1993, The Journal of Logic Programming.

[5]  Hector J. Levesque,et al.  Making Believers out of Computers , 1986, Artif. Intell..

[6]  Jürgen Dix,et al.  A Classification Theory of Semantics of Normal Logic Programs: II. Weak Properties , 1995, Fundam. Informaticae.

[7]  Gerd Wagner.  Reasoning with Inconsistency in Extended Deductive Databases , 1993, LPNMR.

[8]  Victor W. Marek,et al.  Nonmonotonic logic - context-dependent reasoning , 1997, Artificial intelligence.

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

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

[11]  Frank Teusink,et al.  A Proof Procedure for Extended Logic Programs , 1993, ILPS.

[12]  H. Levesque.  Logic and the complexity of reasoning , 1988 .

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

[14]  Gerd Wagner,et al.  Logic Programming with Strong Negation , 1989, ELP.

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

[16]  Chiaki Sakama,et al.  Paraconsistent Stable Semantics for Extended Disjunctive Programs , 1995, J. Log. Comput..

[17]  William L. Rodi,et al.  Belief Revision and Paraconsistency in a Logic Programming Framework , 1991, International Conference on Logic Programming and Non-Monotonic Reasoning.

[18]  John Fox,et al.  Arguments, Contradicitions and Practical Reasoning , 1992, ECAI.

[19]  Luís Moniz Pereira,et al.  A Model Theory for Paraconsistent Logic Programming , 1995, EPIA.

[20]  Li-Yan Yuan,et al.  An Introspective Framework for Paraconsistent Logic Programs , 1995, ILPS.

[21]  José Júlio Alferes,et al.  Reasoning with Logic Programming , 1996, Lecture Notes in Computer Science.

[22]  David Nelson,et al.  Constructible falsity , 1949, Journal of Symbolic Logic.

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

[24]  Gerd Wagner.  Vivid Logic: Knowledge-Based Reasoning with Two Kinds of Negation , 1994 .

[25]  Nicholas Rescher,et al.  The logic of inconsistency , 1979 .

[26]  José Júlio Alferes,et al.  Contradiction Removal within Well Founded Semantics , 1991, LPNMR.

[27]  B. H. Slater,et al.  Paraconsistent logics? , 1995, J. Philos. Log..

[28]  Carolina Ruiz,et al.  Semantics for Disjunctive Logic Programs with Explicit and Default Negation , 1994, Fundam. Informaticae.

[29]  Gerd Wagner,et al.  A Database Needs Two Kinds of Negation , 1991, MFDBS.

[30]  José Júlio Alferes,et al.  Well Founded Semantics for Logic Programs with Explicit Negation , 1992, ECAI.

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

[32]  John Fox,et al.  A LOGIC OF ARGUMENTATION FOR REASONING UNDER UNCERTAINTY , 1995, Comput. Intell..

[33]  Gerd Wagner,et al.  Logic Programming with Strong Negation and Inexact Predicates , 1991, J. Log. Comput..

[34]  David Nelson,et al.  Constructible falsity and inexact predicates , 1984, Journal of Symbolic Logic.

[35]  Bernard Meltzer.  Theorem-Proving for Computers: Some Results on Resolution and Renaming , 1966, Comput. J..

[36]  Michael Gelfond,et al.  Logic Programs with Classical Negation , 1990, ICLP.

[37]  V. S. Subrahmanian,et al.  Theory of Generalized Annotated Logic Programming and its Applications , 1992, J. Log. Program..

[38]  Chitta Baral,et al.  Logic Programming and Knowledge Representation , 1994, J. Log. Program..

[39]  Teodor C. Przymusinski.  Extended Stable Semantics for Normal and Disjunctive Programs , 1990, ICLP.

[40]  Teodor C. Przymusinski.  Stationary Semantics for Disjunctive Logic Programs and Deductive Databases , 1990, NACLP.

[41]  A. Nerode,et al.  Answer Sets and Constructive Logic, II: Extended Logic Programs and Related Nonmonotonic Formalisms , 1993 .

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

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

[44]  V. S. Subrahmanian,et al.  Paraconsistent Logic Programming , 1987, Theor. Comput. Sci..

[45]  Chiaki Sakama,et al.  Extended Well-Founded Semantics for Paraconsistent Logic Programs , 1992, FGCS.

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

[47]  Teodor C. Przymusinski,et al.  Semantic Issues in Deductive Databases and Logic Programs , 1990 .

[48]  V. S. Subrahmanian.  Paraconsistent disjunctive deductive databases , 1990, Proceedings of the Twentieth International Symposium on Multiple-Valued Logic.