Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

24 relations
2-satisfiabilityAccess control expressionBitwise operationBoolean circuit

Broader (1)

Boolean algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Higher accuracy and lower run time: efficient mutation analysis using non‐redundant mutation operators
Mutation analysis is a powerful but computationally expensive method to measure the effectiveness of a testing or debugging… 
2014
2014
Extraction of Nominal Multiword Expressions in French
Multiword expressions (MWEs) can be extracted automatically from large corpora using association measures, and tools like… 
2006
2006
STRBAC - An approach towards spatio-temporal role-based access control
The rapid emergence of GPS enabled devices, sensors and mobile equipment in commercial as well as government organizations has… 
Highly Cited
2000
Highly Cited
2000
Foundation for Future Database Systems: The Third Manifesto
From the Publisher: A detailed study of the impact of objects and type theory on the relational model of data, including a… 
Highly Cited
2000
Highly Cited
2000
DSD: A schema language for XML
XML (eXtensible Markup Language) is a linear syntax for trees, which has gathered a remarkable amount of interest in industry… 
1998
1998
Phase-matched rectangular magnetooptic waveguides for applications in integrated optics isolators: numerical assessment
Highly Cited
1995
Highly Cited
1995
The Codesign of Embedded Systems: A Unified Hardware/Software Representation
Current practice dictates the separation of the hardware and software development paths early in the design cycle. These paths… 
1992
1992
Reference, Synthesis and Constraint Satisfaction *
  • L. Pineda
  • Computer graphics forum (Print)
  • 1992
  • Corpus ID: 37600889
In this paper we discuss two kinds of constraint satisfaction problems that arise in the context of geometric modelling, In… 
Highly Cited
1990
Highly Cited
1990
A method for concurrent decomposition and factorization of Boolean expressions
Efficient algorithms are described for decomposition and factorization of Boolean expressions. The method uses only two-literal… 
Highly Cited
1980
Highly Cited
1980
Recognizing Disguised NR(1) Instances of the Satisfiability Problem
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)