A methodology for proving termination of logic programs
- 31 August 1994
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 21 (1) , 1-30
- https://doi.org/10.1016/0743-1066(94)90004-3
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Termination of rewrite systems by elementary interpretationsPublished by Springer Nature ,2005
- Towards a characterization of termination of logic programsPublished by Springer Nature ,2005
- A transformational methodology for proving termination of logic programsPublished by Springer Nature ,2005
- Proving termination of GHC programsNew Generation Computing, 1997
- Termination of rewrite systems by elementary interpretationsFormal Aspects of Computing, 1995
- A completeness theorem for SLDNF resolutionThe Journal of Logic Programming, 1989
- Signed data dependencies in logic programsThe Journal of Logic Programming, 1989
- Inductive assertion method for logic programsTheoretical Computer Science, 1988
- Efficient tests for top-down termination of logical rulesJournal of the ACM, 1988
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumptionThe Journal of Logic Programming, 1984