Uniform Proofs as a Foundation for Logic Programming

  title={Uniform Proofs as a Foundation for Logic Programming},
  author={Dale A. Miller and Gopalan Nadathur and Frank Pfenning and Andre Scedrov},
  journal={Ann. Pure Appl. Log.},

Figures from this paper

Semantics of Concurrent Logic Programming as Uniform Proofs

The LC fragment is proved to be an abstract logic programming language that is any sequent can be derived by uniform proofs, and can be viewed in terms of multiset rewriting and is reminiscent of the computations arising in the Chemical Abstract Machine and in the Gamma model.

Proofs as computations in linear logic

Uniform proofs and disjunctive logic programming

  • G. NadathurD. Loveland
  • Computer Science
    Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science
  • 1995
It is shown that the requirement of uniform provability can be realized in a logic which is more general than that of DLP under a modest, sound modification of programs.

Structural Proof Theory and Logic Programming An extended abstract

This talk will focus on the second of these benefits: proof theory provides a framework for extending the role of logical connectives and quantifiers in logic programs, thus allowing for much more expressive logic programs than those defined using first-order classical logic.

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.

Uniform Algebras: a Complete Semantics for the Hohh Logic of -prolog

The problem of nding sound and complete semantics for the logic underlying the lambda-Prolog programming language: Higher Order Hereditarily Harrop formulas with resolution (uniform) proofs has been

On goal-directed provability in classical logic

  • J. Harland
  • Philosophy, Computer Science
    Comput. Lang.
  • 1997

A Survey of the Proof-Theoretic Foundations of Logic Programming

  • Dale Miller
  • Computer Science
    Theory and Practice of Logic Programming
  • 2021
This article will survey the use of structural proof theory as an alternative foundation for logic programming, and finds that recent results provide a high-level means for presenting the differences between forward- chaining and backward-chaining style inferences.

Specifying and implementing theorem provers in a higher-order logic programming language

It is shown that it is sometimes possible to obtain a theorem prover that is complete under depth-first control by making only slight modifications to a specification, and shown how tactics and tacticals, which provide a framework for high-level control over search, can be directly implemented in the extended language.

Regular Search Spaces as a Foundation of Logic Programming

The ambition is to show that almost everything in the vulgate of logic programming can be carried out in a style close to natural deduction, and in particular in a restricted fragment of minimal logic.



A Logical Analysis of Modules in Logic Programming

Specifying Theorem Provers in a Higher-Order Logic Programming Language

An extended logic programming language where first-order terms are replaced with simply-typed λ-terms, higher-order unification replaces first- order unification, and implication and universal quantification are allowed in queries and the bodies of clauses is presented.


The correspondence between each extension to Prolog and the new features in the stronger logical theory is discussed and various aspects of an experimental implementation of λProlog are discussed.

A Logic Programming Approach to Manipulating Formulas and Programs

This paper shows how a simple natural deduction theorem prover may be implemented in $\lambda$Prolog, and how some simple program transformers for a functional programming language may be written in this language.

Hornlog: A Graph-Based Interpreter for General Horn Clauses

Some Uses of Higher-Order Logic in Computational Linguistics

A higher-order logic programming language is described, called λProlog, which represents programs as higher- order definite clauses and interprets them using a depth-first interpreter and claims that its use makes the task of providing formal justifications for the computations specified much more direct.

Natural Deduction as Higher-Order Resolution

Lexical Scoping as Universal Quantification

An interpreter for a logic programming language containing both universal quantifiers and implications in goals and the body of clauses is described, and how such scoping can be used to provide a Prolog-like language with facilities for local definition of programs, local declarations in modules, abstract data types, and encapsulation of state is presented.

Higher-order Horn clauses

A generalization of Horn clauses to a higher-order logic is described and examined as a basis for logic programming and proof-theoretic results concerning these extended clauses show that although the substitutions for predicate variables can be quite complex in general, the substitution necessary in the context of higher- order Horn clauses are tightly constrained.

On Natural Deduction

The object of this paper is to present and justify a simplification of Gentzen's natural deduction method, to the end of enhancing the advantages just claimed.