Tutorial on termination of logic programs
- 1 January 1992
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Proving termination properties of Prolog programs: a semantic approachPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Rewriting Concepts in the Study of Termination of Logic ProgramsPublished by Springer Nature ,1993
- Derivation of linear size relations by abstract interpretationPublished by Springer Nature ,1992
- Acyclic programsNew Generation Computing, 1991
- Proving termination of general Prolog programsPublished by Springer Nature ,1991
- Weighted graphs: A tool for studying the halting problem and time complexity in term rewriting systems and logic programmingTheoretical Computer Science, 1990
- Studies in Pure Prolog: TerminationPublished by Springer Nature ,1990
- Termination Proofs for Logic ProgramsPublished by Springer Nature ,1990
- Efficient tests for top-down termination of logical rulesJournal of the ACM, 1988
- Termination of rewritingJournal of Symbolic Computation, 1987