Well-founded semantics for defeasible logic

被引:13
|
作者
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 条
  • [31] On the problem of computing the well-founded semantics
    Lonc, Z
    Truszczynski, M
    COMPUTATIONAL LOGIC - CL 2000, 2000, 1861 : 673 - 687
  • [32] On the problem of computing the well-founded semantics
    Lonc, Z
    Truszczynski, M
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2001, 1 : 591 - 609
  • [33] Computing the well-founded semantics faster
    Berman, KA
    Schlipf, JS
    Franco, JV
    LOGIC PROGRAMMING AND NONMONOTONIC REASONING, 1995, 928 : 113 - 126
  • [34] Hybrid rules with well-founded semantics
    Włodzimierz Drabent
    Jan Małuszyński
    Knowledge and Information Systems, 2010, 25 : 137 - 168
  • [35] Decidability under the well-founded semantics
    Cherchago, Natalia
    Hitzler, Pascal
    Hoelldobler, Steffen
    WEB REASONING AND RULE SYSTEMS, PROCEEDINGS, 2007, 4524 : 269 - +
  • [36] Strong negation in well-founded and partial stable semantics for logic programs
    Cabalar, Pedro
    Odintsov, Sergei
    Pearce, David
    ADVANCES IN ARTIFICIAL INTELLIGENCE - IBERAMIA-SBIA 2006, PROCEEDINGS, 2006, 4140 : 592 - 601
  • [37] Extended Well-Founded Semantics in Bilattices
    Stamate, Daniel
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 9, 2005, 9 : 60 - 65
  • [38] On the problem of computing the well-founded semantics
    Lonc, Zbigniew
    Truszczynski, Miroslaw
    Theory and Practice of Logic Programming, 2001, 1 (05) : 591 - 609
  • [39] Well-founded semantics for Boolean grammars
    Kountouriotis, Vassilis
    Nomikos, Christos
    Rondogiannis, Panos
    DEVELOPMENTS IN LANGUAGE THEORY, PROCEEDINGS, 2006, 4036 : 203 - 214
  • [40] Well-founded semantics for Boolean grammars
    Kountouriotis, Vassilis
    Nomikos, Christos
    Rondogiannis, Panos
    INFORMATION AND COMPUTATION, 2009, 207 (09) : 945 - 967