Sciweavers

101 search results - page 6 / 21
» Consistent query answering under inclusion dependencies
Sort
View
LPNMR
2009
Springer
14 years 4 months ago
Complexity of the Stable Model Semantics for Queries on Incomplete Databases
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
Jos de Bruijn, Stijn Heymans
DLOG
2011
13 years 1 months ago
Dependencies to Optimize Ontology Based Data Access
Query answering in Ontology Based Data Access (OBDA) exploits the knowledge of an ontology’s TBox to deal with incompleteness of the ABox (or data source). Current query-answerin...
Mariano Rodriguez-Muro, Diego Calvanese
EDBTW
2004
Springer
14 years 3 months ago
Query Answering in Peer-to-Peer Data Exchange Systems
The problem of answering queries posed to a peer who is a member of a peer-to-peerdataexchangesystemisstudied.Theanswershavetobeconsistentwrt to both the local semantic constraints...
Leopoldo E. Bertossi, Loreto Bravo
ICAIL
1997
ACM
14 years 2 months ago
Automated Drafting of Self-Explaining Documents
The capacity for self-explanation can makecomputer-drafted documents more credible, assist in the retrieval and adaptation of archival documents, and permit comparison of document...
Karl Branting, James C. Lester, Charles B. Callawa...
PODS
1998
ACM
116views Database» more  PODS 1998»
14 years 2 months ago
Complexity of Answering Queries Using Materialized Views
We study the complexity of the problem of answering queries using materialized views. This problem has attracted a lot of attention recently because of its relevance in data integ...
Serge Abiteboul, Oliver M. Duschka