Foundation of logic programming based on inductive definition

DOI10.1007/BF03037052zbMath0592.68032MaRDI QIDQ1075752

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)

Related Items

Inductive families ⋮ A Survey of the Proof-Theoretic Foundations of Logic Programming ⋮ Initial semantics of logic specifications with negation ⋮ Program development schemata as derived rules ⋮ A selected bibliography on constructive mathematics, intuitionistic type theory and higher order deduction

Cites Work

• A proof description language and its reduction system
• Circumscription - a form of non-monotonic reasoning
• Algorithm classification through synthesis
• Contributions to the Theory of Logic Programming
• Unnamed Item
• Unnamed Item