Goal-Directed Proof Search in Multiple-Conclusions Intuitionistic Logic

A key property in the definition of logic programming languages is the completeness of goal-directed proofs. This concept originated in the study of logic programming languages for intuitionistic logic in the (single-conclusioned) sequent calculus LJ, but has subsequently been adapted to multiple-conclusioned systems such as those for linear logic. Given these developments, it seems interesting to investigate the notion of goal-directed proofs for a multiple-conclusioned sequent calculus for intuitionistic logic, in that this is a logic for which there are both single-conclusioned and multiple-conclusioned systems (although the latter are less well known). In this paper we show that the language obtained for the multiple-conclusioned system differs from that for the single-conclusioned case, show how hereditary Harrop formulae can be recovered, and investigate contraction-free fragments of the logic.

[1]  James Harland,et al.  On Normal Forms and Equivalence for Logic Programs , 1992, JICSLP.

[2]  Michael Winikoff,et al.  Programming in Lygon: An Overview , 1996, AMAST.

[3]  Dale Miller,et al.  Forum: A Multiple-Conclusion Specification Logic , 1996, Theor. Comput. Sci..

[4]  Akinori Yonezawa,et al.  ACL - A Concurrent Linear Logic Programming Paradigm , 1993, ILPS.

[5]  James Harland.  A Proof-Theoretic Analysis of Goal-Directed Provability , 1994, J. Log. Comput..

[6]  Gopalan Nadathur,et al.  Uniform Provability in Classical Logic , 1998, J. Log. Comput..

[7]  James Harland,et al.  Towards the Automation of the Design of Logic Programming Languages , 1997 .

[8]  Roy Dyckhoff,et al.  Contraction-free sequent calculi for intuitionistic logic , 1992, Journal of Symbolic Logic.

[9]  Jack Minker,et al.  A Fixpoint Semantics for Disjunctive Logic Programs , 1990, J. Log. Program..

[10]  Lincoln A. Wallen,et al.  Automated deduction in nonclassical logics , 1990 .

[11]  James Harland,et al.  A Uniform Proof-Theoretic Investigation of Linear Logic Programming , 1994, J. Log. Comput..

[12]  David J. Pym,et al.  On the intuitionistic force of classical search , 2000, Theor. Comput. Sci..

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

[14]  G. Gentzen.  Untersuchungen über das logische Schließen. I , 1935 .

[15]  JEAN-MARC ANDREOLI,et al.  Logic Programming with Focusing Proofs in Linear Logic , 1992, J. Log. Comput..

[16]  Paolo Volpe,et al.  Concurrent Logic Programming as Uniform Linear Proofs , 1994, ALP.

[17]  Keith L. Clark,et al.  Negation as Failure , 1987, Logic and Data Bases.

[18]  Roy Dyckhoff,et al.  A Deterministic Terminating Sequent Calculus for Gödel-Dummett logic , 1999, Log. J. IGPL.

[19]  Dale Miller,et al.  Logic programming in a fragment of intuitionistic linear logic , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[20]  Guy Perrier,et al.  On Proof Normalization in Linear Logic , 1992, Theor. Comput. Sci..

[21]  James Harland,et al.  On goal-directed provability in classical logic , 1993, Comput. Lang..