#### Filter Results:

#### Publication Year

1984

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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)

- Ewing L. Lusk, Ralph M. Butler, Terry Disz, Robert Olson, Ross A. Overbeek, Rick L. Stevens +8 others
- FGCS
- 1988

- Dan Sahlin, Torkel Franzén, Feliks Klu´zniak, Mats Carlsson, Thomas Sjöland, Bogdan Hausman +9 others
- 1991

A partial evaluator for Prolog takes a program and a query and returns a program specialized for all instances of that query. The intention is that the generated program will execute more efficiently than the original one for those instances. This thesis presents " Mixtus " , an automatic partial evaluator for full Prolog, i.e. including non-logical… (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)

This reportdeals with global constraints for which the set of solutions can be recognized by an extended finite automaton whose size is bounded by a polynomial in ¦ , where ¦ is the number of variables of the corresponding global constraint. By reformulating the automaton as a conjunction of signature and transition constraints we show how to systematically… (More)

Mats Carlsson (mats.carlsson@sics.se) Abstract. 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.

This paper describes an implementation of a small window-based graphical user interface toolkit for X Windows written in the lazy functional language LML. By using this toolkit, a H askell or LML programmer can crest e a user interface with menus, buttons and other graphical interface objects, without conforming to more or less imperative programming… (More)

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)

We present two schemes for compiling disjunctions of nite domain constraints, where disjunction is treated as constructive. In the rst scheme each disjunction is compiled to a set of indexicals, i.e. a set of range functions computing domain restrictions, such that the evaluation of the indexicals maintains a weak form of consistency of the disjunction. The… (More)

First this report presents a restricted set of finite transducers used to synthesise structural time-series constraints described by means of a multi-layered function composition scheme. Second it provides the corresponding synthesised catalogue of structural time-series constraints where each constraint is explicitly described in terms of automata with… (More)