A first-order clause containing at most one positive first-order literal. A clause with exactly one positive literal is definite; with no positive literal it is a constraint or goal clause.

Ancestors (10)

  1. Horn clause
  2. Boolean satisfiability problem
  3. NP-completeness
  4. NP-hardness
  5. Polynomial-time many-one reduction
  6. Polynomial-time reduction
  7. Computational complexity theory
  8. Theoretical computer science
  9. Computer science
  10. Home

Incoming links (4)

View article source

Discussion (0) New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version