Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving
| dc.contributor.author | Schneider-Kamp, Peter | |
| dc.date.accessioned | 2018-01-08T09:14:12Z | |
| dc.date.available | 2018-01-08T09:14:12Z | |
| dc.date.issued | 2010 | |
| dc.description.abstract | The dissertation “Static Termination Analysis for Prolog using Term Rewriting and SAT Solving” (Schneider-Kamp in Dissertation, RWTH Aachen University, 2008) presents a fresh approach to automated termination analysis of Prolog programs. This approach is based on the following three main concepts: the use of program transformations to obtain simpler termination problems, a framework for modular termination analysis, and the encoding of search problems into satisfiability of propositional logic (SAT) for efficient generation of ranking functions. | |
| dc.identifier.pissn | 1610-1987 | |
| dc.identifier.uri | https://dl.gi.de/handle/20.500.12116/11123 | |
| dc.publisher | Springer | |
| dc.relation.ispartof | KI - Künstliche Intelligenz: Vol. 24, No. 1 | |
| dc.relation.ispartofseries | KI - Künstliche Intelligenz | |
| dc.title | Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving | |
| dc.type | Text/Journal Article | |
| gi.citation.endPage | 81 | |
| gi.citation.startPage | 79 |