Query inseparability for ALC ontologies

, , , &
Artificial Intelligence 272 (C):1-51 (2019)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2018.09.003

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 106,894

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

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.
Model-theoretic inseparability and modularity of description logic ontologies.Boris Konev, Carsten Lutz, Dirk Walther & Frank Wolter - 2013 - Artificial Intelligence 203 (C):66-103.
A Modal Supervaluation Description Logic For Characterization Of Vague Concepts: Its Semantics And A Tableau Algorithm For It.Lei Liu & Lin Chen - 2006 - Logic Journal of the IGPL 14 (6):873-888.
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, Logics in Artificial Intelligence. Springer. pp. 202--214.
Modal logic, Alexander Chagrov and Michael Zakharyaschev. [REVIEW]Valentin Goranko - 1999 - Journal of Logic, Language and Information 8 (2):255-258.
EXPtime tableaux for ALC.Francesco M. Donini & Fabio Massacci - 2000 - Artificial Intelligence 124 (1):87-138.
Author's query.NancyJ Kanter - 1980 - Artificial Intelligence 14 (3):315.
Controlled query evaluation in description logics through consistent query answering.Gianluca Cima, Domenico Lembo, Riccardo Rosati & Domenico Fabio Savo - 2024 - Artificial Intelligence 334 (C):104176.
Automated query learning with Wikipedia and genetic programming.Pekka Malo, Pyry Siitari & Ankur Sinha - 2013 - Artificial Intelligence 194 (C):86-110.
Optimal query complexity bounds for finding graphs.Sung-Soon Choi & Jeong Han Kim - 2010 - Artificial Intelligence 174 (9-10):551-569.

Analytics

Added to PP
2020-12-22

Downloads
26 (#954,651)

6 months
6 (#745,008)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A Correspondence between Temporal Description Logics.Alessandro Artale & Carsten Lutz - 2004 - Journal of Applied Non-Classical Logics 14 (1-2):209-233.

Add more citations

References found in this work

View all 7 references / Add more references