2526 search results - page 21 / 506 » A New Algorithm for Answer Set Computation |
CSC
2008
13 years 10 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
SIGMOD
1999
ACM
14 years 1 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...
ICDT
2003
ACM
14 years 2 months ago
2003
ACM
All the languages for querying semistructured data and the web use as an integral part regular expressions. Based on practical observations, finding the paths that satisfy those r...
IPL
2010
13 years 7 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
DEXAW
2006
IEEE
13 years 11 months ago
2006
IEEE
A database D may be inconsistent wrt a given set IC of integrity constraints. Consistent Query Answering is the problem of computing from D the answers to a query that are consist...