Computing the well-founded semantics faster

被引:0
|
作者
Berman, K.A.
Schlipf, J.S.
Franco, J.V.
机构
关键词
D O I
暂无
中图分类号
学科分类号
摘要
引用
收藏
相关论文
共 50 条
  • [31] Constructive negation under the well-founded semantics
    Liu, JY
    Adams, L
    Chen, WD
    JOURNAL OF LOGIC PROGRAMMING, 1999, 38 (03): : 295 - 330
  • [32] Linear tabulated resolution for the well-founded semantics
    Shen, YD
    Yuan, LY
    You, JH
    Zhou, NF
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 1999, 1730 : 192 - 205
  • [33] An Engine for Computing Well-Founded Models
    Swift, Terrance
    LOGIC PROGRAMMING, 2009, 5649 : 514 - 518
  • [34] The well-founded semantics is the principle of inductive definition
    Denecker, M
    LOGICS IN ARTIFICIAL INTELLIGENCE, 1998, 1489 : 1 - 16
  • [35] Fuzzy unification and argumentation for well-founded semantics
    Schweimeier, R
    Schroeder, M
    SOFSEM 2004: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2004, 2932 : 102 - 121
  • [36] THE WELL-FOUNDED SEMANTICS FOR GENERAL LOGIC PROGRAMS
    VANGELDER, A
    ROSS, KA
    SCHLIPF, JS
    JOURNAL OF THE ACM, 1991, 38 (03) : 620 - 650
  • [37] Contradiction removal within well-founded semantics
    Pereira, L.M.
    Alferes, J.J.
    Aparicio, J.N.
    Logic Programming and Non-monotonic Reasoning - Proceedings, 1991,
  • [38] SLT-Resolution for the Well-Founded Semantics
    Yi-Dong Shen
    Li-Yan Yuan
    Jia-Huai You
    Journal of Automated Reasoning, 2002, 28 : 53 - 97
  • [39] Constructive negation under the well-founded semantics
    Yuan-Ze Univ, Taiwan
    J Logic Program, 3 (295-330):
  • [40] 2 SIMPLE CHARACTERIZATIONS OF WELL-FOUNDED SEMANTICS
    PRZYMUSINSKI, TC
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 629 : 449 - 462