Proving termination of general Prolog programs
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 265-289
- https://doi.org/10.1007/3-540-54415-1_50
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Proving termination properties of Prolog programs: a semantic approachPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Logic ProgrammingPublished by Elsevier ,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
- Towards a Theory of Declarative KnowledgePublished by Elsevier ,1988
- Nonmonotonic logic and temporal projectionArtificial Intelligence, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- Foundations of Logic ProgrammingPublished by Springer Nature ,1987
- A deterministic prolog fixpoint semanticsThe Journal of Logic Programming, 1985