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 条
  • [1] Well-founded semantics for defeasible logic
    Frederick Maier
    Donald Nute
    [J]. Synthese, 2010, 176 : 243 - 274
  • [2] Ambiguity propagating defeasible logic and the well-founded semantics
    Maier, Frederick
    Nute, Donald
    [J]. LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2006, 4160 : 306 - 318
  • [3] Interdefinability of defeasible logic and logic programming under the well-founded semantics
    Maier, Frederick
    [J]. THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2013, 13 : 107 - 142
  • [4] On the Problem of Computing Ambiguity Propagation and Well-Founded Semantics in Defeasible Logic
    Lam, Ho-Pun
    Governatori, Guido
    [J]. SEMANTIC WEB RULES, 2010, 6403 : 119 - +
  • [5] THE WELL-FOUNDED SEMANTICS FOR GENERAL LOGIC PROGRAMS
    VANGELDER, A
    ROSS, KA
    SCHLIPF, JS
    [J]. JOURNAL OF THE ACM, 1991, 38 (03) : 620 - 650
  • [6] 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
  • [7] 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
  • [8] WELL-FOUNDED SEMANTICS AND STRATIFICATION FOR ORDERED LOGIC PROGRAMS
    LEONE, N
    ROSSI, G
    [J]. NEW GENERATION COMPUTING, 1993, 12 (01) : 91 - 121
  • [9] 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):
  • [10] A PROCEDURAL SEMANTICS FOR WELL-FOUNDED NEGATION IN LOGIC PROGRAMS
    ROSS, KA
    [J]. JOURNAL OF LOGIC PROGRAMMING, 1992, 13 (01): : 1 - 22