ALTERNATIVE APPROACHES TO DEFAULT LOGIC

被引:51
|
作者
DELGRANDE, JP [1 ]
SCHAUB, T [1 ]
JACKSON, WK [1 ]
机构
[1] TH DARMSTADT,FACHGEBIET INTELLEKTIK,W-6100 DARMSTADT,GERMANY
关键词
D O I
10.1016/0004-3702(94)90106-6
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Reiter's default logic has proven to be an enduring and versatile approach to nonmonotonic reasoning. Subsequent work in default logic has concentrated in two major areas. First, modifications have been developed to extend and augment the approach. Second, there has been ongoing interest in semantic foundations for default logic. In this paper, a number of variants of default logic are developed to address differing intuitions arising from the original and subsequent formulations. First, we modify the manner in which consistency is used in the definition of a default extension. The idea is that a global rather than local notion of consistency is employed in the formation of a default extension. Second, we argue that in some situations the requirement of proving the antecedent of a default is too strong. A second variant of default logic is developed where this requirement is dropped; subsequently these approaches are combined, leading to a final variant. These variants then lead to default systems which conform to alternative intuitions regarding default reasoning. For all of these approaches, a fixed-point and a pseudo-iterative definition are given; as well a semantic characterisation of these approaches is provided. In the combined approach we argue also that one can now reason about a set of defaults and can determine, for example, if a particular default in a set is redundant. We show the relation of this work to that of Lukaszewicz and Brewka, and to the Theorist system.
引用
收藏
页码:167 / 237
页数:71
相关论文
共 50 条
  • [41] Default logic as a query language
    Cadoli, M
    Eiter, T
    Gottlob, G
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1997, 9 (03) : 448 - 463
  • [42] Strong Backdoors for Default Logic
    Fichte, Johannes Klaus
    Meier, Arne
    Schindler, Irena
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2024, 25 (03)
  • [43] Similarity preservation in default logic
    Rachel Ben-Eliyahu-Zohary
    Nissim Francez
    Michael Kaminski
    Annals of Mathematics and Artificial Intelligence, 1999, 25 : 137 - 160
  • [44] Lexicographic priorities in default logic
    Rintanen, J
    ARTIFICIAL INTELLIGENCE, 1998, 106 (02) : 221 - 265
  • [45] Strong Backdoors for Default Logic
    Fichte, Johannes K.
    Meier, Arne
    Schindler, Irina
    THEORY AND APPLICATIONS OF SATISFIABILITY TESTING - SAT 2016, 2016, 9710 : 45 - 59
  • [46] Description logic with default reasoning
    Dong, Ming-Kai
    Jiang, Yun-Cheng
    Shi, Zhong-Zhi
    Jisuanji Xuebao/Chinese Journal of Computers, 2003, 26 (06): : 729 - 736
  • [47] Default logic generalized and simplified
    Alexander Bochman
    Annals of Mathematics and Artificial Intelligence, 2008, 53 : 21 - 49
  • [48] Default logic and bounded treewidth
    Fichte, Johannes K.
    Hecher, Markus
    Schindler, Irina
    INFORMATION AND COMPUTATION, 2022, 283
  • [49] DEFAULT LOGIC ABOUT ASSERTIONS
    SU, KL
    DING, DC
    SCIENCE IN CHINA SERIES A-MATHEMATICS PHYSICS ASTRONOMY & TECHNOLOGICAL SCIENCES, 1994, 37 (11): : 1399 - 1408
  • [50] Translating ontologies to default logic
    Sun, Y
    Sui, YF
    ARTIFICIAL INTELLIGENCE APPLICATIONS AND INNOVATIONS II, 2005, 187 : 145 - 153