In this paper we present our ideas to apply constraint satisfaction on business processes. We propose a multi-level constraint satisfaction approach to handle different levels of abstraction in business process modelling.

This paper discusses the deployment of constraint satisfaction methods as a way of enforcing the coordination of distinct and selfinterested agents in open and dynamic environments. We report back on our experience in deploying such approach for developing an agent based solution for resource allocation in multi-provider communication networks. This makes it possible to draw some conclusions on...

This study investigates semantic constraints affecting the order of motion morphemes in Mandarin multi-morpheme motion constructions (e.g., tui-hui recede-return). It classifies Chinese motion morphemes into three major types and proposes a “Scalar Specificity Constraint” to account for the order in multi-morpheme motion constructions. The constraint not only provides a better coverage of the d...

We exhibit an interprocedural framework for the analysis of multi-threaded programs based on partial invariants of a new kind of constraint systems which we call side-effecting. We explore the formal properties of these constraint systems and provide general techniques for computing partial invariants. We demonstrate the practicality of this approach by designing and implementing a reasonably e...

Indoor scene point cloud segmentation plays an essential role in 3D reconstruction and classification. This paper proposes a multi-constraint graph clustering method (MCGC) for indoor segmentation. The MCGC considers multi-constraints, including extracted structural planes, local surface convexity, color information of objects Firstly, the raw is partitioned into patches, we propose robust plan...

Service coordination in domains involving temporal constraints and duration uncertainty has previously been solved with a greedy algorithm that attempts to satisfy service requests one by one rather than reasoning over their combinations to deal with intractable problems. We propose preprocessing using a model that abstracts away duration uncertainty, so that the simplified problem can be solve...