Strong termination of logic programs
- 31 January 1993
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 15 (1-2) , 79-97
- https://doi.org/10.1016/0743-1066(93)90014-8
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Partial evaluation in logic programmingThe Journal of Logic Programming, 1991
- Acyclic logic programs and the completeness of SLDNF-resolutionTheoretical Computer Science, 1991
- Acyclic programsNew Generation Computing, 1991
- Efficient tests for top-down termination of logical rulesJournal of the ACM, 1988
- Termination of rewritingJournal of Symbolic Computation, 1987
- Machine Configuration and Word Problems of Given Degree of UnsolvabilityMathematical Logic Quarterly, 1965
- Computability of Recursive FunctionsJournal of the ACM, 1963