Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,540,635 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
24 relations
2-satisfiability
Access control expression
Bitwise operation
Boolean circuit
Expand
Broader (1)
Boolean algebra
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
A Single Word is not Enough: Ranking Multiword Expressions Using Distributional Semantics
Martin Riedl
,
Chris Biemann
Conference on Empirical Methods in Natural…
2015
Corpus ID: 16232250
We present a new unsupervised mechanism, which ranks word n-grams according to their multiwordness. It heavily relies on a new…
Expand
2015
2015
DESIGN AND IMPLEMENTATION OF DIMINISHED-ONE MODULO 2 N + 1 ADDER USING FPGA TECHNOLOGY
T. Ajay
2015
Corpus ID: 189921710
-Two modified architectures for modulo 2+1 adders are introduced in this paper. Only some of the carries of modulo 2+1 addition…
Expand
2010
2010
Mining Frequent Boolean Expressions: Application to Gene Expression and Regulatory Modeling
Mohammed J. Zaki
,
Naren Ramakrishnan
,
Lizhuang Zhao
International Journal of Knowledge Discovery in…
2010
Corpus ID: 2537064
Regulatory network analysis and other bioinformatics tasks require the ability to induce and represent arbitrary boolean…
Expand
2007
2007
Semantical Expansion of Two-Level Boolean Formulas for Minimisation
Martin Lange
2007
Corpus ID: 16583565
Semantical expansion aims at boosting minimisation heuristics for Boolean formulas. It provides an easy way of deciding whether…
Expand
2004
2004
Automatic Extraction of Multiword Expressions in Bengali : An Approach for Miserly Resource Scenarios
A. Agarwal
,
Biswajit Ray
,
Monojit Choudhury
,
A. Basu
,
Sudeshna Sarkar
2004
Corpus ID: 18459797
Works on automatic extraction of multiword expressions (MWE) have banked on the use of deep or shallow syntactic pre-processing…
Expand
2002
2002
Performance of Two Algorithms In Minimum Sum of Diameters Clustering
Z. Noman
2002
Corpus ID: 14083523
Minimum sum of diameters clustering can be solved by reduction to determination of the satisfiability of a 2Conjunctive Normal…
Expand
1993
1993
An Information System organized as Stratified
C. Burgers
,
H. Proper
,
T. P. van der Weide
1993
Corpus ID: 501374
In this paper we investigate the relation between modern hypertext approaches and conventional data modelling techniques, such as…
Expand
1993
1993
PARFORMAN/spl minus/an assertion language for specifying behaviour when debugging parallel applications
M. Auguston
,
P. Fritzson
Euromicro Workshop on Parallel and Distributed…
1993
Corpus ID: 11063576
PARFORMAN (PARallel FORMal ANnotation language) is a specification language for expressing the intended behaviour or known types…
Expand
1981
1981
Completeness criteria for testing elementary program functions
W. Howden
International Conference on Software Engineering
1981
Corpus ID: 8557267
Program testing metrics are based on criteria for measuring the completeness of a set of program tests. Branch testing measures…
Expand
1976
1976
On the Parallel Evaluation of Boolean Expressions
A. Barak
,
E. Shamir
SIAM journal on computing (Print)
1976
Corpus ID: 30395403
A bound for the number of steps that are required to evaluate Boolean expressions is obtained. It is shown that any Boolean…
Expand