Definite clause programs are canonical (over a suitable domain)

DOI10.1007/BF01531067zbMath0878.68082OpenAlexW2007299347MaRDI QIDQ1356204

Allen L. jun. Brown, Howard A. Blair

Publication date: 14 December 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01531067

zbMATH Keywords

definite clause program

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Closures and fairness in the semantics of programming logic
• The recursion-theoretic complexity of the semantics of predicate logic as a programming language
• Canonical logic programs
• Negation in logic programming
• An Efficient Unification Algorithm
• Contributions to the Theory of Logic Programming
• A computable semantics for general logic programs
• A Machine-Oriented Logic Based on the Resolution Principle

This page was built for publication: Definite clause programs are canonical (over a suitable domain)