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 条
  • [31] TERMINATION OF TERM REWRITING - INTERPRETATION AND TYPE ELIMINATION
    ZANTEMA, H
    JOURNAL OF SYMBOLIC COMPUTATION, 1994, 17 (01) : 23 - 50
  • [32] Parallelization of Termination Checker of Term Rewriting Systems
    Ding, Rui
    Sato, Haruhiko
    Kurihara, Masahito
    INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, IMECS 2012, VOL I, 2012, : 757 - 762
  • [33] Parallelization of Termination Checker for Term Rewriting System
    Ding, Rui
    Sato, Haruhiko
    Kurihara, Masahito
    PROCEEDINGS 2012 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2012, : 1824 - 1829
  • [34] Decomposable termination of composable term rewriting systems
    Kurihara, Masahito, 1600, Inst of Electronics, Inf & Commun Engineers of Japan, Tokyo, Japan (E78-D):
  • [35] ON THE MODULARITY OF TERMINATION OF TERM REWRITING-SYSTEMS
    OHLEBUSCH, E
    THEORETICAL COMPUTER SCIENCE, 1994, 136 (02) : 333 - 360
  • [36] Operational termination of conditional term rewriting systems
    Lucas, S
    Marché, C
    Meseguer, J
    INFORMATION PROCESSING LETTERS, 2005, 95 (04) : 446 - 453
  • [37] Termination of just/fair computations in term rewriting
    Lucas, Salvador
    Meseguer, Jose
    INFORMATION AND COMPUTATION, 2008, 206 (05) : 652 - 675
  • [38] PROVING TERMINATION FOR TERM REWRITING-SYSTEMS
    WEIERMANN, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 626 : 419 - 428
  • [39] MODULAR TERM REWRITING-SYSTEMS AND THE TERMINATION
    KURIHARA, M
    KAJI, I
    INFORMATION PROCESSING LETTERS, 1990, 34 (01) : 1 - 4
  • [40] Matrix interpretations for proving termination of term rewriting
    Endrullis, Joerg
    Waldmann, Johannes
    Zantema, Hans
    JOURNAL OF AUTOMATED REASONING, 2008, 40 (2-3) : 195 - 220
12345