96 search results - page 2 / 20 » Complexity of the Stable Model Semantics for Queries on Inco... |
PODS
1995
ACM
13 years 8 months ago
1995
ACM
Databases are often incomplete because of the presence of disjunctive information, due to con icts, partial knowledge and other reasons. Queries against such databases often ask q...
ASP
2001
Springer
13 years 9 months ago
2001
Springer
Default Logic and Logic Programming with stable model semantics are recognized as powerful frameworks for incomplete information representation. Their expressive power are suitabl...
JAPLL
2010
13 years 3 months ago
2010
Answering queries over an incomplete database w.r.t. a set of constraints is an important computational task with applications in fields as diverse as information integration and ...
PODS
2007
ACM
14 years 5 months ago
2007
ACM
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms...
VLDB
2007
ACM
14 years 5 months ago
2007
ACM
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...