357 search results - page 13 / 72 » An Algebraic Approach to the Complexity of Generalized Conju... |
AAAI
2012
11 years 10 months ago
2012
We tackle the problem of defining a well-founded semantics (WFS) for Datalog rules with existentially quantified variables in their heads and negations in their bodies. In partic...
ADBIS
2004
Springer
14 years 1 months ago
2004
Springer
Repairing a database means making the database consistent by applying changes that are as small as possible. Nearly all approaches to repairing have assumed deletions and insertion...
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
Most real-world database applications contain a substantial portion of time-referenced, or temporal, data. Recent advances in temporal query languages show that such database appl...
EDBT
2006
ACM
14 years 8 months ago
2006
ACM
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
ECCC
2010
13 years 6 months ago
2010
In this paper we study polynomial identity testing of sums of k read-once algebraic branching programs (Σk-RO-ABPs), generalizing the work of Shpilka and Volkovich [1, 2], who co...