Horn Clause Satisfiability Task

A Horn Clause Satisfiability Task is a satisfiability task whose input is a horn clause.

• • …
• Example(s)
  • Is Parent(x,y) ∧ Parent(y,z) ∧ person(x) ∧ person(y) ∧ person(z) Satisfiable?
• See: Horn Clause, Boolean Satisfiability Task.

---

---

References

• (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Horn-satisfiability

---