PARTIAL DEDUCTION OF LOGIC PROGRAMS WRT WELL-FOUNDED SEMANTICS

被引：0
|
作者：
ARAVINDAN, C
DUNG, PM
机构：
来源：
LECTURE NOTES IN COMPUTER SCIENCE | 1992年 / 632卷
关键词：
PARTIAL DEDUCTION; PROGRAM TRANSFORMATION; WELL-FOUNDED NEGATION;
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
In this paper, we extend the partial deduction framework of [LS] to unfold non-ground negative literals [ST,CW] and to include loop checks [B2] during partial deduction. We show that the unified framework is sound and complete wrt well-founded model semantics, when certain conditions are satisfied.
引用
收藏
页码：384 / 402
页数：19
相关论文
共 50 条
  • [1] PARTIAL DEDUCTION OF LOGIC PROGRAMS WRT WELL-FOUNDED SEMANTICS
    ARAVINDAN, C
    DUNG, PM
    [J]. NEW GENERATION COMPUTING, 1994, 13 (01) : 45 - 74
  • [2] THE WELL-FOUNDED SEMANTICS FOR GENERAL LOGIC PROGRAMS
    VANGELDER, A
    ROSS, KA
    SCHLIPF, JS
    [J]. JOURNAL OF THE ACM, 1991, 38 (03) : 620 - 650
  • [3] Strong negation in well-founded and partial stable semantics for logic programs
    Cabalar, Pedro
    Odintsov, Sergei
    Pearce, David
    [J]. ADVANCES IN ARTIFICIAL INTELLIGENCE - IBERAMIA-SBIA 2006, PROCEEDINGS, 2006, 4140 : 592 - 601
  • [4] The approximate well-founded semantics for logic programs with uncertainty
    Loyer, Y
    Straccia, U
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 541 - 550
  • [5] Well-founded and stable semantics of logic programs with aggregates
    Pelov, Nikolay
    Denecker, Marc
    Bruynooghe, Maurice
    [J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2007, 7 : 301 - 353
  • [6] WELL-FOUNDED SEMANTICS AND STRATIFICATION FOR ORDERED LOGIC PROGRAMS
    LEONE, N
    ROSSI, G
    [J]. NEW GENERATION COMPUTING, 1993, 12 (01) : 91 - 121
  • [7] The well-founded semantics in normal logic programs with uncertainty
    [J]. Association for Logic Programming (ALP); Japan Society for Software Science and Technology (JSSST); Special Interest Group on Programming; Universidad Complutense de Madrid; University of Aizu (Springer Verlag):
  • [8] A PROCEDURAL SEMANTICS FOR WELL-FOUNDED NEGATION IN LOGIC PROGRAMS
    ROSS, KA
    [J]. JOURNAL OF LOGIC PROGRAMMING, 1992, 13 (01): : 1 - 22
  • [9] Well-founded semantics for description logic programs in the Semantic Web
    Eiter, T
    Lukasiewicz, T
    Schindlauer, R
    Tompits, H
    [J]. RULES AND RULE MARKUP LANGUAGES FOR THE SEMANTIC WEB, PROCEEDINGS, 2004, 3323 : 81 - 97
  • [10] ON THE RELATIONS BETWEEN STABLE AND WELL-FOUNDED SEMANTICS OF LOGIC PROGRAMS
    DUNG, PM
    [J]. THEORETICAL COMPUTER SCIENCE, 1992, 105 (01) : 7 - 25
12345