Logo des Repositoriums

Auflistung nach Schlagwort "Constraint Programming"

1 - 4 von 4
  • Textdokument
    Computing Treewidth with Constraint Programming
    (SKILL 2022, 2022) Voboril, Florentina
    In this paper, we revisit a known SAT encoding for the fundamental combinatorial treewidth problem. Based on this encoding, we rework it within the constraint modeling language MiniZinc. Two MiniZinc encodings for treewidth are created and their performance is compared in an experimental evaluation. A further dimension for comparison is added by choosing between different backbone solvers supported by MiniZinc.
  • Konferenzbeitrag
    Model-Driven Allocation Engineering – Abridged Version
    (Software Engineering 2017, 2017) Pohlmann, Uwe; Hüwe, Marcus
  • Textdokument
    A Survey of Constraint Transformation Methods
    (INFORMATIK 2021, 2021) Löffler, Sven; Becker, Ilja; Kroll, Franz; Hofstedt, Petra
    The solution performance of finite domain (FD) constraint problems can often be improved by either transforming particular constraints or sub-problems into other FD constraints like binary, table or regular membership constraints, or by transformation of the complete FD problem into an equivalent problem but of another domain, e.g. in a SAT problem. Specialized constraint solvers (like binary or SAT solvers) can outperform general constraint solvers for certain problems. However, this comes with high efforts for the transformation and/or other disadvantages such as a restricted set of constraints such specialized solvers can handle or limitations on the variables domains. In this paper we give an overview of CSP and constraint transformations and discuss applicabilibty and advantages and disadvantages of these approaches.
  • Textdokument
    A system for SMT based constraint programming in Java
    (INFORMATIK 2017, 2017) Funk, Maurice
    This paper presents a system for constraint programming in Java using translation of JVM bytecode into SMT. This allows the constraints to be written in normal Java, to being interoperable with the rest of the program and lowers the entry barrier to using specialised solvers in applications. Due to the nature of the performed translation, variable assignments for other runtime properties than constraint satisfaction can be found. These include variable assignments that lead to runtime exceptions during normal code execution. We demonstrate that the implemented approach is able to find variable assignments for non-trivial constraints such as a Sudoku puzzle.