Sciweavers

140 search results - page 12 / 28
» Rewriting Numeric Constraint Satisfaction Problems for Consi...
Sort
View
CP
2003
Springer
15 years 2 months ago
Solving Finite Domain Constraint Hierarchies by Local Consistency and Tree Search
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
Stefano Bistarelli, Philippe Codognet, Kin Chuen H...
PVLDB
2010
119views more  PVLDB 2010»
14 years 8 months ago
Chase Termination: A Constraints Rewriting Approach
Several database areas such as data exchange and integration share the problem of fixing database instance violations with respect to a set of constraints. The chase algorithm so...
Francesca Spezzano, Sergio Greco
ATAL
2010
Springer
14 years 10 months ago
A general, fully distributed multi-agent planning algorithm
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
Raz Nissim, Ronen I. Brafman, Carmel Domshlak
AAAI
2006
14 years 11 months ago
Temporal Preference Optimization as Weighted Constraint Satisfaction
We present a new efficient algorithm for obtaining utilitarian optimal solutions to Disjunctive Temporal Problems with Preferences (DTPPs). The previous state-of-the-art system ac...
Michael D. Moffitt, Martha E. Pollack
ICCS
2001
Springer
15 years 2 months ago
An Application of the Process Mechanism to a Room Allocation Problem Using the pCG Language
The Sisyphus-I initiative consists of a constraint satisfaction problem in which a group of people in a research environment must be allocated rooms. Numerous constraints are detai...
David Benn, Dan Corbett