A Proof-Theoretic Approach to Logic Programming
From MaRDI portal
Recommendations
Cited in
(35)- Foundation of logic programming based on inductive definition
- Extensions of logic programming. International workshop, Tübingen, FRG, 8--10 December 1989. Proceedings
- Encoding transition systems in sequent calculus
- Validity concepts in proof-theoretic semantics
- On the role of names in reasoning about -tree syntax specifications
- Encoding generic judgments: preliminary results
- A Proof-Theoretic Approach to Logic Programming. I. Clauses as Rules
- scientific article; zbMATH DE number 4195154 (Why is no real title available?)
- Restricting Initial Sequents: The Trade-Offs Between Identity, Contraction and Cut
- scientific article; zbMATH DE number 4205965 (Why is no real title available?)
- Axiom Directed Focusing
- INVERSION BY DEFINITIONAL REFLECTION AND THE ADMISSIBILITY OF LOGICAL RULES
- scientific article; zbMATH DE number 3980532 (Why is no real title available?)
- Logic Programming
- scientific article; zbMATH DE number 1215501 (Why is no real title available?)
- scientific article; zbMATH DE number 1070624 (Why is no real title available?)
- Disjoint logics
- A survey of GCLA: a definitional approach to logic programming
- Extensions to logic programming motivated by the construction of a generic theorem prover
- On the extension of logic programming with negation through uniform proofs
- Generalized Elimination Inferences, Higher-Level Rules, and the Implications-as-Rules Interpretation of the Sequent Calculus
- On the notion of canonical derivations from open assumptions and its role in proof-theoretic semantics
- Closures and Modules Within Linear Logic Concurrent Constraint Programming
- Logic programming revisited: logic programs as inductive definitions
- A family of metainferential logics
- SUBATOMIC INFERENCES: AN INFERENTIALIST SEMANTICS FOR ATOMICS, PREDICATES, AND NAMES
- A Survey of the Proof-Theoretic Foundations of Logic Programming
- Definite Formulae, Negation-as-Failure, and the Base-Extension Semantics of Intuitionistic Propositional Logic
- Proof and refutation in MALL as a game
- Proof-theoretic semantics: an autobiographical survey
- Comments on the contributions
- A sequent calculus perspective on base-extension semantics
- Partial inductive definitions as type-systems for \(\lambda\)-terms
- Proof-theoretic semantics for first-order logic
- From proof-theoretic validity to base-extension semantics for intuitionistic propositional logic
This page was built for publication: A Proof-Theoretic Approach to Logic Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3983937)
