Disjunctive Logic Programming, Constructivity and Strong Negation

Logic programming research has been based largely on Horn-clause logic, because definite programs can be interpreted efficiently using SLD-resolution. However, there are several reasons to extend the ideas and concepts of Hornclause logic programming to more general formulas. The paper offers a framework for discussing questions of constructivity and completeness that arise in the field of clause logic programming. Constructive properties of different calculi are investigated and their relation to a certain family of constructive logics with strong negation is established.

[1]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[2]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[3]  David Burton.  Elementary Number Theory , 1976 .

[4]  Ulrich Furbach.  Answers for disjunctive logic programs , 1991, GWAI.

[5]  Thomas H. Payne,et al.  Case Inference in Resolution-Based Languages , 1988, CADE.

[6]  H. Rasiowa.  An Algebraic Approach To Non Classical Logics , 1974 .

[7]  Yuri Gurevich,et al.  Intuitionistic logic with strong negation , 1977 .

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

[9]  Donald W. Loveland,et al.  Automated theorem proving: a logical basis , 1978, Fundamental studies in computer science.

[10]  John Wylie Lloyd,et al.  Foundations of Logic Programming , 1987, Symbolic Computation.

[11]  赤間 世紀.  Constructive falsity : foundations and their applications to computer science , 1990 .

[12]  C. Cordell Green,et al.  Application of Theorem Proving to Problem Solving , 1969, IJCAI.

[13]  Arnon Avron,et al.  Simple Consequence Relations , 1988, Inf. Comput..

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

[15]  Gopalan Nadathur,et al.  Uniform Proofs as a Foundation for Logic Programming , 1991, Ann. Pure Appl. Log..

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

[17]  Thomas H. Payne,et al.  Case-Free Programs: An Abstraction of Definite Horn Programs , 1990, CADE.

[18]  E. López-Escobar,et al.  Refutability and elementary number theory , 1972 .

[19]  Seiki Akama.  Constructive predicate logic with strong negation and model theory , 1988, Notre Dame J. Formal Log..

[20]  Marco A. Casanova,et al.  Logic Programming with General Clauses and Defaults Based on Model Elimination , 1989, IJCAI.

[21]  Jean-Paul Delahaye,et al.  The Logical Compilation of Knowledge Bases , 1990, JELIA.

[22]  Heinrich Herre.  Nonmonotonic Reasoning and Logic Programs , 1990, Nonmonotonic and Inductive Logic.

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

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

[25]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..