Some Real Systems (I)

• CLP defines a class of languages obtained by
  • Specifying the particular constraint system(s)
  • Specifying control rules

• CLP($\Re$):
  • Linear arithmetic over reals ( $=, \leq, >$)
  • Fourier elimination and an adaptation of Simplex

• PrologIII:
  • Linear arithmetic over rationals ( $=, \leq, >, \neq$), Simplex
  • Boolean ($=$), 2-valued Boolean Algebra
  • Infinite (rational) trees ($=,\neq$)
  • Equations over finite strings

• CHIP:
  • Linear arithmetic over rationals ( $=, \leq, >, \neq$), Simplex
  • Boolean ($=$), larger Boolean algebra (symbolic values)
  • Finite domains
  • User-defined constraints and solver algorithms