Static Terrmination Analysis for Prolog Using Term Rewriting and SAT Solving

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

Resumé

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.
OriginalsprogEngelsk
TidsskriftKuenstliche Intelligenz
Vol/bind24
Udgave nummer1
Sider (fra-til)79-81
ISSN0933-1875
DOI
StatusUdgivet - 2010

Fingeraftryk

earning a doctorate
logic
ranking

Citer dette

@article{f4a2b113bdfe4cf18bb98974151a9766,
title = "Static Terrmination Analysis for Prolog Using Term Rewriting and SAT Solving",
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.",
author = "Peter Schneider-Kamp",
year = "2010",
doi = "10.1007/s13218-010-0015-5",
language = "English",
volume = "24",
pages = "79--81",
journal = "Kuenstliche Intelligenz",
issn = "0933-1875",
publisher = "Heinemann",
number = "1",

}

Static Terrmination Analysis for Prolog Using Term Rewriting and SAT Solving. / Schneider-Kamp, Peter.

I: Kuenstliche Intelligenz, Bind 24, Nr. 1, 2010, s. 79-81.

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningpeer review

TY - JOUR

T1 - Static Terrmination Analysis for Prolog Using Term Rewriting and SAT Solving

AU - Schneider-Kamp, Peter

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

U2 - 10.1007/s13218-010-0015-5

DO - 10.1007/s13218-010-0015-5

M3 - Journal article

VL - 24

SP - 79

EP - 81

JO - Kuenstliche Intelligenz

JF - Kuenstliche Intelligenz

SN - 0933-1875

IS - 1

ER -