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: 91,475

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

Tractability and Intractability of Controlled Languages for Data Access.Camilo Thorne & Diego Calvanese - 2012 - Studia Logica 100 (4):787-813.
Querying several conflicting databases.Laurence Cholvy & Christophe Garion - 2004 - Journal of Applied Non-Classical Logics 14 (3):295-327.
Adding clauses to poor man's logic (without increasing the complexity).Peter Jonsson - 2005 - Journal of Applied Non-Classical Logics 15 (3):341-357.
A Formal Semantics for Concept Understanding Relying on Description Logics.Farshad Badie - 2017 - In Proceedings of the 9th International Conference on Agents and Artificial Intelligence. pp. 42-52.
Second-order reasoning in description logics.Andrzej Szalas - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):517-530.
An overview of tableau algorithms for description logics.Franz Baader & Ulrike Sattler - 2001 - Studia Logica 69 (1):5-40.
Logical foundations and complexity of 4QL, a query language with unrestricted negation.Jan Maluszyński & Andrzej Szalas - 2011 - Journal of Applied Non-Classical Logics 21 (2):211-232.
Tractable query answering and rewriting under description logic constraints.Héctor Pérez-Urbina, Boris Motik & Ian Horrocks - 2010 - Journal of Applied Logic 8 (2):186-209.
Problems of equivalence, categoricity of axioms and states description in databases.Tatjana L. Plotkin, Sarit Kraus & Boris I. Plotkin - 1998 - Studia Logica 61 (3):347-366.
A Correspondence between Temporal Description Logics.Alessandro Artale & Carsten Lutz - 2004 - Journal of Applied Non-Classical Logics 14 (1-2):209-233.
Effective Search Problems.Martin Kummer & Frank Stephan - 1994 - Mathematical Logic Quarterly 40 (2):224-236.
A Description Logic of Typicality for Conceptual Combination.Antonio Lieto & Gian Luca Pozzato - 2018 - In Proceedings of ISMIS 18. Springer.
Lewis Dichotomies in Many-Valued Logics.Simone Bova - 2012 - Studia Logica 100 (6):1271-1290.
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.
Complexity of admissible rules.Emil Jeřábek - 2007 - Archive for Mathematical Logic 46 (2):73-92.

Analytics

Added to PP
2020-12-22

Downloads
13 (#1,027,298)

6 months
9 (#299,476)

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.
A false sense of security.Piero A. Bonatti - 2022 - Artificial Intelligence 310 (C):103741.

View all 6 citations / Add more citations

References found in this work

Add more references