Proof-theoretic and higher-order extensions of logic programming

DOI10.1007/978-3-642-14309-0_12MaRDI QIDQ3578399zbMATH OpenOpenAlexFDO

Authors Alberto Momigliano, Mario Ornaghi

Publication date 20 July 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14309-0_12

Mathematics Subject Classification ID

Logic in computer science (03B70) Logic programming (68N17)

Recommendations

• Proofs as computations in linear logic
• Higher-order Horn clauses
• A Proof-Theoretic Approach to Logic Programming. I. Clauses as Rules
• Uniform proofs as a foundation for logic programming

Cited in

(12)

• Some results and experiments in programming techniques for propositional logic
• A Prolog technology theorem prover: Implementation by an extended Prolog compiler
• The higher-order prover Leo-III
• Circumscription and projection as primitives of logic programming
• Refinement of Higher-Order Logic Programs
• scientific article; zbMATH DE number 4160108 (Why is no real title available?)
• scientific article; zbMATH DE number 1292287 (Why is no real title available?)
• scientific article; zbMATH DE number 1420805 (Why is no real title available?)
• Proof-producing synthesis of ML from higher-order logic
• Reasoning with higher-order abstract syntax in a logical framework
• Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic
• A Survey of the Proof-Theoretic Foundations of Logic Programming

This page was built for publication: Proof-theoretic and higher-order extensions of logic programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578399)