Computing the well-founded semantics faster

被引：0
|
作者：
Berman, K.A.
Schlipf, J.S.
Franco, J.V.
机构：
来源：
International Journal of Pressure Vessels and Piping | 1996年 / 65卷 / 02期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] SLT-resolution for the well-founded semantics
    Shen, YD
    Yuan, LY
    You, JH
    JOURNAL OF AUTOMATED REASONING, 2002, 28 (01) : 53 - 97
  • [42] A well-founded, scientifically well-founded Basic Education
    Beratung, Technische
    ELEKTROTECHNIK UND INFORMATIONSTECHNIK, 2009, 126 (10):
  • [43] Epistemic foundation of the well-founded semantics over bilattices
    Loyer, Y
    Straccia, U
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS, 2004, 3153 : 513 - 524
  • [44] The approximate well-founded semantics for logic programs with uncertainty
    Loyer, Y
    Straccia, U
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 541 - 550
  • [45] ADDING CLOSED WORLD ASSUMPTIONS TO WELL-FOUNDED SEMANTICS
    PEREIRA, LM
    ALFERES, JJ
    APARICIO, JN
    THEORETICAL COMPUTER SCIENCE, 1994, 122 (1-2) : 49 - 68
  • [46] The Well-Founded Semantics Is the Principle of Inductive Definition, Revisited
    Denecker, Marc
    Vennekens, Joost
    FOURTEENTH INTERNATIONAL CONFERENCE ON THE PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2014, : 22 - 31
  • [47] Ambiguity propagating defeasible logic and the well-founded semantics
    Maier, Frederick
    Nute, Donald
    LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4160 : 306 - 318
  • [48] SAFE COMPUTATION OF THE WELL-FOUNDED SEMANTICS OF DATALOG QUERIES
    LEONE, N
    RULLO, P
    INFORMATION SYSTEMS, 1992, 17 (01) : 17 - 31
  • [49] SOUNDNESS AND COMPLETENESS OF PARTIAL DEDUCTIONS FOR WELL-FOUNDED SEMANTICS
    PRZYMUSINSKA, H
    PRZYMUSINSKI, T
    SEKI, H
    LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1992, 624 : 1 - 12
  • [50] A rewriting method for well-founded semantics with explicit negation
    Cabalar, P
    LOGICS PROGRAMMING, PROCEEDINGS, 2002, 2401 : 378 - 392
12345