Results 1  10
of
1,841
Boolean Expression Diagrams
, 1997
"... This paper presents a new data structure called Boolean Expression Diagrams (BEDs) for representing and manipulating Boolean functions. BEDs are a generalization of Binary Decision Diagrams (BDDs) which can represent any Boolean circuit in linear space and still maintain many of the desirable proper ..."
Abstract

Cited by 54 (5 self)
 Add to MetaCart
This paper presents a new data structure called Boolean Expression Diagrams (BEDs) for representing and manipulating Boolean functions. BEDs are a generalization of Binary Decision Diagrams (BDDs) which can represent any Boolean circuit in linear space and still maintain many of the desirable
Indexing boolean expressions.
 PVLDB,
, 2009
"... ABSTRACT We consider the problem of efficiently indexing Disjunctive Normal Form (DNF) and Conjunctive Normal Form (CNF) Boolean expressions over a highdimensional multivalued attribute space. The goal is to rapidly find the set of Boolean expressions that evaluate to true for a given assignment ..."
Abstract

Cited by 22 (3 self)
 Add to MetaCart
ABSTRACT We consider the problem of efficiently indexing Disjunctive Normal Form (DNF) and Conjunctive Normal Form (CNF) Boolean expressions over a highdimensional multivalued attribute space. The goal is to rapidly find the set of Boolean expressions that evaluate to true for a given assignment
Efficient Evaluation Of Boolean Expressions
"... this paper we transfer ideas from bayesian network theory to present a generalpurpose algorithm for evaluating boolean expressions. The algorithm is a special case of that due to Lauritzen and Spiegelhalter for propagating evidence through bayesian networks. The algorithm is efficient for a large c ..."
Abstract
 Add to MetaCart
this paper we transfer ideas from bayesian network theory to present a generalpurpose algorithm for evaluating boolean expressions. The algorithm is a special case of that due to Lauritzen and Spiegelhalter for propagating evidence through bayesian networks. The algorithm is efficient for a large
Random Boolean expressions
"... We examine how we can define several probability distributions on the set of Boolean functions on a fixed number of variables, starting from a representation of Boolean expressions by trees. Analytic tools give us a systematic way to prove the existence of probability distributions, the main challen ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We examine how we can define several probability distributions on the set of Boolean functions on a fixed number of variables, starting from a representation of Boolean expressions by trees. Analytic tools give us a systematic way to prove the existence of probability distributions, the main
Computing Boolean Expressions with OBDDs
, 1993
"... We present a method to compute the bdd for an arbitrary Boolean expression, where the operands are themselves bdds. Such expressions are usually computed by the successive application of binary operators. However, cases exist where this method performs wasteful intermediate computations and creates ..."
Abstract
 Add to MetaCart
We present a method to compute the bdd for an arbitrary Boolean expression, where the operands are themselves bdds. Such expressions are usually computed by the successive application of binary operators. However, cases exist where this method performs wasteful intermediate computations and creates
Optimizing boolean expressions in object bases
 IN PROC. OF THE CONF. ON VERY LARGE DATA BASES (VLDB
, 1992
"... In this paper we address the problem of optimizing the evaluation of boolean expressions in the context of objectoriented data modelling. We develop a new heuristic for optimizing the evaluation sequence of ..."
Abstract

Cited by 14 (8 self)
 Add to MetaCart
In this paper we address the problem of optimizing the evaluation of boolean expressions in the context of objectoriented data modelling. We develop a new heuristic for optimizing the evaluation sequence of
Efficiently evaluating complex boolean expressions
 In SIGMOD
, 2010
"... The problem of efficiently evaluating a large collection of complex Boolean expressions – beyond simple conjunctions and Disjunctive/Conjunctive Normal Forms (DNF/CNF) – occurs in many emerging online advertising applications such as advertising exchanges and automatic targeting. The simple solution ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
The problem of efficiently evaluating a large collection of complex Boolean expressions – beyond simple conjunctions and Disjunctive/Conjunctive Normal Forms (DNF/CNF) – occurs in many emerging online advertising applications such as advertising exchanges and automatic targeting. The simple
Fault Class Prioritization in Boolean Expressions
"... A recent study has classified faults in Boolean expressions into ten classes and has proved that there are five key fault classes, namely CCF, CDF, ORF, ENF and ASF, such that if a test suite can kill all faulty versions of these five core fault classes, if can kill all faulty versions of all fault ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A recent study has classified faults in Boolean expressions into ten classes and has proved that there are five key fault classes, namely CCF, CDF, ORF, ENF and ASF, such that if a test suite can kill all faulty versions of these five core fault classes, if can kill all faulty versions of all fault
Dealing with Constraints in Boolean Expression Testing
"... Abstract—When testing a Boolean expression, one should consider also the constraints among the variables contained in it. Constraints model interdependence among the conditions in the expressions. Only tests that satisfy the constraints. i.e. valid tests, are really useful and can be applied to test ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract—When testing a Boolean expression, one should consider also the constraints among the variables contained in it. Constraints model interdependence among the conditions in the expressions. Only tests that satisfy the constraints. i.e. valid tests, are really useful and can be applied
The Unison Algorithm: Fast Evaluation of Boolean Expressions
, 1992
"... We present a Unison algorithm to evaluate Boolean expressions. This novel algorithm, based on the total differential of a Boolean function, enables fast evaluation of Boolean expressions in software. Any combination of Boolean operations can be packed into the bits of one computer word and evaluated ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
We present a Unison algorithm to evaluate Boolean expressions. This novel algorithm, based on the total differential of a Boolean function, enables fast evaluation of Boolean expressions in software. Any combination of Boolean operations can be packed into the bits of one computer word
Results 1  10
of
1,841