Tableau Algorithms for E-Connections of Description Logics

摘要: For many years, the Modal Logic community has pursued various techniques for robustly combining logics. These methodologies reflect a new direction in applied to Knowledge Representation, namely toward constructing and investigating complex combined logical formalisms out of simpler ones. The E-Connections framework is novel technique Abstract Description Systems (ADSs), generalization several families decidable logics, including Logics, as well logics time space. In this paper, we investigate different E-Connection languages involving Logics. Recently, Logics have been proposed suitable formalism applications, such ontology integration on Semantic Web. We propose two combinations: one-way allowing transitive symmetric link relations. Then, depth problem reasoning with provide tableau-based decision procedures. Finally, show that our algorithms can be implemented an extension existing DL reasoners present prototype implementation Pellet system. To best knowledge, presented paper are first practical procedures E-Connections.