Relative Tradeoffs Offered bythe various compilation substrates

• CSP encodings support implicit representations

  • More compact encodings [Do & Kambhampati, 2000]
  • Easier integration with Scheduling techniques

• ILP encodings support numeric quantities

  • Seamless integration of numeric resource constraints [Walser & Kautz, 1999]
  • Not competitive with CSP/SAT for problems without numeric constraints

• SAT encodings support axioms in propositional logic form

  • May be more natural to add (for whom ;-)

• BDDs are very popular in CAD community

  • Commercial interest may spur effective algorithms (which we can use)

Previous slide

Next slide

Back to first slide

View graphic version