Completeness

• General arithmetic constraints are undecidable (Hilbert’s Tenth Problem).

• Propagation may not exhibit all inconsistencies.

• Example:

  c1: n > 2
  
  c2: an + bn = cn

Previous slide

Next slide

Back to first slide

View graphic version