Computing and Information Systems - Research Publications
Permanent URI for this collection
Search Results
1 - 5 of 5
-
ItemPropagating Dense Systems of Integer Linear Equations(ASSOC COMPUTING MACHINERY, 2007)
-
ItemThe Evolving World of MiniZinc(The Association for Constraint Programming, 2009)
-
ItemLazy Clause Generation Reengineered(SPRINGER-VERLAG BERLIN, 2009-11-02)Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy clause generation finite domain propagators are considered as clause generators that create a SAT description of their behaviour for a SAT solver. The ability of the SAT solver to explain and record failure and perform conflict directed back-jumping are then applicable to FD problems. The original implementation of lazy clause generation was constructed as a cut down finite domain propagation engine inside a SAT solver. In this paper we show how to engineer a lazy clause generation solver by embedding a SAT solver inside an FD solver. The resulting solver is flexible, efficient and easy to use. We give experiments illustrating the effect of different design choices in engineering the solver.
-
ItemWhy Cumulative Decomposition Is Not as Bad as It Sounds(SPRINGER-VERLAG BERLIN, 2009)
-
ItemPropagating systems of dense linear integer constraints(SPRINGER, 2009-06)