CSCLP
2007
Springer
13 years 10 months ago
2007
Springer
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
CSCLP
2007
Springer
13 years 10 months ago
2007
Springer
Temporal networks play a crucial role in modeling temporal relations in planning and scheduling applications. Temporal Networks with Alternatives (TNAs) were proposed to model alte...
CSCLP
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Graph pattern matching is a central application in many fields. In various areas, the structure of the pattern can only be approximated and exact matching is then too ac...
CSCLP
2007
Springer
13 years 10 months ago
2007
Springer
The notion of optimality naturally arises in many areas of applied mathematics and computer science concerned with decision making. Here we consider this notion in the context of ...
CSCLP
2007
Springer
13 years 10 months ago
2007
Springer
We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient sol...
CSCLP
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. Combinatorial problems such as scheduling, resource allocation, and configuration have many attributes that can be subject of user preferences. Traditional optimization ...
CSCLP
2007
Springer
13 years 10 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...