A Data Complexity and Rewritability Tetrachotomy of Ontology-Mediated Queries with a Covering Axiom-Reference-Cited by-同舟云学术

A Data Complexity and Rewritability Tetrachotomy of Ontology-Mediated Queries with a Covering Axiom

Published:2020-07 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning
language:
Short-container-title:

Author:

Gerasimova Olga¹,Kikot Stanislav²,Kurucz Agi³,Podolskii Vladimir⁴¹,Zakharyaschev Michael⁵

Affiliation:

1. National Research University Higher School of Economics, Moscow, Russia

2. School of Computing and Digital Media, London Metropolitan University, U.K.

3. Department of Informatics, King’s College London, U.K.

4. Steklov Mathematical Institute, Moscow, Russia

5. Department of Computer Science, Birkbeck, University of London, U.K.

Abstract

Aiming to understand the data complexity of answering conjunctive queries mediated by an axiom stating that a class is covered by the union of two other classes, we show that deciding their first-order rewritability is PSPACE-hard and obtain a number of sufficient conditions for membership in AC0, L, NL, and P. Our main result is a complete syntactic AC0/NL/P/CONP tetrachotomy of path queries under the assumption that the covering classes are disjoint.

Publisher

International Joint Conferences on Artificial Intelligence Organization

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Comparative Analysis of Logic Reasoning and Graph Neural Networks for Ontology-Mediated Query Answering With a Covering Axiom;IEEE Access;2023

2. Deciding Boundedness of Monadic Sirups;Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems;2021-06-20