| Information | |
|---|---|
| has gloss | eng: In formal logic, Horn-satisfiability, or HORNSAT, is the problem of deciding whether a given set of propositional Horn clauses is satisfiable. |
| lexicalization | eng: Horn satisfiability |
| lexicalization | eng: Horn-satisfiability |
| instance of | c/P-complete problems |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint