TY - JOUR
T1 - Proving termination for logic programs by the query-mapping pairs approach
AU - Lindenstrauss, Naomi
AU - Sagiv, Yehoshua
AU - Serebrenik, Alexander
PY - 2004
Y1 - 2004
N2 - This paper describes a method for proving termination of queries to logic programs based on abstract interpretation. The method uses query-mapping pairs to abstract the relation between calls in the LD-tree associated with the program and query. Any well founded partial order for terms can be used to prove the termination. The ideas of the query-mapping pairs approach have been implemented in SICStus Prolog in a system called TermiLog, which is available on the web. Given a program and query pattern the system either answers that the query terminates or that there may be non-termination. The advantages of the method are its conceptual simplicity and the fact that it does not impose any restrictions on the programs.
AB - This paper describes a method for proving termination of queries to logic programs based on abstract interpretation. The method uses query-mapping pairs to abstract the relation between calls in the LD-tree associated with the program and query. Any well founded partial order for terms can be used to prove the termination. The ideas of the query-mapping pairs approach have been implemented in SICStus Prolog in a system called TermiLog, which is available on the web. Given a program and query pattern the system either answers that the query terminates or that there may be non-termination. The advantages of the method are its conceptual simplicity and the fact that it does not impose any restrictions on the programs.
UR - http://www.scopus.com/inward/record.url?scp=35048902511&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-25951-0_14
DO - 10.1007/978-3-540-25951-0_14
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:35048902511
SN - 0302-9743
VL - 3049
SP - 453
EP - 498
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -