Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutio...
Abstract. To date, ontology research seems to have come to an equilibrium: there is a wide variety of theories, methods and tools for extracting, representing, storing and browsing...
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
This paper shows how a recently introduced class of applications can be solved by constraint programming. This new type of application is due to the emergence of special real-time...
The coordination problem in multi-agent systems is the problem of managing dependencies between the activities of autonomous agents, in conditions of incomplete knowledge about th...