AUGMENTING SUBSUMPTION PROPAGATION IN DISTRIBUTED DESCRIPTION LOGICS

被引:6
|
作者
Homola, Martin [1 ,2 ]
Serafini, Luciano [2 ]
机构
[1] Comenius Univ, Fac Math Phys & Informat, Bratislava 84248, Slovakia
[2] Fdn Bruno Kessler, Trento, Italy
关键词
D O I
10.1080/08839510903448650
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Distributed description logics (DDL) enable reasoning with multiple ontologies interconnected by directional semantic mapping, called bridge rules. Bridge rules map concepts of a source ontology into concepts of a target ontology. Concept subsumptions of the source ontology can be propagated according to a propagation pattern expressed by means of bridge rules into concept subsumptions of the target ontology. In the basic formulation of DDL, such a propagation is mostly limited to cases when pairs of ontologies are directly linked by means of bridge rules. However, when more than two ontologies are involved, one would expect that subsumption propagates along chains of ontologies linked by bridge rules, but the semantics of DDL is too weak to support this behavior. In a recent study, an adjusted semantics for DDL that supports subsumption propagation through chains of bridge rules has been introduced. This study makes use of a so-called compositional consistency requirement that has been employed before in package-based description logics. While the results concerning subsumption propagation under the adjusted semantics are encouraging, there are important drawbacks. In this article we take a wider perspective, and propose a study of several different alternative extensions of the DDL semantics. For each of them we study the formal properties, and we select the one that, according to our analysis, constitutes a good compromise, and for this case we provide a sound and complete tableaux decision procedure.
引用
收藏
页码:39 / 76
页数:38
相关论文
共 50 条
  • [41] Perspective-based accessing to Web datasources An approach using distributed description logics
    Ouziri, Mourad
    2009 IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND INTELLIGENT SYSTEMS, PROCEEDINGS, VOL 3, 2009, : 706 - 710
  • [42] Combining Description Logics, Description Graphs, and Rules
    Motik, Boris
    CONCEPTUAL STRUCTURES: FROM INFORMATION TO INTELLIGENCE, 2010, 6208 : 10 - 12
  • [43] Fusions of description logics and abstract description systems
    Baader, F
    Lutz, C
    Strum, H
    Wolter, F
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2002, 16 : 1 - 58
  • [44] Combining Description Logics, Description Graphs, and Rules
    Motik, Boris
    FRONTIERS OF COMBINING SYSTEMS, PROCEEDINGS, 2009, 5749 : 43 - 67
  • [45] Quantitative Variants of Language Equations and their Applications to Description Logics Extending Unification in Description Logics
    Marantidis, Pavlos
    KUNSTLICHE INTELLIGENZ, 2020, 34 (03): : 405 - 409
  • [46] Description logics for shape analysis
    Georgieva, L
    Maier, P
    SEFM 2005: THIRD IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND FORMAL METHODS, PROCEEDINGS, 2005, : 321 - 330
  • [47] On scene interpretation with description logics
    Neumann, Bernd
    Moeller, Ralf
    COGNITIVE VISION SYSTEMS: SAMPLING THE SPECTRUM OF APPROACHERS, 2006, 3948 : 247 - 275
  • [48] Reconciling Description Logics and Rules
    Motik, Boris
    Rosati, Riccardo
    JOURNAL OF THE ACM, 2010, 57 (05)
  • [49] DESCRIPTION LOGICS IN DATA MANAGEMENT
    BORGIDA, A
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 1995, 7 (05) : 671 - 682
  • [50] Bisimilarity for Paraconsistent Description Logics
    Linh Anh Nguyen
    Thi Hong Khanh Nguyen
    Ngoc-Thanh Nguyen
    Quang-Thuy Ha
    2016 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2016, : 4694 - 4699