资源分类
》 资源 》论文》Query-Based Entailment and Inseparability for ALC Ontologies

Query-Based Entailment and Inseparability for ALC Ontologies

2019-11-22 | |  60 |   49 |   0
Abstract We investigate the problem whether two ALC knowledge bases are indistinguishable by queries over a given vocabulary. We give model-theoretic criteria and prove that this problem is undecidable for conjunctive queries (CQs) but decidable in 2E XP T IME for unions of rooted CQs. We also consider the problem whether two ALC TBoxes give the same answers to any query in a given vocabulary over all ABoxes, and show that for CQs this problem is undecidable, too, but becomes decidable and 2E XP T IME-complete in Horn-ALC, and even E XP T IME-complete in Horn-ALC when restricted to (unions of) rooted CQs.

上一篇：Extending the Harper Identity to Iterated Belief Change

下一篇：Knowledge Compilation Meets Communication Complexity

用户评价
全部评价

热门资源

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

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...