The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries

Authors

• 1. Meghyn Bienvenu (Centre National de la Recherche Scientifique; University of Montpellier)
• 2. Stanislav Kikot (Birkbeck, University of London)
• 3. Roman Kontchakov (Birkbeck, University of London)
• 4. Vladimir V. Podolskii (National Research University Higher School of Economics; Steklov Mathematical Institute)
• 5. Vladislav Ryzhikov (Free University of Bolzano)
• 6. Michael Zakharyaschev (Birkbeck, University of London)

@inproceedings{bienvenu_pods17,
        address = {New York, NY, USA},
        series = {{PODS} '17},
        title = {{The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries}},
        url = {https://dl.acm.org/doi/10.1145/3034786.3034791},
        doi = {10.1145/3034786.3034791},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Bienvenu, Meghyn and Kikot, Stanislav and Kontchakov, Roman and Podolskii, Vladimir V. and Ryzhikov, Vladislav and Zakharyaschev, Michael},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Semantically Similar Papers