Checking the data complexity of ontology-mediated queries: a case study with non-uniform CSPs and Polyanna

DOI10.1007/978-3-030-22102-7_15zbMath1444.68067OpenAlexW2954844176MaRDI QIDQ2185474

Stanislav Kikot, Olga Gerasimova, Michael Zakharyashchev

Publication date: 4 June 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-22102-7_15

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Logic in artificial intelligence (68T27) Knowledge representation (68T30)

Related Items (1)

A tetrachotomy of ontology-mediated queries with a covering axiom

Uses Software

• Datalog
• Ontop
• MASTRO
• Polyanna

This page was built for publication: Checking the data complexity of ontology-mediated queries: a case study with non-uniform CSPs and Polyanna