Default description logics with reversing inference rules

被引:0
|
作者
Sun, Yu [1 ]
Sui, Yuefei
机构
[1] Chinese Acad Sci, Inst Comp Technol, Kay Lab Intelligent Informat Proc, Beijing 100080, Peoples R China
[2] Chinese Acad Sci, Grad Sch, Beijing 100039, Peoples R China
关键词
description logics; default logics; reversing inference rules; extensions;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Default description logics are extensions of description logics by Reiter's default logic in order to represent and reason about non-monotonic knowledge. A default says that if its prerequisite is provable, and the negation of its justification is not provable, then its consequence is provable. As a method of using defaults in a reverse way, reversing inference rules are introduced to default description logics. For a default, its reversing inference rule says if the negation of the consequence of the default is provable, then the negation of the prerequisite or the negation of the justification of the default is provable. Then a default description theory is extended to an extended default description theory with reversing inference rules and the definition of extensions of the extended default description theory is given. A default description theory can infer statements by using its defaults. However, an extended default description theory can infer statements not only by using its defaults, but by using its reversing inference rules. The relations between default description theories and their extended default description theories are discussed. For a default description theory without extensions, its extended default description theory may have extensions.
引用
收藏
页码:280 / 285
页数:6
相关论文
共 50 条
  • [1] A default extension to distributed description logics
    Ma, YL
    Wei, J
    [J]. IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON INTELLIGENT AGENT TECHNOLOGY, PROCEEDINGS, 2004, : 38 - 44
  • [2] A default extension to distributed description logics
    Technology Center of Software Engineering, Institute of Software, Chinese Academy of Sciences, P.O. Box 8718, Beijing 100080, China
    [J]. Web Intell. Agent Syst., 2006, 4 (371-383):
  • [3] Reconciling Description Logics and Rules
    Motik, Boris
    Rosati, Riccardo
    [J]. JOURNAL OF THE ACM, 2010, 57 (05)
  • [4] Combining Description Logics, Description Graphs, and Rules
    Motik, Boris
    [J]. CONCEPTUAL STRUCTURES: FROM INFORMATION TO INTELLIGENCE, 2010, 6208 : 10 - 12
  • [5] DERIVING INFERENCE RULES FOR TERMINOLOGICAL LOGICS
    ROYER, V
    QUANTZ, JJ
    [J]. LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1992, 633 : 84 - 105
  • [6] Combining Description Logics, Description Graphs, and Rules
    Motik, Boris
    [J]. FRONTIERS OF COMBINING SYSTEMS, PROCEEDINGS, 2009, 5749 : 43 - 67
  • [7] Semantics and inference for probabilistic description logics
    Zese, Riccardo
    Bellodi, Elena
    Lamma, Evelina
    Riguzzi, Fabrizio
    Aguiari, Fabiano
    [J]. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8816 : 79 - 99
  • [8] Inference and Learning for Probabilistic Description Logics
    Zese, Riccardo
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 4411 - 4412
  • [9] Combining Existential Rules and Description Logics
    Amarilli, Antoine
    Benedikt, Michael
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 2691 - 2697
  • [10] Tabular logics with no finite bases for inference rules
    Rybakov, V.
    [J]. LOGIC JOURNAL OF THE IGPL, 2004, 12 (04) : 301 - 311