Talk:Constraint satisfaction

From Wikiversity
Jump to navigation Jump to search

What must we add here:

  • Kinds of constraints satisfaction problems: Continuous (Operations Research) and discrete (Constraint Programming)
  • Classification of constraints as binary or N-ary
    • Binarization of constraints
  • Algorithms
    • for binary constraints
    • for N-ary constraints
      • Forward Checking
      • Dynamic Backtracking
      • etc
  • Software for Constraint Programming
    • Rule based systems (ART*Enterprise, etc)
    • Libraries
    • etc

--Jorge 21:07, 24 January 2007 (UTC)[reply]