Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving
Autor(en):
Zusammenfassung
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.
- Vollständige Referenz
- BibTeX
Schneider-Kamp, P.,
(2010).
Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving.
KI - Künstliche Intelligenz: Vol. 24, No. 1.
Springer.
(S. 79-81).
DOI: 10.1007/s13218-010-0015-5
@article{mci/Schneider-Kamp2010,
author = {Schneider-Kamp, Peter},
title = {Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving},
journal = {KI - Künstliche Intelligenz},
volume = {24},
number = {1},
year = {2010},
,
pages = { 79-81 } ,
doi = { 10.1007/s13218-010-0015-5 }
}
author = {Schneider-Kamp, Peter},
title = {Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving},
journal = {KI - Künstliche Intelligenz},
volume = {24},
number = {1},
year = {2010},
,
pages = { 79-81 } ,
doi = { 10.1007/s13218-010-0015-5 }
}
Sollte hier kein Volltext (PDF) verlinkt sein, dann kann es sein, dass dieser aus verschiedenen Gruenden (z.B. Lizenzen oder Copyright) nur in einer anderen Digital Library verfuegbar ist. Versuchen Sie in diesem Fall einen Zugriff ueber die verlinkte DOI: 10.1007/s13218-010-0015-5
Haben Sie fehlerhafte Angaben entdeckt? Sagen Sie uns Bescheid: Feedback abschicken
Mehr Information
ISSN: 1610-1987
Datum: 2010
Typ: Text/Journal Article