We propose a general scheme for the cooperation of different constraint solvers. On top of a uniform interface for constraint we stepwise develop reduction systems which describe the behaviour of an overall combined s...
详细信息
In this paper we present a new framework for over constrained problems. We suggest to define an over-constrained network as a global constraint. We introduce two new lower bounds of the number of violations, without m...
详细信息
the constraint-Based Agent (CBA) framework is a set of tools for designing, simulating, building, verifying, optimizing, learning and debugging controllers for agents embedded in an active environment. the agent and t...
详细信息
In recent years, a growing number of attempts have been performed in order to integrate well known Operations Research(OR) techniques in constraintprogramming (CP) tools. the aim of the integration is to maintain the...
详细信息
this paper introduces a new rigidification method -using interval constraintprogramming techniques-to solve geometric constraint systems. Standard rigidification techniques are graph-constructive methods exploiting t...
详细信息
this paper describes the architecture and implementation of a constraint-based framework for rapid prototyping of distributed applications such as virtual simulations, collaborations and games. Our framework integrate...
详细信息
this paper proposes an algorithm for satisfying systems of linear equality and inequality constraints with hierarchical strengths or preferences. Basically, it is a numerical method that incrementally obtains the LU d...
详细信息
Many combinatorial problems can be naturally expressed as "constraint satisfaction problems". this class of problems is known to be NP-hard in general, but a number of restrictions of the general problem hav...
详细信息
Many applications of CSPs require partial solutions to be found before all the information about the problem is available. We examine the case where the future is partially known, and where it is important to make dec...
详细信息
We perform a comprehensive study of mappings between constraint satisfaction problems (CSPs)an d propositional satisfiability (SAT). We analyse four different mappings of SAT problems into CSPs, and two of CSPs into S...
详细信息
暂无评论