A Proof-Theoretic Approach to Logic Programming

DOI10.1093/logcom/1.5.635zbMath0769.68014OpenAlexW1991936529MaRDI QIDQ3983937

Peter Schroeder-Heister, Lars Hallnäs

Publication date: 27 June 1992

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/1.5.635

zbMATH Keywords

operational semanticscompletenessnegationsoundnessextension of logic programming

Mathematics Subject Classification ID

Logic programming (68N17) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items (17)

SUBATOMIC INFERENCES: AN INFERENTIALIST SEMANTICS FOR ATOMICS, PREDICATES, AND NAMES ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ Encoding transition systems in sequent calculus ⋮ Definite Formulae, Negation-as-Failure, and the Base-Extension Semantics of Intuitionistic Propositional Logic ⋮ Proof and refutation in MALL as a game ⋮ Restricting Initial Sequents: The Trade-Offs Between Identity, Contraction and Cut ⋮ Partial inductive definitions as type-systems for \(\lambda\)-terms ⋮ A family of metainferential logics ⋮ Validity concepts in proof-theoretic semantics ⋮ On the Role of Names in Reasoning about λ-tree Syntax Specifications ⋮ Closures and Modules Within Linear Logic Concurrent Constraint Programming ⋮ Axiom Directed Focusing ⋮ INVERSION BY DEFINITIONAL REFLECTION AND THE ADMISSIBILITY OF LOGICAL RULES ⋮ Encoding Generic Judgments ⋮ Generalized Elimination Inferences, Higher-Level Rules, and the Implications-as-Rules Interpretation of the Sequent Calculus ⋮ Disjoint Logics ⋮ ON THE NOTION OF CANONICAL DERIVATIONS FROM OPEN ASSUMPTIONS AND ITS ROLE IN PROOF-THEORETIC SEMANTICS

This page was built for publication: A Proof-Theoretic Approach to Logic Programming