Definite clause programs are canonical (over a suitable domain)
- 1 September 1990
- journal article
- research article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 1 (1-4) , 1-19
- https://doi.org/10.1007/bf01531067
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A computable semantics for general logic programsThe Journal of Logic Programming, 1989
- Negation in logic programmingThe Journal of Logic Programming, 1987
- Foundations of Logic ProgrammingPublished by Springer Nature ,1987
- Canonical logic programsThe Journal of Logic Programming, 1986
- Some issues and trends in the semantics of logic programmingPublished by Springer Nature ,1986
- Closures and fairness in the semantics of programming logicTheoretical Computer Science, 1984
- The recursion-theoretic complexity of the semantics of predicate logic as a programming languageInformation and Control, 1982
- Contributions to the Theory of Logic ProgrammingJournal of the ACM, 1982
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965