A Boolean variable takes one of two truth values, false or true, encoded as zero or one. It is an input to a Boolean formula; a Boolean literal uses the Boolean variable either positively or with logical negation. A Boolean valuation assigns one truth value to each distinct Boolean variable, so three distinct Boolean variables give eight possible complete assignments regardless of how often each appears.
Ancestors (10)
- Boolean formula
- Boolean satisfiability problem
- NP-completeness
- NP-hardness
- Polynomial-time many-one reduction
- Polynomial-time reduction
- Computational complexity theory
- Theoretical computer science
- Computer science
- Home
Incoming links (57)
- Binary decision diagram
- Boolean cofactor
- Boolean formula
- Boolean game
- Boolean literal
- Boolean satisfiability problem
- Boolean variable
- Candidate equilibrium checking in a Boolean game
- Cardinality constraint
- Circuit complexity
- Decision node
- Direct SAT encoding of finite-domain constraints
- Exactly-one constraint
- Finite-variable dependence of a propositional rule base
- Horn-SAT forward-chaining algorithm
- Karnaugh map
- Minterm
- Nonattacking knights problem
- One-row in-place Life update
- Partial Boolean assignment
- Past exam of the computer science course of the University of Oxford / 2015 / Advanced data structures and algorithms / 2 / d / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Computational complexity / 2 / d / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Computational complexity / 2 / e / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Computer aided formal verification / 1 / a / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Computer aided formal verification / 1 / b / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Computer aided formal verification / 1 / d / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Computer aided formal verification / 1 / e / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Computer aided formal verification / 1 / f / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Computer aided formal verification / 2 / c / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Intelligent systems / 1 / a / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Intelligent systems / 1 / c / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Logic and proof / 1 / c / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Logic and proof / 1 / d / Solution
- Past exam of the computer science course of the University of Oxford / 2015 / Logic and proof / 3 / c / Solution
- Past exam of the computer science course of the University of Oxford / 2019 / Artificial intelligence / 2 / a / Solution
- Past exam of the computer science course of the University of Oxford / 2019 / Artificial intelligence / 3 / e / Solution
- Past exam of the computer science course of the University of Oxford / 2019 / Artificial intelligence / 3 / f / Solution
- Past exam of the computer science course of the University of Oxford / 2020 / Artificial intelligence / 2 / e / Solution
- Past exam of the computer science course of the University of Oxford / 2021 / Artificial intelligence / 1 / f / Solution
- Past exam of the computer science course of the University of Oxford / 2022 / Artificial intelligence / 3 / a / Solution
- Past exam of the computer science course of the University of Oxford / 2022 / Artificial intelligence / 3 / d / Solution
- Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 37 / 1 / Solution
- Past exam of the mathematics course of the University of Cambridge / 2013 / iii / Paper 59 / 3 / d / Solution
- Past exam of the mathematics course of the University of Cambridge / 2015 / iii / Paper 38 / 4 / e / Solution
- Past exam of the MSc in advanced computer science course of the University of Oxford / 2022 / Computational game theory / 2 / b / Solution
- Past exam of the MSc in advanced computer science course of the University of Oxford / 2022 / Computational game theory / 2 / c / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2019 / Digital systems, linear algebra, introduction to formal proof / 2 / b / Solution
- Past exam of the year 1 of the computer science course of the University of Oxford / 2022 / Digital systems, linear algebra, introduction to formal proof / 7 / b / Solution
- Quadratic-equation satisfiability over F2
- Reduced ordered binary decision diagram
- Search-to-decision reduction
- Symbolic model checking
- Tseytin transformation
- Two-block quantified Boolean formula
- Variable ordering of a binary decision diagram
- Verifying a satisfying assignment
- Weighted formula utility representation
Discussion (0) New discussion
There are no discussions about this article yet.
Articles by others on the same topic (0)
There are currently no matching articles.