Transformational methodology for proving termination of logic programs
- 31 January 1998
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 34 (1) , 1-41
- https://doi.org/10.1016/s0743-1066(97)00028-9
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- TERMINATION OF TERM REWRITING BY SEMANTIC LABELLINGFundamenta Informaticae, 1995
- Termination of logic programs: the never-ending storyThe Journal of Logic Programming, 1994
- Reasoning about Termination of Pure Prolog ProgramsInformation and Computation, 1993
- Strong termination of logic programsThe Journal of Logic Programming, 1993
- Termination Proofs for Logic ProgramsPublished by Springer Nature ,1990
- Automatic mode inference for logic programsThe Journal of Logic Programming, 1988
- Efficient tests for top-down termination of logical rulesJournal of the ACM, 1988
- Termination of rewritingJournal of Symbolic Computation, 1987
- AND parallelism and nondeterminism in logic programsNew Generation Computing, 1985
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982