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 条
  • [1] Complexity of Subsumption in the εL Family of Description Logics: Acyclic and Cyclic TBoxes
    Haase, Christoph
    Lutz, Carsten
    ECAI 2008, PROCEEDINGS, 2008, 178 : 25 - +
  • [2] A default extension to distributed description logics
    Ma, YL
    Wei, J
    IEEE/WIC/ACM INTERNATIONAL CONFERENCE ON INTELLIGENT AGENT TECHNOLOGY, PROCEEDINGS, 2004, : 38 - 44
  • [3] 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
    Web Intell. Agent Syst., 2006, 4 (371-383):
  • [4] Distributed reasoning with fuzzy description logics
    Lu, Jianjiang
    Li, Yanhui
    Zhou, Bo
    Kang, Dazhou
    Zhang, Yafei
    COMPUTATIONAL SCIENCE - ICCS 2007, PT 1, PROCEEDINGS, 2007, 4487 : 196 - +
  • [5] A distributed and fuzzy extension of description logics
    Li, Yanhui
    Xu, Baowen
    Lu, Jianjiang
    Kang, Dazhou
    KNOWLEDGE-BASED INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS, PT 1, PROCEEDINGS, 2006, 4251 : 655 - 662
  • [6] Query answering in distributed description logics
    Alkhateeb, Faisal
    Zimmermann, Antoine
    NEW TECHNOLOGIES, MOBILITY AND SECURITY, 2007, : 517 - 528
  • [7] On subsumption in distributed derivations
    Bonacina, Maria Paola, 1600, Kluwer Academic Publishers, Dordrecht, Netherlands (12):
  • [8] ON SUBSUMPTION IN DISTRIBUTED DERIVATIONS
    BONACINA, MP
    HSIANG, J
    JOURNAL OF AUTOMATED REASONING, 1994, 12 (02) : 225 - 240
  • [9] Optimizing description logic subsumption
    Horrocks, I
    Patel-Schneider, PF
    JOURNAL OF LOGIC AND COMPUTATION, 1999, 9 (03) : 267 - 293
  • [10] Optimizing description logic subsumption
    Department of Computer Science, University of Manchester, Oxford Road, Manchester, M13 9PL, United Kingdom
    不详
    J Logic Comput, 3 (267-293):