STRATIFICATION OF DEFINITE CLAUSE PROGRAMS AND OF GENERAL LOGIC PROGRAMS

被引:0
|
作者
STEPANKOVA, O
STEPANEK, P
机构
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
引用
收藏
页码:396 / 408
页数:13
相关论文
共 50 条
  • [21] A parameterized unfold/fold transformation framework for definite logic programs
    Roychoudhury, A
    Kumar, KN
    Ramakrishnan, CR
    Ramakrishnan, IV
    PRINCIPLES AND PRACTICE OF DECLARATIVE PROGRAMMING, PROCEEDINGS, 1999, 1702 : 396 - 413
  • [22] Detecting infinite SLD-derivations in definite logic programs
    Bagai, R
    PROCEEDINGS OF THE SECOND IASTED INTERNATIONAL CONFERENCE ON NEURAL NETWORKS AND COMPUTATIONAL INTELLIGENCE, 2004, : 79 - 83
  • [23] Termination analysis for abductive general logic programs
    Verbaeten, S
    LOGIC PROGRAMMING: PROCEEDINGS OF THE 1999 INTERNATIONAL CONFERENCE ON LOGIC PROGRAMMING, 1999, : 365 - 379
  • [24] On modular termination proofs of general logic programs
    Bossi, Annalisa
    Cocco, Nicoletta
    Rossi, Sabina
    Etalle, Sandro
    Theory and Practice of Logic Programming, 2002, 2 (03) : 263 - 291
  • [25] On modular termination proofs of general logic programs
    Bossi, A
    Cocco, N
    Rossi, S
    Etalle, S
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2002, 2 : 263 - 291
  • [26] Tabled evaluation with delaying for general logic programs
    Chen, WD
    Warren, DS
    JOURNAL OF THE ACM, 1996, 43 (01) : 20 - 74
  • [28] WELL-FOUNDED SEMANTICS AND STRATIFICATION FOR ORDERED LOGIC PROGRAMS
    LEONE, N
    ROSSI, G
    NEW GENERATION COMPUTING, 1993, 12 (01) : 91 - 121
  • [29] Smallest Horn clause programs
    Devienne, P
    Lebegue, P
    Parrain, A
    Routier, JC
    Wurtz, J
    JOURNAL OF LOGIC PROGRAMMING, 1996, 27 (03): : 227 - 267
  • [30] TRANSFORMING NORMAL LOGIC PROGRAMS TO CONSTRAINT LOGIC PROGRAMS
    KANCHANASUT, K
    STUCKEY, PJ
    THEORETICAL COMPUTER SCIENCE, 1992, 105 (01) : 27 - 56