A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic EL

&
Artificial Intelligence 308 (C):103709 (2022)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2022.103709

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

First-order rewritability of ontology-mediated queries in linear temporal logic.Alessandro Artale, Roman Kontchakov, Alisa Kovtunova, Vladislav Ryzhikov, Frank Wolter & Michael Zakharyaschev - 2021 - Artificial Intelligence 299 (C):103536.
The complexity of classification problems for models of arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.
On the classification of vertex-transitive structures.John Clemens, Samuel Coskey & Stephanie Potter - 2019 - Archive for Mathematical Logic 58 (5-6):565-574.
Guarded Ontology-Mediated Queries.Pablo Barceló, Gerald Berger, Georg Gottlob & Andreas Pieris - 2021 - In Judit Madarász & Gergely Székely (eds.), Hajnal Andréka and István Németi on Unity of Science: From Computing to Relativity Theory Through Algebraic Logic. Springer. pp. 27-52.
Adding clauses to poor man's logic (without increasing the complexity).Peter Jonsson - 2005 - Journal of Applied Non-Classical Logics 15 (3):341-357.
Complexity of logic-based argumentation in Post's framework.Nadia Creignou, Johannes Schmidt, Michael Thomas & Stefan Woltran - 2011 - Argument and Computation 2 (2-3):107 - 129.
Tractability and Intractability of Controlled Languages for Data Access.Camilo Thorne & Diego Calvanese - 2012 - Studia Logica 100 (4):787-813.
A Description Logic of Typicality for Conceptual Combination.Antonio Lieto & Gian Luca Pozzato - 2018 - In Proceedings of ISMIS 18. Springer.
On the expressibility and the computability of untyped queries.Jose Turull Torres - 2001 - Annals of Pure and Applied Logic 108 (1-3):345-371.
On the expressibility and the computability of untyped queries.Jose Maria Turull Torres - 2001 - Annals of Pure and Applied Logic 108 (1-3):345-371.
Deciding Unifiability and Computing Local Unifiers in the Description Logic $mathcal{E!L}$ without Top Constructor.Franz Baader, Nguyen Thanh Binh, Stefan Borgwardt & Barbara Morawska - 2016 - Notre Dame Journal of Formal Logic 57 (4):443-476.
Image characterization and classification by physical complexity.Hector Zenil, Jean-Paul Delahaye & Cédric Gaucherel - 2012 - Complexity 17 (3):26-42.
A classification of the cofinal structures of precompacta.Aviv Eshed, M. Vicenta Ferrer, Salvador Hernández, Piotr Szewczak & Boaz Tsaban - 2020 - Annals of Pure and Applied Logic 171 (8):102810.
A new classification of catastrophes based on “Complexity Criteria”.Damienne Provitolo - 2009 - In Ma Aziz-Alaoui & C. Bertelle (eds.), From System Complexity to Emergent Properties. Springer. pp. 179--194.
Challenges to Causal Classification in Psychiatry.Richard Link - unknown

Analytics

Added to PP
2022-04-08

Downloads
6 (#1,389,828)

6 months
3 (#902,269)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references