99 search results - page 8 / 20 » Efficiently evaluating complex boolean expressions |
ICDE
1995
IEEE
14 years 9 months ago
1995
IEEE
?In a fuzzy relational database where a relation is a fuzzy set of tuples and ill-known data are represented by possibility distributions, nested fuzzy queries can be expressed in ...
AAAI
2010
13 years 10 months ago
2010
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
STOC
2010
ACM
14 years 5 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
ACNS
2006
Springer
14 years 4 days ago
2006
Springer
Abstract. Membership queries are basic predicate operations that apply to datasets. Quantifications of such queries express global properties between datasets, including subset inc...
SSDBM
1999
IEEE
14 years 20 days ago
1999
IEEE
Large scale data analysis and mining activities, such as identifying interesting trends, making unusual patterns to stand out and verifying hypotheses, require sophisticated infor...