Goal-Directed Proof Search in Multiple-Conclusions Intuitionistic Logic

  title={Goal-Directed Proof Search in Multiple-Conclusions Intuitionistic Logic},
  author={James Harland and Tatjana Lutovac and Michael Winikoff},
  booktitle={Computational 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… Expand
An Algebraic Approach to Proof Search in Sequent Calculi
Inference rules in the sequent calculus can be interpreted as both proof construction rules and proof search rules. However, the kind of information used in each case is somewhat different. In thisExpand
Disjunction and modular goal-directed proof search
The result is to establish a sound and complete goal-directed proof system that actively uses the modularity and locality of modal logic to constrain proof search, and to ensure that logically independent, local ambiguities will not interact in proof search. Expand
A Uniform Proof-theoretic Foundation for Abstract Paraconsistent Logic Programming
  • N. Kamide
  • Computer Science
  • J. Funct. Log. Program.
  • 2007
The results of this paper are regarded as natural extensions of the results by Miller et al. Expand
Proof Manipulations for Logic Programming Proof Systems
Logic programs consist of formulas of mathematical logic and various proof-theoretic techniques can be used to design and analyse execution models for such programs. In this paper we present someExpand


On goal-directed provability in classical logic
This paper shows how logic programs may contain disjunctions in this setting, and provides a proof-theoretic basis for disjunctive logic programs, as well as characterising the ''disjunctive'' nature of answer substitutions for such programs in terms of the provability properties of the classical connectives @L and @L. Expand
A Uniform Proof-Theoretic Investigation of Linear Logic Programming
This analysis builds on a notion of goal-directed provability, characterized by the so-called uniform proofs, previously introduced for minimal and intuitionistic logic, that is identiied by an analysis of the permutability of inferences in the linear sequent calculus. Expand
A Proof-Theoretic Analysis of Goal-Directed Provability
  • J. Harland
  • Mathematics, Computer Science
  • J. Log. Comput.
  • 1994
This paper shows that uniform proofs arise naturally as a normal form for proofs in rst-order intuitionistic sequent calculus, and shows that the class of formulae known as hereditary Harrop formula are intimately related to uniform proofs, and that they may be extracted from uniform proofs in two diierent ways. Expand
Uniform Provability in Classical Logic
  • G. Nadathur
  • Mathematics, Computer Science
  • J. Log. Comput.
  • 1998
An interesting aspect of this proof procedure is that it incorporates within it previously proposed mechanisms for dealing with disjunctive information in assumptions and for handling hypotheticals, and sheds light on the relationship between these mechanisms and the notion of uniform proofs. Expand
On the intuitionistic force of classical search
A proof procedure based on the natural extension of the notion of uniform proof to the multiple-conclusioned classical sequent calculus Harrop fragment of intuitionistic logic and illustrates the sense in which intuitionistic search can be viewed as a perturbation on classical search. Expand
Logic Programming with Focusing Proofs in Linear Logic
  • J. Andreoli
  • Mathematics, Computer Science
  • J. Log. Comput.
  • 1992
It is shown that the syntactic restriction induced by LinLog is not performed at the cost of any expressive power: a mapping from full linear logic to LinLog, preserving focusing proofs, and analogous to the normalization to clausal form for classical logic, is presented. Expand
Logic programming in a fragment of intuitionistic linear logic
  • J. S. Hodas, Dale Miller
  • Mathematics, Computer Science
  • [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
  • 1991
The intuitionistic notion of context is refined by using a fragment of J.-Y. Girard's (Theor. Comput. Sci., vol.50, p.1-102, 1987) linear logic that includes additive and multiplicative conjunction,Expand
On Proof Normalization in Linear Logic
The concept of normal proof is defined that might be the basis of works about automatic proof construction and design of logic programming languages based on linear logic. Expand
Uniform Proofs as a Foundation for Logic Programming
A proof-theoretic characterization of logical languages that form suitable bases for Prolog-like programming languages is provided and it is shown that first-order and higher-order Horn clauses with classical provability are examples of such a language. Expand
On Normal Forms and Equivalence for Logic Programs
It is shown how equivalence in this logic captures the notion of operational provability, in that logically equivalent programs are operationally equivalent, which suggests that the natural logic in which to study logic programming is a slightly stronger constructive logic than intuitionistic logic. Expand