• Home
  • Search
  • A Survey of the Proof-Theoretic Foundations of Logic Programming
  • Open Access IconOpen Access
  • Cite Icon4
  • https://doi.org/10.1017/s1471068421000533Copy DOI Icon

A Survey of the Proof-Theoretic Foundations of Logic Programming

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Abstract Several formal systems, such as resolution and minimal model semantics, provide a framework for logic programming. In this article, we will survey the use ofstructural proof theoryas an alternative foundation. Researchers have been using this foundation for the past 35 years to elevate logic programming from its roots in first-order classical logic into higher-order versions of intuitionistic and linear logic. These more expressive logic programming languages allow for capturing stateful computations and rich forms of abstractions, including higher-order programming, modularity, and abstract data types. Term-level bindings are another kind of abstraction, and these are given an elegant and direct treatment within both proof theory and these extended logic programming languages. Logic programming has also inspired new results in proof theory, such as those involving polarity and focused proofs. These recent results provide a high-level means for presenting the differences between forward-chaining and backward-chaining style inferences. Anchoring logic programming in proof theory has also helped identify its connections and differences with functional programming, deductive databases, and model checking.

Similar Papers
  • Research Article
  • Citations3

Reciprocal Influences Between Proof Theory and Logic Programming

  • Aug 06, 2019
  • Philosophy & Technology
  • Dale Miller
  • Book Chapter
  • Citations2

Logic Programming in a Fragment of Intuitionistic Temporal Linear Logic

  • Jan 01, 2001
  • Mutsunori Banbara +3
  • Research Article
  • Citations1

Deriving Theorems in Implicational Linear Logic, Declaratively

  • Sep 19, 2020
  • Electronic Proceedings in Theoretical Computer Science
  • Paul Tarau +1
  • Book Chapter

Just a Bit More

  • Jan 01, 2005
  • Daniel P Friedman +2
  • Research Article
  • Citations101

Partial evaluation of functional logic programs

  • Jul 01, 1998
  • ACM Transactions on Programming Languages and Systems
  • María Alpuente +2
  • Book Chapter
  • Citations20

First Steps into Metapredicativity in Explicit Mathematics

  • Jun 17, 1999
  • T Strahm
  • Research Article
  • Citations61

Perspectives in deductive databases

  • Mar 01, 1988
  • The Journal of Logic Programming
  • Jack Minker
  • Book Chapter
  • Citations39

Characterizing Kripke structures in temporal logic

  • Jan 01, 1987
  • M C Browne +2
  • Book Chapter
  • Citations1

Specifications using multiple-conclusion logic programs

  • Jan 01, 1994
  • Dale Miller
  • Book Chapter

Set-based analysis of logic programs and reactive logic programs

  • Jan 01, 1997
  • Jan Maluszy¿Ski
  • Research Article
  • Citations2

Game semantics for non-monotonic intensional logic programming

  • Oct 13, 2016
  • Annals of Pure and Applied Logic
  • Chrysida Galanaki +2
  • Book Chapter
  • Citations8

Introducing Constraint Functional Logic Programming

  • Jan 01, 1992
  • John Darlington +2
  • Book Chapter
  • Citations16

Linear logic on Petri nets

  • Jan 01, 1994
  • Uffe Engberg +1
  • Book Chapter
  • Citations5

The semantics of disjunctive deductive databases

  • Jan 01, 1990
  • Hugo Volger
  • Research Article
  • Citations4

Admissible rules for six intuitionistic modal logics

  • Dec 21, 2022
  • Annals of Pure and Applied Logic
  • Iris Van Der Giessen
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.