In computer science, a Boolean expression is an expression in a programming language that produces a Boolean value when evaluated, i.e. one of trueâ€¦Â (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- Mohammad Sadoghi, Hans-Arno Jacobsen
- ACM Trans. Database Syst.
- 2013

BE-Tree is a novel dynamic data structure designed to efficiently index Boolean expressions over a high-dimensional discreteâ€¦Â (More)

Is this relevant?

2011

2011

- Mohammad Sadoghi, Hans-Arno Jacobsen
- SIGMOD Conference
- 2011

BE-Tree is a novel dynamic tree data structure designed to efficiently index Boolean expressions over a high-dimensional discreteâ€¦Â (More)

Is this relevant?

2010

2010

- Marcus Fontoura, Suhas Sadanandan, +4 authors Jason Y. Zien
- SIGMOD Conference
- 2010

The problem of efficiently evaluating a large collection of complex Boolean expressions - beyond simple conjunctions andâ€¦Â (More)

Is this relevant?

2009

2009

- Steven Euijong Whang, Chad Brower, +4 authors Hector Garcia-Molina
- PVLDB
- 2009

We consider the problem of efficiently indexing Disjunctive Normal Form (DNF) and Conjunctive Normal Form (CNF) Booleanâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Henrik Reif Andersen, Henrik Hulgaard
- Inf. Comput.
- 2002

This paper presents a new data structure called Boolean Expression Diagrams (BEDs) for representing and manipulating Booleanâ€¦Â (More)

Is this relevant?

2001

2001

- Rebecca Jane Lukac, Stanislav Marchevsky
- IEEE Signal Processing Letters
- 2001

A new algorithm for rank order-based nonlinear lower-upper-middle (LUM) smoothers, setting out from the threshold decompositionâ€¦Â (More)

Is this relevant?

1997

1997

- Henrik Reif Andersen, Henrik Hulgaard
- LICS
- 1997

This paper presents a new data structure called Boolean Expression Diagrams (BEDs) for representing and manipulating Booleanâ€¦Â (More)

Is this relevant?

1997

1997

- Shin-ichi Minato, Fabio Somenzi
- Formal Methods in System Design
- 1997

Recently, there has been a lot of works on LSI design systems using Binary Decision Diagrams (BDDs), which are efficientâ€¦Â (More)

Is this relevant?

1995

1995

- Amit M. Paradkar, Kuo-Chung Tai
- ISSRE
- 1995

In this paper we propose a new strategy f o r generating test cases f o r Boolean expressions. In the past, we reported the BORâ€¦Â (More)

Is this relevant?

Highly Cited

1987

Highly Cited

1987

- Michael Kearns, Ming Li, Leonard Pitt, Leslie G. Valiant
- STOC
- 1987

We study the computational feasibility of learning boolean expressions from examples. Our goals are to prove results and developâ€¦Â (More)

Is this relevant?