TermiLog: A system for checking termination of queries to logic programs
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 444-447
- https://doi.org/10.1007/3-540-63166-6_44
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Modular Termination Proofs for Logic and Pure PROLOG ProgramsPublished by Oxford University Press (OUP) ,1994
- Termination of logic programs: the never-ending storyThe Journal of Logic Programming, 1994
- Reasoning about Termination of Pure Prolog ProgramsInformation and Computation, 1993
- Abstract interpretation and application to logic programsThe Journal of Logic Programming, 1992
- Acyclic programsNew Generation Computing, 1991
- Deriving constraints among argument sizes in logic programsAnnals of Mathematics and Artificial Intelligence, 1991
- Termination Proofs for Logic ProgramsPublished by Springer Nature ,1990
- Inference of monotonicity constraints in datalog programsPublished by Association for Computing Machinery (ACM) ,1989
- Efficient tests for top-down termination of logical rulesJournal of the ACM, 1988
- Foundations of Logic ProgrammingPublished by Springer Nature ,1987