Sciweavers

ICLP
2011
Springer
12 years 7 months ago
Constraints in Non-Boolean Contexts
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...
Leslie De Koninck, Sebastian Brand, Peter J. Stuck...
IJKDB
2010
141views more  IJKDB 2010»
13 years 1 months ago
Mining Frequent Boolean Expressions: Application to Gene Expression and Regulatory Modeling
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...
Mohammed Javeed Zaki, Naren Ramakrishnan, Lizhuang...
SIGMOD
2010
ACM
164views Database» more  SIGMOD 2010»
13 years 4 months ago
Efficiently evaluating complex boolean expressions
The problem of efficiently evaluating a large collection of complex Boolean expressions
Marcus Fontoura, Suhas Sadanandan, Jayavel Shanmug...
CSMR
2004
IEEE
13 years 8 months ago
Rewrite Systems for Symbolic Evaluation of C-like Preprocessing
Automatic analysis of programs with preprocessing directives and conditional compilation is challenging. The difficulties range from parsing to program understanding. Symbolic eva...
Mario Latendresse
VL
2000
IEEE
140views Visual Languages» more  VL 2000»
13 years 8 months ago
Tabular and Textual Methods for Selecting Objects from a Group
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...
John F. Pane, Brad A. Myers
DNA
2005
Springer
130views Bioinformatics» more  DNA 2005»
13 years 9 months ago
An Algorithm for SAT Without an Extraction Phase
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...
Pierluigi Frisco, Christiaan Henkel, Szabolcs Teng...
KDD
2006
ACM
173views Data Mining» more  KDD 2006»
14 years 4 months ago
BLOSOM: a framework for mining arbitrary boolean expressions
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...
Lizhuang Zhao, Mohammed J. Zaki, Naren Ramakrishna...