- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Tractable query answering and rewriting under description logic constraints
Journal of Applied Logic 8 (2):186-209 (2010)
Abstract
This article has no associated abstract. (fix it)Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
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.
Modal definability of first-order formulas with free variables and query answering.Stanislav Kikot & Evgeny Zolin - 2013 - Journal of Applied Logic 11 (2):190-216.
Tractability and Intractability of Controlled Languages for Data Access.Camilo Thorne & Diego Calvanese - 2012 - Studia Logica 100 (4):787-813.
Paraconsistent logic and query answering in inconsistent databases.C. A. Middelburg - 2024 - Journal of Applied Non-Classical Logics 34 (1):133-154.
Data complexity of query answering in description logics.Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini & Riccardo Rosati - 2013 - Artificial Intelligence 195 (C):335-360.
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.
Equilibrium points of an AND–OR tree: Under constraints on probability.Toshio Suzuki & Yoshinao Niida - 2015 - Annals of Pure and Applied Logic 166 (11):1150-1164.
Termination of logic programs with imperfect information: applications and query procedure.C. V. Damásio, J. Medina & M. Ojeda-Aciego - 2007 - Journal of Applied Logic 5 (3):435-458.
Querying several conflicting databases.Laurence Cholvy & Christophe Garion - 2004 - Journal of Applied Non-Classical Logics 14 (3):295-327.
Analytics
Added to PP
2016-06-30
Downloads
15 (#950,671)
6 months
7 (#594,125)
2016-06-30
Downloads
15 (#950,671)
6 months
7 (#594,125)
Historical graph of downloads
Citations of this work
Data complexity of query answering in description logics.Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini & Riccardo Rosati - 2013 - Artificial Intelligence 195 (C):335-360.
Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies.Mark Kaminski, Yavor Nenov & Bernardo Cuenca Grau - 2016 - Artificial Intelligence 236 (C):90-118.
Towards more expressive ontology languages: The query answering problem.Andrea Cali`, Georg Gottlob & Andreas Pieris - 2012 - Artificial Intelligence 193 (C):87-128.
Polynomial rewritings from expressive Description Logics with closed predicates to variants of Datalog.Shqiponja Ahmetaj, Magdalena Ortiz & Mantas Šimkus - 2020 - Artificial Intelligence 280 (C):103220.
A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic EL.Carsten Lutz & Leif Sabellek - 2022 - Artificial Intelligence 308 (C):103709.
References found in this work
The Stable Model Semantics for Logic Programming.Melvin Fitting - 1992 - Journal of Symbolic Logic 57 (1):274-277.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-2nz2h uwo