PARTIAL DEDUCTION OF LOGIC PROGRAMS WRT WELL-FOUNDED SEMANTICS

被引：10
|
作者：
ARAVINDAN, C
DUNG, PM
机构：
[1] Computer Science Program, School of Advanced Technologies, Asian Institute of Technology, Bangkok, 10501
来源：
NEW GENERATION COMPUTING | 1994年 / 13卷 / 01期
关键词：
PARTIAL DEDUCTION; PROGRAM TRANSFORMATION; PROGRAM SPECIALIZATION; WELL-FOUNDED NEGATION;
D O I：
10.1007/BF03038308
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we extend the partial deduction framework of Lloyd and Shepherdson, so that unfolding of non-ground negative literals and loop checks can be carried out during partial deduction. We show that the unified framework is sound and complete wrt well-founded model semantics, when certain conditions are satisfied.
引用
收藏
页码：45 / 74
页数：30
相关论文
共 50 条
  • [41] EQUIVALENCE OF WELL-FOUNDED AND STABLE SEMANTICS
    GIRE, F
    [J]. JOURNAL OF LOGIC PROGRAMMING, 1994, 21 (02): : 95 - 111
  • [42] Tabulated resolution for the well-founded semantics
    Bol, R
    Degerstedt, L
    [J]. JOURNAL OF LOGIC PROGRAMMING, 1998, 34 (02): : 67 - 109
  • [43] Unfounded Sets and Well-Founded Semantics of Answer Set Programs with Aggregates
    Alviano, Mario
    Calimeri, Francesco
    Faber, Wolfgang
    Leone, Nicola
    Perri, Simona
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2011, 42 : 487 - 527
  • [44] On the Computation of the Disjunctive Well-Founded Semantics
    C. A. Johnson
    [J]. Journal of Automated Reasoning, 2001, 26 : 333 - 356
  • [45] Hybrid rules with well-founded semantics
    Włodzimierz Drabent
    Jan Małuszyński
    [J]. Knowledge and Information Systems, 2010, 25 : 137 - 168
  • [46] An infinite-game semantics for well-founded negation in logic programming
    Galanaki, Chrysida
    Rondogiannis, Panos
    Wadge, William W.
    [J]. ANNALS OF PURE AND APPLIED LOGIC, 2008, 151 (2-3) : 70 - 88
  • [47] On the Problem of Computing Ambiguity Propagation and Well-Founded Semantics in Defeasible Logic
    Lam, Ho-Pun
    Governatori, Guido
    [J]. SEMANTIC WEB RULES, 2010, 6403 : 119 - +
  • [48] Computing the well-founded semantics faster
    Berman, KA
    Schlipf, JS
    Franco, JV
    [J]. LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 1995, 928 : 113 - 126
  • [49] On the problem of computing the well-founded semantics
    Lonc, Z
    Truszczynski, M
    [J]. COMPUTATIONAL LOGIC - CL 2000, 2000, 1861 : 673 - 687
  • [50] On the problem of computing the well-founded semantics
    Lonc, Z
    Truszczynski, M
    [J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2001, 1 : 591 - 609
12345