e/Horn-satisfiability

New Query

Information
has glosseng: In formal logic, Horn-satisfiability, or HORNSAT, is the problem of deciding whether a given set of propositional Horn clauses is satisfiable.
lexicalizationeng: Horn satisfiability
lexicalizationeng: Horn-satisfiability
instance ofc/P-complete problems

Query

Word: (case sensitive)
Language: (ISO 639-3 code, e.g. "eng" for English)


Lexvo © 2008-2025 Gerard de Melo.   Contact   Legal Information / Imprint