Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,061,005 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
2007
2007
Modélisation et évaluation de la sûreté de fonctionnement - De AADL vers les réseaux de Pétri stochastiques
A. Rugina
2007
Corpus ID: 38511579
Performing dependability evaluation along with other analyses at architectural level allows both predicting the effects of…
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
,
M. 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
Highly Cited
1995
Highly Cited
1995
The Codesign of Embedded Systems: A Unified Hardware/Software Representation
Sanjaya Kumar
,
J. Aylor
,
B. Johnson
,
W. Wulf
Springer US
1995
Corpus ID: 43052766
Current practice dictates the separation of the hardware and software development paths early in the design cycle. These paths…
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
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
1988
1988
On-Line Full Text Pathology Database
D. Fink
,
A. Clark
,
R. Sideli
1988
Corpus ID: 54102464
Abstract A free text database for pathology reports has been developed using the BRS/SEARCH free text management software. All…
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