Horn-satisfiability

In formal logic, Horn-satisfiability is the problem of deciding whether a given set of Horn clauses is satisfiable or not. A Horn clause is a clause with at most one positive literal (called the head of the clause). Negative literals, if any, are called the body of the clause. A Horn formula is a propositional formula formed by ANDing Horn clauses.

See also

 

<< PreviousWord BrowserNext >>
rudolph the red nosed reindeer (television special)
william frederick mcfadzean
illinois state route 60
eisregen
seoul foreign school
caerellius priscus
ummo
forensic toxicology
david gauntlett
vfa 82 marauders
barrhaven, ontario
kyrgyzstani som
illinois state route 120
degrassi series
donald h. dwyer, jr.
iven c. kincheloe jr.
the time warp trio
hollywood anti trust case of 1948
barry venison
s.t.a.l.k.e.r.: shadow of chernobyl
john monckton
john doogan
illinois state route 132
car and driver ten best
zaitsev's rule
ulpius marcellus
receiver of wreck
james d. hudnall
the kids of degrassi street
negresti oas
tasnad
otto lohmller
uss ellet (dd 398)
degrassi high
west maui mountains
braburg
the end (character)
pilkington glass
godley & creme
vfa 86 sidewinders
angels unlimited
nigerian dwarf (goat)
super bowl xli
deca (organization)