Paper Info
Title
Termination Proofs of Well-Moded Logic Programs via Conditional Rewrite Systems
Abstract
In this paper, it is shown that a translation from logic programs to conditional rewrite rules can be used in a straightforward way to check (semi-automatically) whether a program is terminating under the prolog selection rule.
Year
DOI
Venue
1992
10.1007/3-540-56393-8_34
Conditional Term Rewriting Systems
Keywords
Field
DocType
well-moded logic programs,conditional rewrite systems,termination proofs
Programming language,Computer science,Rippling,Theoretical computer science,Prolog,Mathematical proof,Normalization property
Conference
ISBN
Citations 
PageRank 
3-540-56393-8
27
1.47
References 
Authors
6
2
Name
Order
Citations
PageRank
Harald Ganzinger11513155.21
Uwe Waldmann230026.30