This paper describes a new method for modeling and solving different scheduling and
resource assignment problems that are common in high-level synthesis (HLS) and system …

Constraint logic programming (CLP) is a multidisciplinary research area which can be
located between Artificial Intelligence, Operation Research, and Programming Languages …

This report presents a catalogue of global constraints where each constraint is explicitly
described in terms of graph properties and/or automata and/or first order logical formulae …

In this paper, we present a general approach for solving constraint problems by local search.
The proposed approach is based on a set of high-level constraint primitives motivated by …

Abstract This paper presents Constraint Programming as a natural formalism for modelling
problems, and as a flexible platform for solving them. CP has a range of techniques for …

Constraint Satisfaction Problem (CSP) is a discrete combinatorial problem and hence
search algorithms belong to the main constraint satisfaction techniques. There exist local …

In this chapter1 we will give an overview of real-life applications developed with constraint
logic programming. Constraint logic programming (CLP) combines declarative logic based …

В статье представлен обзор основных направлений удовлетворения ограничений (УО)
и программирования в ограничениях. Целью задачи УО является нахождение значений …

In this paper we give an overview of some industrial applications built using global
constraints. We look at three systems from different application domains and show the core …

This report presents a catalogue of global constraints where each constraint is explicitly
described in terms of graph properties and/or automata and/or first order logical formulae …