The task of algorithm selection involves choosing an algorithm from a set of algorithms on a
per-instance basis in order to exploit the varying performance of algorithms over a set of …

In today's world, critical infrastructure is often controlled by computing systems. This
introduces new risks for cyber attacks, which can compromise the security and disrupt the …

We present the hybrid ASP solver clingcon, combining the simple modeling language and
the high performance Boolean solving capacities of Answer Set Programming (ASP) with …

In recent years, portfolio approaches to solving SAT problems and CSPs have become
increasingly common. There are also a number of different encodings for representing CSPs …

Nonograms, also known as Japanese puzzles, are a specific type of logic drawing puzzles.
The challenge is to fill a grid with black and white pixels in such a way that a given …

This paper describes a SAT-based CSP solver Azucar. Azucar solves a finite CSP by
encoding it into a SAT instance using the compact order encoding and then solving the …

Focusing on portfolio algorithm selection, this paper presents a hybrid machine learning
approach, combining collaborative filtering and surrogate latent factor modeling …

This paper presents the experiences of the organizers of the four constraint solver
competitions which were held in conjunction with CP in the previous years. The paper …

In this paper, we present the Scarab system which is a prototyping tool for developing SAT-
based systems. It provides a rich constraint modeling language on Scala and enables a …

In this paper we present the Transalg system, designed to produce SAT encodings for
discrete functions, written as programs in a specific language. Translation of such programs …