Can I read Horn Formula Satisfiability in CS 228 on EtoBox?
Horn Formula Satisfiability in CS 228 by Jay Chaudhari is a document available to read on EtoBox.
What is Horn Formula Satisfiability in CS 228 about?
The document discusses Horn formulae and an algorithm for checking the satisfiability of Horn formulae. Specifically: - A Horn formula is a CNF formula where each clause contains at most one positive literal. - The Horn algorithm works by marking literals based on implications in the formula. If all antecedents of an implication are marked, the consequent is marked. - The algorithm concludes satisfiable if no clause with all marked literals implies the empty clause. Otherwise it concludes unsatisfiable
- Author
- Jay Chaudhari
- Language
- EN