Full Dynamic Substitutability by SAT Encoding

Prestwich, Steven

doi:10.1007/978-3-540-30201-8_38

Cited by 11 publications

(6 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Prestwich has shown that value symmetries can be eliminated automatically by a new encoding from constraints into SAT, the 'maximality encoding' [93]. This breaks all value symmetries of a special kind Prestwich calls 'Dynamic Substitutability', a variant of Freuder's value interchangeability [39].…”

Section: Reformulationmentioning

confidence: 99%

Symmetry in Constraint Programming

Gent¹,

Petrie²,

Puget³

2006

Foundations of Artificial Intelligence

134

138

View full text Add to dashboard Cite

Section: Reformulationmentioning

confidence: 99%

Symmetry in Constraint Programming

Gent¹,

Petrie²,

Puget³

2006

Foundations of Artificial Intelligence

134

138

View full text Add to dashboard Cite

“…Most previous research in this domain has concentrated on domain-filtering operations based on various forms of consistency: a value is removed from a domain if an algorithm running in low-order polynomial time demonstrates that this assignment cannot be part of a solution. Other reduction operations include the elimination of values by interchangeability or substitutability [7,11], the merging of domain values [10], the elimination of variables [9,5,3] and the introduction of symmetry-breaking constraints [1,8].…”

Section: Introductionmentioning

confidence: 99%

Beyond Consistency and Substitutability

Cooper

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. show that one such rule can be applied in the same asymptotic time complexity as neighbourhood substitution but is strictly stronger. An alternative to the elimination of values from domains is the elimination of variables. We give novel satisfiability-preserving variable elimination operations. In each case we show that if the instance is satisfiable, then a solution to the original instance can always be recovered in loworder polynomial time from a solution to the reduced instance.

show abstract

“…The efficient encoding of hard problems as equivalent SAT instances is well-known to be one of the most exciting challenges in SAT solving [22], and requires a great deal of expertise, still remaining more of an art than a science ( [14,26,27,38,39]). …”

Section: Introductionmentioning

confidence: 99%

“…Therefore, to take advantage of powerful SAT solvers, many SAT-encodings of CSPs have been studied recently [11,12,14,15,23,25,26,32,33,34,38]. Although other alternatives have been proposed (e.g., the log encoding [38]) in practice only two types of encoding are usually considered to encode an integer variable in SAT models.…”

Section: Introductionmentioning

confidence: 99%

Application of Hierarchical Hybrid Encodings to Efficient Translation of CSPs to SAT

Nguyen

Velev

Barahona

2013

2013 IEEE 25th International Conference on Tools With Artificial Intelligence

View full text Add to dashboard Cite

Solving Constraint Satisfaction Problems (CSPs) through Boolean Satisfiability (SAT) requires suitable encodings for translating CSPs to equivalent SAT instances that can not only be efficiently generated, but also efficiently solved by SAT solvers. In this paper we investigate hierarchical and hybrid encodings, as proposed by Velev, namely a previously studied log-direct encoding, and a new combination, the log-order encoding. Experiments on different domain problems with these hierarchical encodings demonstrate their significant promise in practice. Our experiments show that the log-direct encoding significantly outperforms the direct encoding (typically by one or two orders of magnitude) taking advantage not only of the more concise representation, but also of the better capability of the log-direct encoding to represent interval variables. We also show that the log-order encoding is competitive with the order encoding, although more studies are required to understand the tradeoff between the fewer variables and longer clauses in the former, when expressing complex CSP constraints.

show abstract

Full Dynamic Substitutability by SAT Encoding

Cited by 11 publications

References 13 publications

Symmetry in Constraint Programming

Symmetry in Constraint Programming

Beyond Consistency and Substitutability

Application of Hierarchical Hybrid Encodings to Efficient Translation of CSPs to SAT

Contact Info

Product

Resources

About