Proving termination of logic programs by exploiting term properties
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 153-180
- https://doi.org/10.1007/3540539816_66
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Towards a characterization of termination of logic programsPublished by Springer Nature ,2005
- Proving termination properties of Prolog programs: a semantic approachPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Verifying correctness of logic programsPublished by Springer Nature ,1989
- Inductive assertion method for logic programsTheoretical Computer Science, 1988
- Efficient tests for top-down termination of logical rulesJournal of the ACM, 1988
- Foundations of Logic ProgrammingPublished by Springer Nature ,1987
- Proving termination of Prolog programsPublished by Springer Nature ,1985
- The Science of ProgrammingPublished by Springer Nature ,1981
- An axiomatic basis for computer programmingCommunications of the ACM, 1969
- Assigning meanings to programsPublished by American Mathematical Society (AMS) ,1967