Sciweavers

514 search results - page 13 / 103
» Answer Sets for Consistent Query Answering in Inconsistent D...
Sort
View
LPNMR
2009
Springer
15 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
ESWS
2010
Springer
14 years 11 months ago
Dealing with Inconsistency When Combining Ontologies and Rules Using DL-Programs
Abstract. Description Logic Programs (DL-programs) have been introduced to combine ontological and rule-based reasoning in the context of the Semantic Web. A DL-program loosely com...
Jörg Pührer, Stijn Heymans, Thomas Eiter
LREC
2010
161views Education» more  LREC 2010»
14 years 11 months ago
Providing Multilingual, Multimodal Answers to Lexical Database Queries
Language users are increasingly turning to electronic resources to address their lexical information needs, due to their convenience and their ability to simultaneously capture di...
Gerard de Melo, Gerhard Weikum
VLDB
2006
ACM
147views Database» more  VLDB 2006»
15 years 9 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
IS
2008
14 years 9 months ago
The complexity and approximation of fixing numerical attributes in databases under integrity constraints
Consistent query answering is the problem of characterizing and computing the semantically correct answers to queries from a database that may not satisfy certain integrity constr...
Leopoldo E. Bertossi, Loreto Bravo, Enrico Francon...