Boolean Equations
Boolean Equations is a formal construct in Boolean Algebra that represents a mathematical equation involving Boolean variables and logical operations, distinguished by its constraint that all expressions must evaluate to truth values within the binary set {0, 1} under logical equivalence.
640
Publications
27.8K
Citations
1.2K
Authors
576
Institutions
Publications per year
2017–2026
79
Variants
Boolean Equation
Parents
640
Rough sets and Boolean reasoning
Zdzisław Pawlak, Andrzej Skowron · Information Sciences · 2006 · 958 citations
LUSTRE: A declarative language for programming synchronous systems*
Paul Caspi, D. Pilaud, Nicolas Halbwachs et al. · 1987 · 463 citations
Inference Networks for Document Retrieval
Howard R. Turtle, W. Bruce Croft · ACM SIGIR Forum · 2017 · 425 citations · Full text
1–5 of 640
1.2K
8
h-index
6
h-index
5
h-index
5
h-index
5
h-index
1–5 of 1.2K
576

Centre National de la Recherche Scientifique
Paris, France
15 h-index
25 publications
1.1K citations

Chinese Academy of Sciences
Beijing, China
12 h-index
24 publications
2.6K citations
Shandong University
Jinan, China
11 h-index
23 publications
1.1K citations
University of California, Berkeley
Berkeley, United States
11 h-index
25 publications
1.3K citations
University of Colorado Boulder
Boulder, United States
11 h-index
21 publications
668 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
10 h-index
18 publications
1.3K citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
10 h-index
19 publications
1.1K citations
University of California, Los Angeles
Los Angeles, United States
8 h-index
17 publications
580 citations
1–8 of 576
18 publications · 947 citations
15
h-index
14 publications · 385 citations
12
h-index
9 publications · 515 citations
9
h-index
9 publications · 326 citations
9
h-index
8 publications · 233 citations
8
h-index
1–5