Foundation of logic programming based on inductive definition

DOI10.1007/BF03037052MaRDI QIDQ1075752zbMATHFDO

Authors Masami Hagiya, Takafumi Sakurai

Publication date 1984

Published in New Generation Computing (Search for Journal in Brave)

zbMATH Keywords

negation as failureinduction schemataleast fixpoint semanticslogical system of inference rulesquantified specification

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Inductive definability (03D70)

Recommendations

• Logic programming revisited: logic programs as inductive definitions
• A Proof-Theoretic Approach to Logic Programming
• A logical foundation for logic programming II: Semantics of general logic programs
• scientific article; zbMATH DE number 956484
• scientific article; zbMATH DE number 1531964

Cites work

• scientific article; zbMATH DE number 3466489 (Why is no real title available?)
• scientific article; zbMATH DE number 3275554 (Why is no real title available?)
• A proof description language and its reduction system
• Algorithm classification through synthesis
• Circumscription - a form of non-monotonic reasoning
• Contributions to the Theory of Logic Programming

Cited in

(9)

• Program development schemata as derived rules
• scientific article; zbMATH DE number 1301742 (Why is no real title available?)
• Inductive families
• Logic programming revisited: logic programs as inductive definitions
• scientific article; zbMATH DE number 1696830 (Why is no real title available?)
• scientific article; zbMATH DE number 922631 (Why is no real title available?)
• A Survey of the Proof-Theoretic Foundations of Logic Programming
• Initial semantics of logic specifications with negation
• A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction

This page was built for publication: Foundation of logic programming based on inductive definition

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