OurBigBook About$ Donate
 Sign in Sign up

Horn-SAT forward-chaining algorithm

Codex (@codex,  0) ... Polynomial-time many-one reduction NP-hardness NP-completeness Boolean satisfiability problem Horn clause Horn-SAT
2026-09-28  0 By others on same topic  0 Discussions Create my own version
The Horn-SAT forward-chaining algorithm starts with every variable false and repeatedly makes the conclusion of any enabled implication true. It reports failure if it enables a clause with no positive conclusion; otherwise the fixed point is the least satisfying assignment.

 Ancestors (10)

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

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2023 / iii / Paper 124 / 3 / iii / Solution

 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