Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Related topics

Related topics

24 relations
2-satisfiabilityAccess control expressionBitwise operationBoolean circuit
Expand

Broader (1)

Boolean algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
NEQR: a novel enhanced quantum representation of digital images
Quantum computation is becoming an important and effective tool to overcome the high real-time computational requirements of… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2013
Highly Cited
2013
Boolean symmetric searchable encryption
In this article we tackle the issue of searchable encryption with a generalized query model. Departing from many previous works… Expand
  • table 1
  • figure 2
  • figure 3
  • figure 1
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Efficient Consistency Measurement Based on Behavioral Profiles of Process Models
Engineering of process-driven business applications can be supported by process modeling efforts in order to bridge the gap… Expand
  • figure 1
  • figure 3
  • figure 5
  • figure 8
  • figure 7
Is this relevant?
Highly Cited
2009
Highly Cited
2009
PolyBoRi: A framework for Gröbner-basis computations with Boolean polynomials
This work presents a new framework for Grobner-basis computations with Boolean polynomials. Boolean polynomials can be modelled… Expand
  • figure 1
  • table 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
ASBRU: A TASK-SPECIFIC, INTENTION-BASED, AND TIME-ORIENTED LANGUAGE FOR REPRESENTING SKELETAL PLANS
Skeletal plans are a powerful way to reuse existing domain-specific procedural knowledge. They are instantiated and refined… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Refinement types for ML
Abstract : Programming computers is a notoriously error-prone process. It is the job of the programming language designer to make… Expand
  • figure 2
Is this relevant?
Highly Cited
1984
Highly Cited
1984
A simplified NP-complete satisfiability problem
3-SAT is NP-complete when restricted to instances where each variable appears in at most four clauses. When no variable appears… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Extended Boolean information retrieval
In conventional information retrieval Boolean combinations of index terms are used to formulate the users'' information requests… Expand
  • table I
  • figure 1
  • figure 2
  • figure 3
  • table II
Is this relevant?
Highly Cited
1956
Highly Cited
1956
Minimization of Boolean functions
A systematic procedure is presented for writing a Boolean function as a minimum sum of products. This procedure is a… Expand
Is this relevant?
Highly Cited
1954
Highly Cited
1954
Application of Boolean algebra to switching circuit design and to error detection
  • David E. Muller
  • Trans. I R E Prof. Group Electron. Comput.
  • 1954
    • Corpus ID: 26926937
A solution is sought to the general problem of simplifying switching circuits that have more than one output. The mathematical… Expand
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE