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 条
  • [31] Hybrid probabilistic logic programs as residuated logic programs
    Damásio C.V.
    Pereira L.M.
    Studia Logica, 2002, 72 (1) : 113 - 138
  • [32] Hybrid Probabilistic logic programs as residuated logic programs
    Damásio, CV
    Pereira, LM
    LOGICS IN ARTIFICIAL INTELLIGENCE, 2000, 1919 : 57 - 72
  • [33] A logical foundation for logic programming II: Semantics of general logic programs
    Bochman, A
    JOURNAL OF LOGIC PROGRAMMING, 1998, 35 (02): : 171 - 194
  • [34] A General Framework for Automatic Termination Analysis of Logic Programs
    Nachum Dershowitz
    Naomi Lindenstrauss
    Yehoshua Sagiv
    Alexander Serebrenik
    Applicable Algebra in Engineering, Communication and Computing, 2001, 12 : 117 - 156
  • [35] A visualization method for knowledge represented by general logic programs
    Sasakura, M
    FIFTH INTERNATIONAL CONFERENCE ON INFORMATION VISUALISATION, PROCEEDINGS, 2001, : 135 - 140
  • [36] Compiling defeasible inheritance networks to general logic programs
    You, JH
    Wang, XC
    Yuan, LY
    ARTIFICIAL INTELLIGENCE, 1999, 113 (1-2) : 247 - 268
  • [37] THE WELL-FOUNDED SEMANTICS FOR GENERAL LOGIC PROGRAMS
    VANGELDER, A
    ROSS, KA
    SCHLIPF, JS
    JOURNAL OF THE ACM, 1991, 38 (03) : 620 - 650
  • [38] On termination of general logic programs WRT constructive negation
    Marchiori, E
    JOURNAL OF LOGIC PROGRAMMING, 1996, 26 (01): : 69 - 89
  • [39] A general framework for automatic termination analysis of logic programs
    Dershowitz, N
    Lindenstrauss, N
    Sagiv, Y
    Serebrenik, A
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2001, 12 (1-2) : 117 - 156
  • [40] Practical methods for proving termination of general logic programs
    Marchiori, E
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 1996, 4 : 179 - 208