Well-founded semantics for defeasible logic

被引:15
|
作者
Maier, Frederick [1 ]
Nute, Donald [2 ]
机构
[1] Florida Inst Human & Machine Cognit, Pensacola, FL 32502 USA
[2] Univ Georgia, Inst Artificial Intelligence, Athens, GA 30605 USA
关键词
Defeasible reasoning; Nonmonotonic logic; Well-founded semantics; Ambiguity propagation; Floating conclusions; Cut; Cautious monotony; Consistency preservation; INHERITANCE;
D O I
10.1007/s11229-009-9492-1
中图分类号
N09 [自然科学史]; B [哲学、宗教];
学科分类号
01 ; 0101 ; 010108 ; 060207 ; 060305 ; 0712 ;
摘要
Fixpoint semantics are provided for ambiguity blocking and propagating variants of Nute's defeasible logic. The semantics are based upon the well-founded semantics for logic programs. It is shown that the logics are sound with respect to their counterpart semantics and complete for locally finite theories. Unlike some other nonmonotonic reasoning formalisms such as Reiter's default logic, the two defeasible logics are directly skeptical and so reject floating conclusions. For defeasible theories with transitive priorities on defeasible rules, the logics are shown to satisfy versions of Cut and Cautious Monotony. For theories with either conflict sets closed under strict rules or strict rules closed under transposition, a form of Consistency Preservation is shown to hold. The differences between the two logics and other variants of defeasible logic-specifically those presented by Billington, Antoniou, Governatori, and Maher-are discussed.
引用
收藏
页码:243 / 274
页数:32
相关论文
共 50 条
  • [21] Well-Founded Semantics for Description Logic Programs in the Semantic Web
    Eiter, Thomas
    Ianni, Giovambattista
    Lukasiewicz, Thomas
    Schindlauer, Roman
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2011, 12 (02)
  • [22] Well-founded semantics for extended logic programs with dynamic preferences
    Brewka, G
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 1996, 4 : 19 - 36
  • [23] Well-founded semantics for extended logic programs with dynamic preferences
    Brewka, Gerhard
    Journal of Artificial Intelligence Research, 1996, 4 : 19 - 36
  • [24] The well-founded semantics is a stratified fitting semantics
    Hitzler, P
    Wendt, M
    KI2002: ADVANCES IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2002, 2479 : 205 - 221
  • [25] EQUIVALENCE OF WELL-FOUNDED AND STABLE SEMANTICS
    GIRE, F
    JOURNAL OF LOGIC PROGRAMMING, 1994, 21 (02): : 95 - 111
  • [26] Hybrid rules with well-founded semantics
    Drabent, Wlodzimierz
    Maluszynski, Jan
    KNOWLEDGE AND INFORMATION SYSTEMS, 2010, 25 (01) : 137 - 168
  • [27] UNFOLD FOLD TRANSFORMATION OF GENERAL LOGIC PROGRAMS FOR THE WELL-FOUNDED SEMANTICS
    SEKI, H
    JOURNAL OF LOGIC PROGRAMMING, 1993, 16 (1-2): : 5 - 23
  • [28] Tabulated resolution for the well-founded semantics
    Bol, R
    Degerstedt, L
    JOURNAL OF LOGIC PROGRAMMING, 1998, 34 (02): : 67 - 109
  • [29] An infinite-game semantics for well-founded negation in logic programming
    Galanaki, Chrysida
    Rondogiannis, Panos
    Wadge, William W.
    ANNALS OF PURE AND APPLIED LOGIC, 2008, 151 (2-3) : 70 - 88
  • [30] On the Computation of the Disjunctive Well-Founded Semantics
    C. A. Johnson
    Journal of Automated Reasoning, 2001, 26 : 333 - 356