Methodology for proving the termination of logic programs
- 13 November 2005
- book chapter
- Published by Springer Nature
- p. 214-227
- https://doi.org/10.1007/bfb0020800
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- PROVING TERMINATION OF LOGIC PROGRAMSPublished by World Scientific Pub Co Pte Ltd ,1989
- Inductive assertion method for logic programsTheoretical Computer Science, 1988
- Termination of rewritingJournal of Symbolic Computation, 1987
- Foundations of Logic ProgrammingPublished by Springer Nature ,1987
- Verifleation of Prolog programs using an extension of executionPublished by Springer Nature ,1986
- On logic programs with data-driven computationsPublished by Springer Nature ,1985
- Negation as failure: a comparison of Clark's completed data base and Reiter's closed world assumptionThe Journal of Logic Programming, 1984
- Principles of Artificial IntelligencePublished by Springer Nature ,1982
- Negation as FailurePublished by Springer Nature ,1978
- Assigning meanings to programsPublished by American Mathematical Society (AMS) ,1967