SAT 2004 START ConferenceManager    


Mapping problems with finite-domain variables into problems with Boolean variables

Carlos Ansotegui and Felip Manya

Presented at The Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT 2004), Vancouver, BC, Canada, 10-13 May 2004


Abstract

we define a collection of mappings that transform many-valued clausal forms into satisfiability equivalent Boolean clausal forms, analyze their complexity, and evaluate them on a set of benchmarks with a state-of-the-art SAT solver. Our results provide experimental evidence that encoding combinatorial problems with the mappings defined here can lead to substantial performance improvements in complete SAT solvers.


  
START Conference Manager (V2.47.2)
Maintainer: rrgerber@softconf.com