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...
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...
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...
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...
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...