Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,041,144 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.
2014
2014
Extraction of Nominal Multiword Expressions in French
Marie Dubremetz
,
Joakim Nivre
MWE@EACL
2014
Corpus ID: 12217474
Multiword expressions (MWEs) can be extracted automatically from large corpora using association measures, and tools like…
Expand
2006
2006
Automatic generation of test cases from Boolean specifications using the MUMCUT strategy
Yuen-Tak Yu
,
M. Lau
,
T. Chen
Journal of Systems and Software
2006
Corpus ID: 34184245
Highly Cited
2005
Highly Cited
2005
Developing and assuring trustworthy Web services
W. Tsai
,
Xiao Wei
,
Yinong Chen
,
B. Xiao
,
R. Paul
,
H. Huang
Proceedings Autonomous Decentralized Systems…
2005
Corpus ID: 9288124
Web services are emerging technologies that are changing the way we develop and use computer systems and software. Current Web…
Expand
2005
2005
Novel state minimization and state assignment in finite state machine design for low-power portable devices
Wen-Tsong Shiue
Integr.
2005
Corpus ID: 43475099
2002
2002
An Extension of OCL with Temporal Logic
P. Ziemann
,
Martin Gogolla
2002
Corpus ID: 16445010
. UML class diagrams are widely used to model the static structure of object-oriented software systems. As a supplement, OCL…
Expand
2001
2001
Boolean expression of LUM smoothers
R. Lukac
,
Stanislav Marchevsky
IEEE Signal Processing Letters
2001
Corpus ID: 16951804
A new algorithm for rank order-based nonlinear lower-upper-middle (LUM) smoothers, setting out from the threshold decomposition…
Expand
1998
1998
Phase-matched rectangular magnetooptic waveguides for applications in integrated optics isolators: numerical assessment
M. Lohmeyer
,
N. Bahlmann
,
O. Zhuromskyy
,
H. Dötsch
,
P. Hertel
1998
Corpus ID: 981912
Highly Cited
1995
Highly Cited
1995
The Codesign of Embedded Systems: A Unified Hardware/Software Representation
Sanjaya Kumar
,
J. Aylor
,
Barry W. 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
Highly Cited
1990
Highly Cited
1990
A method for concurrent decomposition and factorization of Boolean expressions
J. Vasudevamurthy
,
J. Rajski
IEEE International Conference on Computer-Aided…
1990
Corpus ID: 41252970
Efficient algorithms are described for decomposition and factorization of Boolean expressions. The method uses only two-literal…
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
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE