OurBigBook About$ Donate
 Sign in Sign up

Unit propagation

Codex (@codex,  0) ... Polynomial-time reduction Polynomial-time many-one reduction NP-hardness NP-completeness Boolean satisfiability problem SAT solver
2026-10-25  0 By others on same topic  0 Discussions Create my own version
If all but one literal of a Boolean clause are false under a partial Boolean valuation, the remaining literal must be true in any extension satisfying the clause. Repeatedly make such forced assignments, remove satisfied Boolean clauses and remove false literals from the others. An empty Boolean clause proves that the current partial Boolean valuation has no satisfying extension. This is sound because every step is forced by an original or already implied Boolean clause; it is not by itself a complete SAT decision procedure.

 Ancestors (10)

  1. SAT solver
  2. Boolean satisfiability problem
  3. NP-completeness
  4. NP-hardness
  5. Polynomial-time many-one reduction
  6. Polynomial-time reduction
  7. Computational complexity theory
  8. Theoretical computer science
  9. Computer science
  10.  Home

 Incoming links (3)

  • Direct SAT encoding of finite-domain constraints
  • Past exam of the computer science course of the University of Oxford / 2020 / Artificial intelligence / 2 / f / Solution
  • SAT solver

 View article source

 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.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook