LARA

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Last revision Both sides next revision
sav08:polynomial_algorithm_for_horn_clauses [2008/03/12 14:10]
vkuncak
sav08:polynomial_algorithm_for_horn_clauses [2008/03/12 14:10]
vkuncak
Line 1: Line 1:
-====== Polynomial Algorithm for Horn Clauses ======+====== ​Boolean Constraint Propagation and Polynomial Algorithm for Horn Clauses ======
  
 A Horn clause is a clause that has at most one positive literal. A Horn clause is a clause that has at most one positive literal.