Foundation of logic programming based on inductive definition

DOI10.1007/BF03037052zbMATH Open0592.68032MaRDI QIDQ1075752FDOQ1075752

Authors: Masami Hagiya, Takafumi Sakurai 

Publication date: 1984

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Circumscription - a form of non-monotonic reasoning
• Contributions to the Theory of Logic Programming
• Algorithm classification through synthesis
• A proof description language and its reduction system

Cited In (8)

• A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Inductive families
• Initial semantics of logic specifications with negation
• A Survey of the Proof-Theoretic Foundations of Logic Programming
• Program development schemata as derived rules

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)