Optimizing MiniSAT variable orderings for the relational model finder kodkod

Authors:
Markus Iser;Mana Taghdiri;Carsten Sinz
Affiliations:
Karlsruhe Institute of Technology (KIT), Germany;Karlsruhe Institute of Technology (KIT), Germany;Karlsruhe Institute of Technology (KIT), Germany
Venue:
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Year:
2012

Citing 3
Cited 0

Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Kodkod: a relational model finder

TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Towards robust CNF encodings of cardinality constraints

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is well-known that the order in which variables are processed in a DPLL-style SAT algorithm can have a substantial effect on its run-time. Different heuristics, such as VSIDS [2], have been proposed in the past to obtain good variable orderings. However, most of these orderings are general-purpose and do not take into account the additional structural information that is available on a higher problem description level. Thus, structural, problem-dependent strategies have been proposed (see, e.g., the work of Marques-Silva and Lynce on special strategies for cardinality constraints [1]).