Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving

被引：0
|
作者：
Schneider-Kamp, Peter
机构：
来源：
KUNSTLICHE INTELLIGENZ | 2010年 / 24卷 / 01期
关键词：
Logic Programming; Modular Framework; Program Transformation; Prolog Program; Ranking Function;
D O I：
10.1007/s13218-010-0015-5
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The dissertation "Static Termination Analysis for Prolog using Term Rewriting and SAT Solving" (SchneiderKamp 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.
引用
收藏
页码：79 / 81
页数：3
相关论文
共 50 条
  • [21] Termination of Graph and Term Graph Rewriting
    Koenig, Barbara
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2016, (225): : 2 - 2
  • [22] STATIC ANALYSIS OF TERM GRAPH REWRITING-SYSTEMS
    HANKIN, C
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 506 : 367 - 384
  • [23] Proving Termination of Integer Term Rewriting
    Fuhs, Carsten
    Giesl, Juergen
    Pluecker, Martin
    Schneider-Kamp, Peter
    Falke, Stephan
    REWRITING TECHNIQUES AND APPLICATIONS, 2009, 5595 : 32 - +
  • [24] Tuple Interpretations for Termination of Term Rewriting
    Yamada, Akihisa
    Journal of Automated Reasoning, 2022, 66 (04): : 667 - 688
  • [25] Termination of fair computations in term rewriting
    Lucas, S
    Meseguer, J
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2005, 3835 : 184 - 198
  • [26] From Linear Term Rewriting to Graph Rewriting with Preservation of Termination
    Overbeek, Roy
    Endrullis, Jorg
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2021, (350): : 19 - 34
  • [27] Automated termination analysis for Haskell: From term rewriting to programming languages
    Giesl, Juergen
    Swiderski, Stephan
    Schneider-Kamp, Peter
    Thiemann, Rene
    TERM REWRITING AND APPLICATIONS, PROCEEDINGS, 2006, 4098 : 297 - 312
  • [28] Typed static analysis:: Application to groundness analysis of PROLOG and λPROLOG
    Ridoux, O
    Boizumault, P
    Malésieux, F
    FUNCTIONAL AND LOGIC PROGRAMMING, PROCEEDINGS, 1999, 1722 : 267 - 283
  • [29] Automated Termination Proofs for Haskell by Term Rewriting
    Giesl, Juergen
    Raffelsieper, Matthias
    Schneider-Kamp, Peter
    Swiderski, Stephan
    Thiemann, Rene
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 2011, 33 (02):
  • [30] STATIC ANALYSIS OF PROLOG WITH CUT
    FILE, G
    ROSSI, S
    LOGIC PROGRAMMING AND AUTOMATED REASONING, 1993, 698 : 134 - 145
12345