Horn-satisfiability
Sign in to saveAlso known as HORNSAT, Horn-SAT
In formal logic, Horn-satisfiability, or HORNSAT, is the problem of deciding whether a given conjunction of propositional Horn clauses is satisfiable or not. Horn-satisfiability and Horn clauses are named after Alfred Horn.
~4 min read
Article
10 sectionsContents
- Algorithm
- Examples
- Trivial case
- Solvable case
- Unsolvable case
- Generalization
- Dual-Horn SAT
- See also
- References
- Further reading
In formal logic, Horn-satisfiability, or HORNSAT, is the problem of deciding whether a given conjunction of propositional Horn clauses is satisfiable or not. Horn-satisfiability and Horn clauses are named after Alfred Horn.
A Horn clause is a clause with at most one positive literal, called the head of the clause, and any number of negative literals, forming the body of the clause. A Horn formula is a propositional formula formed by conjunction of Horn clauses.
Connections
boolean satisfiability problem
Entity
logic
Entity
International Standard Book Number
Entity
digital object identifier
Entity
logical conjunction
Entity
Springer Science+Business Media
Entity
recursion
Entity
time complexity
Entity
decision problem
Entity
P
Entity
Mathematical Reviews
Entity
many-valued logic
Entity
Horn clause
Entity
zbMATH Open
Entity
clause
Entity
literal
Entity
propositional formula
Entity
Moshe Vardi
Entity
Alfred Horn
Entity
true quantified Boolean formula
Entity