ICLP
2011
Springer
12 years 8 months ago
2011
Springer
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of const...
IJKDB
2010
13 years 1 months ago
2010
Regulatory network analysis and other bioinformatics tasks require the ability to induce and represent arbitrary boolean expressions from data sources. We introduce a novel framew...
SIGMOD
2010
ACM
13 years 4 months ago
2010
ACM
The problem of efficiently evaluating a large collection of complex Boolean expressions
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...
VL
2000
IEEE
13 years 9 months ago
2000
IEEE
The accurate formulation of boolean expressions is a notorious problem in programming languages and database query tools. This paper studies the ways that untrained users naturall...
DNA
2005
Springer
13 years 10 months ago
2005
Springer
An algorithm that could be implemented at a molecular level for solving the satisfiability of Boolean expressions is presented. This algorithm, based on properties of specific se...
KDD
2006
ACM
14 years 5 months ago
2006
ACM
We introduce a novel framework (BLOSOM) for mining (frequent) boolean expressions over binary-valued datasets. We organize the space of boolean expressions into four categories: p...