When solving a combinatorial problem using Constraint Programming (CP) or Satisfiability
(SAT), modelling and formulation are vital and difficult tasks. Even an expert human may …

When solving a problem using constraint programming, constraint modelling is widely
acknowledged as an important and difficult task. Even a constraint modelling expert may …

The log encoding has been perceived to be unsuited to arithmetic constraints due to its
hindrance to propagation. The surprising performance of PicatSAT, which is a pure eager …

The formulation of a Propositional Satisfiability (SAT) problem instance is vital to efficient
solving. This has motivated research on preprocessing, and inprocessing techniques where …

Localization for underwater robots remains a challenging issue. Typical sensors, such as
Global Navigation Satellite System (GNSS) receivers, cannot be used under the surface and …

Contractor programming relies on a catalog on elementary contractors which need to be as
efficient as possible. In this paper, we introduce a new theorem that can be used to build …

Abstract Interval Branch and Bound algorithms are used to solve rigorously continuous
constraint satisfaction and constrained global optimization problems. In this paper, we …

Constraint Programming is a powerful technique for solving large-scale combinatorial
(optimisation) problems. However, it is often inaccessible to users without expert knowledge …

Multiple steady states are typically discovered by tracing a solution path, including turning
points. A new technique is presented here that does not follow this approach. The original …

In this paper, we consider the resolution of non-linear constraint satisfaction problems where
the variables of the systems are trajectories (functions from RR to R^ n R n). We introduce …