Data complexity of query answering in description logics

, , , &
Artificial Intelligence 195 (C):335-360 (2013)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2012.10.003

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

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

Understanding the complexity of axiom pinpointing in lightweight description logics.Rafael Peñaloza & Barış Sertkaya - 2017 - Artificial Intelligence 250 (C):80-104.
Query Answering in Description Logics: The Knots Approach.Thomas Eiter, Carsten Lutz, Magdalena Ortiz & Mantas Šimkus - 2019 - In Rosalie Iemhoff, Michael Moortgat & Ruy de Queiroz (eds.), Logic, Language, Information, and Computation. Folli Publications on Logic, Language and Information. pp. 26–36.
Inconsistency-tolerant query answering for existential rules.Thomas Lukasiewicz, Enrico Malizia, Maria Vanina Martinez, Cristian Molinaro, Andreas Pieris & Gerardo I. Simari - 2022 - Artificial Intelligence 307 (C):103685.
Towards more expressive ontology languages: The query answering problem.Andrea Cali`, Georg Gottlob & Andreas Pieris - 2012 - Artificial Intelligence 193 (C):87-128.
Preference-based inconsistency-tolerant query answering under existential rules.Marco Calautti, Sergio Greco, Cristian Molinaro & Irina Trubitsyna - 2022 - Artificial Intelligence 312 (C):103772.
Exact query reformulation with first-order ontologies and databases.Enrico Franconi, Volha Kerhet & Nhung Ngo - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 202--214.
Optimal query complexity bounds for finding graphs.Sung-Soon Choi & Jeong Han Kim - 2010 - Artificial Intelligence 174 (9-10):551-569.
Games for query inseparability of description logic knowledge bases.Elena Botoeva, Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter & Michael Zakharyaschev - 2016 - Artificial Intelligence 234 (C):78-119.
On the query complexity of selecting minimal sets for monotone predicates.Mikoláš Janota & Joao Marques-Silva - 2016 - Artificial Intelligence 233 (C):73-83.
Modal logics, description logics and arithmetic reasoning.Hans Jürgen Ohlbach & Jana Koehler - 1999 - Artificial Intelligence 109 (1-2):1-31.

Analytics

Added to PP
2020-12-22

Downloads
16 (#903,770)

6 months
10 (#383,927)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Tractable approximate deduction for OWL.Jeff Z. Pan, Yuan Ren & Yuting Zhao - 2016 - Artificial Intelligence 235 (C):95-155.

View all 6 citations / Add more citations

References found in this work

Add more references