Results 151 to 160 of about 14,682 (204)
Some of the next articles are maybe not open access.
Streaming Dyadic Boolean Operations
Fifth International Conference on Information Technology: New Generations (itng 2008), 2008We investigate the specification and implementation of iterator components for dyadic Boolean operations in the setting of stream functions and state transition machines. We explicate the approach for the Boolean conjunction and study iterator components repeating this operation.
Walter Dosch +2 more
openaire +1 more source
Accelerated robust Boolean operations based on hybrid representations
Computer Aided Geometric Design, 2018 Constructive Solid Geometry (CSG) is one of the popular techniques that is widely applied in 3D modeling. It combines primitive solids using Boolean operations.
Bin Sheng, Ping Li, Enhua Wu
exaly +2 more sources
On the evaluation of Boolean operators in the extended Boolean retrieval framework
Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '93, 1993The retrieval models based on the extended boolean retrieval framework, e.g., the fuzzy set model and the extended boolean model have been proposed in the past to provide the conventional boolean retrieval system with the document ranking facility. However, due to undesirable properties of evaluation formulas for the AND and OR operations, the former ...
Joon Ho Lee +3 more
openaire +1 more source
SEMIRINGS OF SETS OF BOOLEAN OPERATIONS
JP Journal of Algebra, Number Theory and Applications, 2017Summary: On the power set \(P(O^n(A))\) of all \(n\)-ary operations, two binary operations \(\oplus\) and \(\otimes\) are defined giving a semiring \((P(O^n(A)),\oplus,\otimes)\). For \(A=\{0,1\}\), we investigate idempotency in the semiring \((P(O^n(A)),\oplus,\otimes)\).
openaire +2 more sources
Computable Isomorphisms of Boolean Algebras with Operators
Studia Logica, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bakhadyr Khoussainov, Tomasz Kowalski
openaire +3 more sources
Boolean Functions Without Boolean Operators
1989The motivation for working without Boolean operators can mostly be found in the field of Boolean stochastics which will be treated in §§8 and 9. In the present chapter stochastic aspects will be precluded. Even today practical workers in many fields who apply Boolean functions are easily frustrated by the very idea of working without Boolean operators.
openaire +1 more source
Types ‘Char’ and ‘Boolean’. Boolean Operators
1983So far, we have formally introduced two types of data. Both of them are numerical: INTEGER and REAL. We have also discussed and demonstrated the output of strings (or, to be more specific, character strings) of which characters are the single elements (letters of the alphabet, decimal digits 0–9, punctuation marks, mathematical signs and other symbols).
openaire +1 more source
Special operations on Boolean algebras
1996We give the basic definitions and facts about several operations on Boolean algebras which were not discussed in the Handbook.
openaire +1 more source
The Operations of Boolean Algebras
The Annals of Mathematics, 1926I use here the notation a + b for the logical sum of a and b, a b for the logical product of a and b, and a' for the negation of a. The capital letters stand for constants and the small letters for variables. The parameters A, B, C and D are called the discriminants of the operation. Similarly the most general function of one variable can be written in
openaire +1 more source
Predicates A — Boolean operators
1990As already mentioned, the manipulation of predicates will be our main vehicle for program development. As such, manipulating them must become second nature. This comes from practice. Throughout this chapter there are theorems whose proofs are omitted. Although these proofs are exercises at chapter end, we highly recommend attacking them as they appear ...
openaire +1 more source