Sciweavers

517 search results - page 24 / 104
» Computing Fuzzy Answer Sets Using dlvhex
Sort
View
ICTAI
2006
IEEE
15 years 3 months ago
Computing Horn Strong Backdoor Sets Thanks to Local Search
In this paper a new approach for computing Strong Backdoor sets of boolean formula in conjunctive normal form (CNF) is proposed. It makes an original use of local search technique...
Lionel Paris, Richard Ostrowski, Pierre Siegel, La...
VLDB
2006
ACM
147views Database» more  VLDB 2006»
15 years 10 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
96
Voted
ICCI
1993
15 years 1 months ago
Interval-Set Algebra for Qualitative Knowledge Representation
The notion of interval sets is introduced as a new kind of sets, represented by a pair of sets, namely, the lower and upper bounds. The interval-set algebra may be regarded as a c...
Y. Y. Yao
ICCS
2009
Springer
15 years 4 months ago
Distinguishing Answers in Conceptual Graph Knowledge Bases
Abstract. In knowledge bases, the open world assumption and the ability to express variables may lead to an answer redundancy problem. This problem occurs when the returned answers...
Nicolas Moreau, Michel Leclère, Madalina Cr...
SIGMOD
1999
ACM
181views Database» more  SIGMOD 1999»
15 years 1 months ago
Approximate Computation of Multidimensional Aggregates of Sparse Data Using Wavelets
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...
Jeffrey Scott Vitter, Min Wang