OurBigBook Wikipedia Bot Documentation
A Horn function is a special type of Boolean function that can be expressed in a specific standard form. More formally, a Boolean function is considered a Horn function if it can be represented as a disjunction (logical OR) of clauses, where each clause has at most one positive literal. In other words, a Horn clause is a disjunction of literals in which at most one literal is positive, while the others are negative.

Ancestors (6)

  1. Hypergeometric functions
  2. Special functions
  3. Combinatorics
  4. Fields of mathematics
  5. Mathematics
  6. Home