loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04)
Another SAT to CSP Conversion
Boca Raton, Florida
November 15-November 17
ISBN: 0-7695-2236-X
Olivier Roussel, CRIL - CNRS FRE 2499
This paper presents a transformation of a SAT problem into another SAT problem which, in turn, can be directly transformed into a binary CSP instance. This transformation is based on a local model enumeration procedure which can be controlled to get an overall polynomial transformation. A method to reduce the size of the converted formula is proposed. We also show that maintaining k-consistency on the CSP problem is equivalent to using unit propagation on a compiled form of the equivalent SAT problem. This transformation draws another natural bridge between the SAT and the CSP problems which hopefully, should benefit both communities.
Citation:
Olivier Roussel, "Another SAT to CSP Conversion," ictai, pp.558-565, 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.