Satisfiability Task

A Satisfiability Task is a constraint satisfaction task that requires a decision of whether a logic sentence is a satisfiable logic sentence or an unsatisfiable logic sentence.

• AKA: Logical Satisfiability Task.
• Context:
  • It can require that only a single positive solution be provided to demonstrated satisfiability.
  • It can be solved by a Satisfiability Algorithm.
• Example(s):
  • a Boolean Sentence Satisfiability Task.
  • a Propositional Sentence Satisfiability Task.
  • a Horn Clause Satisfiability Task.
  • a First-Order Sentence Satisfiability Task.
• See: Logical Inference Task.

---