Boolean logic

(redirected from Boolean circuit)
Also found in: Dictionary, Thesaurus, Encyclopedia, Wikipedia.

Boolean logic

 [boo´le-an]
an algebra that permits operations on sets of elements; it is used in online literature searches. The principal Boolean operators are AND (intersection), OR (union), and NOT (difference).
Mentioned in ?
References in periodicals archive ?
Key words: Computation Theory, Relational Databases, Boolean Circuits, Query
86]), we show how a query to a given relational database, expressed through a formula of First Order Logic (FO), can be translated into a finite subfamily of boolean circuits in the complexity class AC.
For this sake, we work on the expression tree of the formula, looking for its transformation into an equivalent family of boolean circuits of minimum depth.
We present partial results of a research project in which we use boolean circuits as a parallel computation model for the expression of queries to relational databases.
We only consider in this work boolean circuits with gates with either one or two inputs (bounded fan-in) and whose output is used as input in at most one other gate (bounded fan-out).
Finally, we build the finite subfamilies of the corresponding boolean circuits for a given database, and we give a strategy for the minimization of the depth of the circuits in the subfamily, which is applicable in some cases.
Given an r-ary query and a database with domain of size n, a finite subfamily of boolean circuits C = {[C.