Keywords

#horn-satisfiability

Horn-satisfiability

In formal logic, Horn-satisfiability, or HORNSAT, is the problem of deciding whether a given set of propositional Horn clauses is satisfiable or not. Horn-satisfiability and Horn clauses are named after Alfred Horn.

Wed 6th

Provided by Wikipedia

Learn More

This keyword could refer to multiple things. Here are some suggestions:

Horn-satisfiability Boolean satisfiability problem 2-satisfiability Hypergraph Unit propagation Horn clause P-complete Jean Gallier Logic programming Sharp-SAT
0 searches
This keyword has never been searched before
This keyword has never been searched for with any other keyword.