20 search results - page 2 / 4 » The Log-Support Encoding of CSP into SAT |
SAT
2007
Springer
14 years 1 months ago
2007
Springer
We first define a mapping from CSP to many-valued SAT which allows to solve CSP instances with many-valued SAT solvers. Second, we define a new many-valued resolution rule and p...
CP
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...
CP
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importan...
ISMVL
2008
IEEE
14 years 1 months ago
2008
IEEE
We define a number of original encodings that map MaxCSP instances into Partial Max-SAT instances. Our encodings rely on the well-known direct and support encodings from CSP into...
ENTCS
2008
13 years 7 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...