TALP:: A tool for the termination analysis of logic programs

被引：0
|
作者：
Ohlebusch, E
Claves, C
Marché, C
机构：
[1] Univ Bielefeld, Fac Technol, D-33501 Bielefeld, Germany
[2] Univ Paris 11, Ctr Orsay, CNRS, URA 410,LRI, F-91405 Orsay, France
来源：
REWRITING TECHNIQUES AND APPLICATIONS, PROCEEDINGS | 2000年 / 1833卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：270 / 273
页数：4
相关论文
共 50 条
  • [31] TOWARDS A CHARACTERIZATION OF TERMINATION OF LOGIC PROGRAMS
    WANG, B
    SHYAMASUNDAR, RK
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 456 : 204 - 221
  • [32] When size does matter - Termination analysis for typed logic programs
    Vanhoof, W
    Bruynooghe, M
    LOGIC BASED PROGRAM SYNTHESIS AND TRANSFORMATION, 2002, 2372 : 129 - 147
  • [33] Applying static analysis techniques for inferring termination conditions of logic programs
    Mesnard, F
    Neumerkel, U
    STATIC ANALYSIS, PROCEEDINGS, 2001, 2126 : 93 - 110
  • [34] Inference of well-typings for logic programs with application to termination analysis
    Bruynooghe, M
    Gallagher, J
    Van Humbeeck, W
    STATIC ANALYSIS, PROCEEDINGS, 2005, 3672 : 35 - 51
  • [35] Termination analysis of tabled logic programs using mode and type information
    Verbaeten, S
    De Schreye, D
    FUNCTIONAL AND LOGIC PROGRAMMING, PROCEEDINGS, 1999, 1722 : 163 - 178
  • [36] Transformational methodology for proving termination of logic programs
    Rao, MRKK
    Kapur, D
    Shyamasundar, RK
    JOURNAL OF LOGIC PROGRAMMING, 1998, 34 (01): : 1 - 41
  • [37] Termination of Logic Programs: Transformational Methods Revisited
    Enno Ohlebusch
    Applicable Algebra in Engineering, Communication and Computing, 2001, 12 : 73 - 116
  • [38] On proving left termination of constraint logic programs
    Iremia, Univ. de La Réunion
    不详
    不详
    ACM Transactions on Computational Logic, 2003, 4 (02) : 207 - 259
  • [39] Termination of logic programs: Transformational methods revisited
    Ohlebusch, E
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2001, 12 (1-2) : 73 - 116
  • [40] An abstract interpretation approach to termination of logic programs
    Gori, R
    LOGIC FOR PROGRAMMING AND AUTOMATED REASONING, PROCEEDINGS, 2000, 1955 : 362 - 380
12345