A transformational methodology for proving termination of logic programs
- 19 November 2005
- book chapter
- Published by Springer Nature
- p. 213-226
- https://doi.org/10.1007/bfb0023769
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On Using Mode Input-output for Transforming Logic ProgramsPublished by Springer Nature ,1992
- Proving termination of general Prolog programsPublished by Springer Nature ,1991
- Rewrite SystemsPublished by Elsevier ,1990
- Termination Proofs for Logic ProgramsPublished by Springer Nature ,1990
- An overview of Rewrite Rule Laboratory (RRL)Lecture Notes in Computer Science, 1989
- 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
- Foundations of Logic ProgrammingPublished by Springer Nature ,1987
- AND parallelism and nondeterminism in logic programsNew Generation Computing, 1985