Description Logic TBoxes: Model-Theoretic Characterizations and Rewritability
Description Logic TBoxes: Model-Theoretic Characterizations and Rewritability
复制标题
DOI：
10.5591/978-1-57735-516-8/ijcai11-169
复制
发表时间：
2011-04
期刊：
影响因子：
--
通讯作者：
C. Lutz;R. Piro;F. Wolter
中科院分区：
文献类型：
--
作者：
C. Lutz;R. Piro;F. Wolter
我们刻画了描述逻辑Tbox的表达能力，既适用于ALC和ALCQIO等可表达的描述逻辑，也适用于轻量级的描述逻辑，如DL-Lite和EL。我们的刻画是相对于一阶逻辑的，基于广泛的语义概念，如互模拟、等模拟、不相交并和直积。我们通过对下列新的决策问题族的第一次研究来举例说明这些刻画的使用：给定一个用数字逻辑L表示的Tbox T，判定T是否可以等价地重写为L的片段L中的Tbox。
We characterize the expressive power of description logic (DL) TBoxes, both for expressive DLs such as ALC and ALCQIO and lightweight DLs such as DL-Lite and EL. Our characterizations are relative to first-order logic, based on a wide range of semantic notions such as bisimulation, equisimulation, disjoint union, and direct product. We exemplify the use of the characterizations by a first study of the following novel family of decision problems: given a TBox T formulated in a DL L, decide whether T can be equivalently rewritten as a TBox in the fragment L′ of L.