Sciweavers

1588 search results - page 6 / 318
» Consistent query answering in databases
Sort
View
LPNMR
2009
Springer
14 years 1 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
AAAI
2007
13 years 9 months ago
Approximate Query Answering in Locally Closed Databases
The Closed-World Assumption (CWA) on databases expresses that an atom not in the database is false. A more appropriate assumption for databases that are sound but partially incomp...
Alvaro Cortés-Calabuig, Marc Denecker, Ofer...
EDBTW
2006
Springer
13 years 11 months ago
Preference-Driven Querying of Inconsistent Relational Databases
One of the goals of cleaning an inconsistent database is to remove conflicts between tuples. Typically, the user specifies how the conflicts should be resolved. Sometimes this spec...
Slawomir Staworko, Jan Chomicki, Jerzy Marcinkowsk...
CL
2000
Springer
13 years 11 months ago
Querying Inconsistent Databases: Algorithms and Implementation
In this paper, an algorithm for obtaining consistent answers to queries posed to inconsistent relational databases is presented. The algorith is proven to be sound, terminating and...
Alexander Celle, Leopoldo E. Bertossi
LREC
2010
161views Education» more  LREC 2010»
13 years 8 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