The implication problem for functional and inclusion dependencies
Information and Control
Recurring dominoes: making the highly undecidable highly understandable
Selected papers of the international conference on "foundations of computation theory" on Topics in the theory of computation
On conjunctive queries containing inequalities
Journal of the ACM (JACM)
Handbook of theoretical computer science (vol. B)
On the equivalence of recursive and nonrecursive datalog programs
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Containment and minimization of positive conjunctive queries in OODB's
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Constraint checking with partial information
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Boosting the correspondence between description logics and propositional dynamic logics
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Data model and query evaluation in global information systems
Journal of Intelligent Information Systems - Special issue: networked information discovery and retrieval
Containment of conjunctive queries: beyond relations as sets
ACM Transactions on Database Systems (TODS)
Conjunctive query containment with respect to views and constraints
Information Processing Letters
Deciding containment for queries with complex objects (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Managing semantic heterogeneity in databases: a theoretical prospective
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the decidability of query containment under constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of answering queries using materialized views
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
{\cal A}{\cal L}-log: Integrating Datalog and Description Logics
Journal of Intelligent Information Systems
Logical approaches to incomplete information: a survey
Logics for databases and information systems
Efficient optimization of a class of relational expressions
ACM Transactions on Database Systems (TODS)
Equivalences Among Relational Expressions with the Union and Difference Operators
Journal of the ACM (JACM)
Modal logic
Data integration: a theoretical perspective
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Structured Objects: Modeling and Reasoning
DOOD '95 Proceedings of the Fourth International Conference on Deductive and Object-Oriented Databases
Information Integration Using Logical Views
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Conjunctive Query Containment Revisited
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Decidable Containment of Recursive Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Containment for XPath Fragments under DTD Constraints
ICDT '03 Proceedings of the 9th International Conference on Database Theory
View-Based Query Answering and Query Containment over Semistructured Data
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Reasoning in expressive description logics
Handbook of automated reasoning
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
The description logic handbook
Conceptual modeling with description logics
The description logic handbook
On the decidability of containment of recursive datalog queries - preliminary report
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
What's in an aggregate: foundations for description logics with tuples and sets
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Identification constraints and functional dependencies in description logics
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Aggregate queries over ontologies
Proceedings of the 2nd international workshop on Ontologies and information systems for the semantic web
Conjunctive Query Answering over an f-ALC Knowledge Base
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
Effective query rewriting with ontologies over DBoxes
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
An intelligent query processing for distributed ontologies
Journal of Systems and Software
Usage of the Jess Engine, Rules and Ontology to Query a Relational Database
RuleML '09 Proceedings of the 2009 International Symposium on Rule Interchange and Applications
Semantic query optimization in the presence of types
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient multiple assignment to database tables
AIKED'10 Proceedings of the 9th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
Rethinking database updates using a multiple assignment-based approach
WSEAS Transactions on Computers
Theory and Practice of Logic Programming
Inductive logic programming in databases: From datalog to $\mathcal{dl}+log}^{\neg\vee}$
Theory and Practice of Logic Programming
Specification of history based constraints for access control in conceptual level
ICISS'10 Proceedings of the 6th international conference on Information systems security
Conjunctive query answering in the description logic SH using knots
Journal of Computer and System Sciences
SPARQL query containment under RDFS entailment regime
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Data complexity of query answering in description logics
Artificial Intelligence
Semantic query optimization in the presence of types
Journal of Computer and System Sciences
Description logic knowledge and action bases
Journal of Artificial Intelligence Research
Verification and synthesis in description logic based dynamic systems
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
Hi-index | 0.00 |
Query containment and query answering are two important computational tasks in databases. While query answering amounts to computing the result of a query over a database, query containment is the problem of checking whether, for every database, the result of one query is a subset of the result of another query. In this article, we deal with unions of conjunctive queries, and we address query containment and query answering under description logic constraints. Every such constraint is essentially an inclusion dependency between concepts and relations, and their expressive power is due to the possibility of using complex expressions in the specification of the dependencies, for example, intersection and difference of relations, special forms of quantification, regular expressions over binary relations. These types of constraints capture a great variety of data models, including the relational, the entity-relationship, and the object-oriented model, all extended with various forms of constraints. They also capture the basic features of the ontology languages used in the context of the Semantic Web. We present the following results on both query containment and query answering. We provide a method for query containment under description logic constraints, thus showing that the problem is decidable, and analyze its computational complexity. We prove that query containment is undecidable in the case where we allow inequalities in the right-hand-side query, even for very simple constraints and queries. We show that query answering under description logic constraints can be reduced to query containment, and illustrate how such a reduction provides upper-bound results with respect to both combined and data complexity.