Sciweavers

9 search results - page 1 / 2
» Taming the Infinite Chase: Query Answering under Expressive ...
Sort
View
DLOG
2008
13 years 6 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 6 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
EDBT
2008
ACM
137views Database» more  EDBT 2008»
14 years 4 months ago
Data exchange in the presence of arithmetic comparisons
Data exchange is the problem of transforming data structured under a schema (called source) into data structured under a different schema (called target). The emphasis of data exc...
Foto N. Afrati, Chen Li, Vassia Pavlaki
WIDM
2003
ACM
13 years 9 months ago
Answering imprecise database queries: a novel approach
A growing number of databases especially those published on the Web are becoming available to external users. Users of these databases are provided simple form-based query interfa...
Ullas Nambiar, Subbarao Kambhampati
AAAI
2008
13 years 5 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor