99 search results - page 1 / 20 » Efficiently evaluating complex boolean expressions |
SIGMOD
2010
ACM
13 years 4 months ago
2010
ACM
The problem of efficiently evaluating a large collection of complex Boolean expressions
CDB
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. Constraint databases that can be described by boolean combinations of polynomial inequalities over the reals have received ample research attention. In particular, the ex...
CSMR
2004
IEEE
13 years 8 months ago
2004
IEEE
Automatic analysis of programs with preprocessing directives and conditional compilation is challenging. The difficulties range from parsing to program understanding. Symbolic eva...
TCS
2008
13 years 4 months ago
2008
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
CADE
2007
Springer
14 years 4 months ago
2007
Springer
Boolean Algebra with Presburger Arithmetic (BAPA) is a decidable logic that combines 1) Boolean algebra of sets of uninterpreted elements (BA) and 2) Presburger arithmetic (PA). BA...