Boolean expression

Known as: Boolean, Boolean Expressions 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

1958-2017
0102019582017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
BE-Tree is a novel dynamic data structure designed to efficiently index Boolean expressions over a high-dimensional discrete… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Is this relevant?
2011
2011
BE-Tree is a novel dynamic tree data structure designed to efficiently index Boolean expressions over a high-dimensional discrete… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?
2010
2010
The problem of efficiently evaluating a large collection of complex Boolean expressions - beyond simple conjunctions and… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
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
This paper presents a new data structure called Boolean Expression Diagrams (BEDs) for representing and manipulating Boolean… (More)
  • figure 3
  • figure 1
  • figure 5
  • figure 4
  • figure 6
Is this relevant?
2001
2001
A new algorithm for rank order-based nonlinear lower-upper-middle (LUM) smoothers, setting out from the threshold decomposition… (More)
  • figure 1
  • figure 2
Is this relevant?
1997
1997
This paper presents a new data structure called Boolean Expression Diagrams (BEDs) for representing and manipulating Boolean… (More)
  • figure 3
  • figure 1
  • figure 5
  • figure 4
  • figure 6
Is this relevant?
1997
1997
Recently, there has been a lot of works on LSI design systems using Binary Decision Diagrams (BDDs), which are efficient… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1995
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)
  • figure 1
  • figure 3
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We study the computational feasibility of learning boolean expressions from examples. Our goals are to prove results and develop… (More)
  • figure 1
  • figure 2
Is this relevant?