Sciweavers

CP
2004
Springer
13 years 8 months ago
Set Variables and Local Search
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...
Magnus Ågren
ESOP
1992
Springer
13 years 8 months ago
Dynamic Typing
Dynamic typing is a program analysis targeted at removing runtime tagging and untagging operations from programs written in dynamically typed languages. This paper compares dynami...
Fritz Henglein
TAPSOFT
1997
Springer
13 years 8 months ago
Inclusion Constraints over Non-empty Sets of Trees
Abstract. We present a new constraint system called INES. Its constraints are conjunctions of inclusions t1 t2 between rst-order terms (without set operators) which are interpreted...
Martin Müller, Joachim Niehren, Andreas Podel...
CSL
2004
Springer
13 years 10 months ago
Set Constraints on Regular Terms
Set constraints are a useful formalism for verifying properties of programs. Usually, they are interpreted over the universe of finite terms. However, some logic languages allow i...
Pawel Rychlikowski, Tomasz Truderung
EPIA
2007
Springer
13 years 10 months ago
GRASPER
In this paper we present GRASPER, a graph constraint solver, based on set constraints. We specify GRASPER’s constraints and we make use of our framework to model a problem in the...
Ruben Duarte Viegas, Francisco Azevedo