A Proof-Theoretic Approach to Logic Programming. I. Clauses as Rules
From MaRDI portal
Publication:3210889
Recommendations
- A Proof-Theoretic Approach to Logic Programming
- Negation as failure. Completeness of the query evaluation process for Horn clause programs with recursive definitions
- scientific article; zbMATH DE number 1200168
- Uniform proofs as a foundation for logic programming
- scientific article; zbMATH DE number 4195154
Cited in
(49)- Relevant logic programming
- Extensions of logic programming. International workshop, Tübingen, FRG, 8--10 December 1989. Proceedings
- Graph-based proof procedures for horn clauses
- Horn programming with built-in predicates
- On computability by logic programs
- A full formalization of SLD-resolution in the calculus of inductive constructions
- Layered clause selection for theory reasoning (short paper)
- The calculus of higher-level rules, propositional quantification, and the foundational approach to proof-theoretic harmony
- Proof-theoretic semantics, self-contradiction, and the format of deductive reasoning
- Validity concepts in proof-theoretic semantics
- Encoding generic judgments: preliminary results
- Rules for subatomic derivation
- Logics with definitional reflection rules
- From conventional to institution-independent logic programming
- HARMONISING HARMONY
- scientific article; zbMATH DE number 4195154 (Why is no real title available?)
- scientific article; zbMATH DE number 4205965 (Why is no real title available?)
- Proof-theoretic and higher-order extensions of logic programming
- INVERSION BY DEFINITIONAL REFLECTION AND THE ADMISSIBILITY OF LOGICAL RULES
- Clausal intuitionistic logic I. fixed-point semantics
- Clausal intuitionistic logic II. tableau proof procedures
- The categorical and the hypothetical: a critique of some fundamental assumptions of standard semantics
- A Proof-Theoretic Approach to Logic Programming
- scientific article; zbMATH DE number 86272 (Why is no real title available?)
- scientific article; zbMATH DE number 1215501 (Why is no real title available?)
- scientific article; zbMATH DE number 517069 (Why is no real title available?)
- scientific article; zbMATH DE number 1070624 (Why is no real title available?)
- scientific article; zbMATH DE number 1482189 (Why is no real title available?)
- scientific article; zbMATH DE number 1508927 (Why is no real title available?)
- scientific article; zbMATH DE number 1746028 (Why is no real title available?)
- scientific article; zbMATH DE number 1761432 (Why is no real title available?)
- Proof-theoretic notions for software maintenance
- Lorenzen and constructive mathematics
- A survey of GCLA: a definitional approach to logic programming
- 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
- A type-theoretic approach to resolution
- A geometric interpretation of LD-resolution
- 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
- Implications-as-rules vs. implications-as-links: an alternative implication-left schema for the sequent calculus
- Proof-theoretic semantics: an autobiographical survey
- Focusing Gentzen's LK proof system
- Parsing as non-Horn deduction
- 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
- Associative substitutional semantics and quantified modal logic
This page was built for publication: A Proof-Theoretic Approach to Logic Programming. I. Clauses as Rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3210889)
