资源分类
》 资源 》论文》Description Logic TBoxes: Model-Theoretic Characterizations and Rewritability

Description Logic TBoxes: Model-Theoretic Characterizations and Rewritability

2019-11-12 | |  45 |   37 |   0
Abstract 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 ?rst-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 ?rst 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.

上一篇：On the Progression of Knowledge in the Situation Calculus

下一篇：Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...