资源分类
》 资源 》论文》Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics

Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics

2019-11-12 | |  51 |   35 |   0
Abstract We study uniform interpolation and forgetting in the description logic ALC. Our main results are model-theoretic characterizations of uniform interpolants and their existence in terms of bisimulations, tight complexity bounds for deciding the existence of uniform interpolants, an approach to computing interpolants when they exist, and tight bounds on their size. We use a mix of modeltheoretic and automata-theoretic methods that, as a by-product, also provides characterizations of and decision procedures for conservative extensions.

上一篇：Description Logic TBoxes: Model-Theoretic Characterizations and Rewritability

下一篇：Existential Closures for Knowledge Compilation? Pierre Marquis

用户评价
全部评价

热门资源

  • 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...