Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness

We introduce a fibrational semantics for many-valued logic programming, use it to define an SLD-resolution for annotation-free many valued logic programs as defined by Fitting, and prove a soundness and completeness result relating the two. We show that fibrational semantics corresponds with the traditional declarative (ground) semantics and deduce a soundness and completeness result for our SLD-resolution algorithm with respect to the ground semantics.

[1]  C. V. Damásio A tabulation procedure for first-order residuated logic programs , 2006 .

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

[3]  James Lipton,et al.  Logic Programming in Tau Categories , 1994, CSL.

[4]  Leon Sterling,et al.  A Notion of Map between Logic Programs , 1990, ICLP.

[5]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[6]  John Power,et al.  A Fibrational Semantics for Logic Programs , 1996, ELP.

[7]  Carlos Viegas Damsio,et al.  Sorted Monotonic Logic Programs and their Embeddings , 2004 .

[8]  Michael Barr,et al.  Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

[9]  J. W. Lloyd,et al.  Foundations of logic programming; (2nd extended ed.) , 1987 .

[10]  Alan Robinson,et al.  Handbook of automated reasoning , 2001 .

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

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

[13]  Lars-Henrik Eriksson,et al.  Extensions of Logic Programming , 1993, Lecture Notes in Computer Science.

[14]  Michael Clarke,et al.  Symbolic and Quantitative Approaches to Reasoning and Uncertainty , 1991, Lecture Notes in Computer Science.

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

[16]  Neil V. Murray,et al.  Deduction and Search Strategies for Regular Multiple-Valued Logics , 2005, J. Multiple Valued Log. Soft Comput..

[17]  J. Lambek,et al.  Introduction to higher order categorical logic , 1986 .

[18]  Manuel Ojeda-Aciego,et al.  A Tabulation Proof Procedure for First-order Residuated Logic Programs: Soundness, Completeness and Optimizations , 2006, 2006 IEEE International Conference on Fuzzy Systems.

[19]  M. H. van Emden,et al.  Quantitative Deduction and its Fixpoint Theory , 1986, J. Log. Program..

[20]  Umberto Straccia,et al.  A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption , 2007, ECSQARU.

[21]  Christian G. Fermüller,et al.  Automated Deduction for Many-Valued Logics , 2001, Handbook of Automated Reasoning.