- Full text PDF available (95)
- This year (6)
- Last 5 years (46)
- Last 10 years (66)
Journals and Conferences
We describe the design and implementation of a nite domain constraint solver embedded in a Prolog system using an extended uniication mechanism via attributed variables as a generic constraint interface. The solver is essentially a scheduler for indexicals, i.e. reactive functional rules encoding local consistency methods performing incre-mental constraint… (More)
Aurora is a prototype or-parallel implementation of the full Prolog language for shared-memory multiprocessors, developed as part of an informal research collaboration known as the “Gigalips Project”. It currently runs on Sequent and Encore machines. It has been constructed by adapting Sicstus Prolog, a fast, portable, sequential Prolog system. The… (More)
SICStus Prolog has evolved for nearly 25 years. This is an appropriate point in time for revisiting the main language and design decisions, and try to distill some lessons. SICStus Prolog was conceived in a context of multiple, conflicting Prolog dialect camps and a fledgling standardization effort. We reflect on the impact of this effort and role model… (More)
The catalogue of global constraints is reviewed, focusing on the graph-based description of global constraints. A number of possible enhancements are proposed as well as several research paths for the development of the area.
(2) Eliminate values that lead to infeasibility (3) The holy grail: Achieving arc-consistency for a constraint with the lowest complexity. CHALLENGE: How to automatically derive a filtering algorithm from a constraint checker ?
This paper presents a new s cumulative constraint which generalizes the original cumulative constraint in different ways. The two most important aspects consist in permitting multiple cumulative resources as well as negative heights for the resource consumption of the tasks. This allows modeling in an easy way new scheduling and planning problems. The… (More)
Using a glass-box theory of nite domain constraints, FD, we show how the entailment of user-deened constraints can be expressed by anti-monotone FD constraints. We also provide an algorithm for checking the entailment and consistency of FD constraints. FD is shown to be expressive enough to allow the deenition of arithmetical constraints, as well as… (More)
We present an arc-consistency algorithm for a chain of lexicographic ordering constraints on Ñ vectors of Ò variables each. The algorithm maintains arc-consistency and runs in Ç´ÒÑÑµ time per invocation, where is the cost of certain domain operations.