Sciweavers

96 search results - page 1 / 20
» Complexity of the Stable Model Semantics for Queries on Inco...
Sort
View
LPNMR
2009
Springer
13 years 11 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
PODS
1999
ACM
160views Database» more  PODS 1999»
13 years 8 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
ICDT
2007
ACM
126views Database» more  ICDT 2007»
13 years 10 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
ICDT
2012
ACM
293views Database» more  ICDT 2012»
11 years 7 months ago
On the complexity of query answering over incomplete XML documents
Previous studies of incomplete XML documents have identified three main sources of incompleteness – in structural information, data values, and labeling – and addressed data ...
Amélie Gheerbrant, Leonid Libkin, Tony Tan
DEDUCTIVE
1996
105views Database» more  DEDUCTIVE 1996»
13 years 5 months ago
Stable Semantics of Temporal Deductive Databases
We de ne a preferential semantics based on stable generated models for a very general class of temporal deductive databases. We allow two kinds of temporal information to be repre...
Heinrich Herre, Gerd Wagner