Sciweavers

419 search results - page 26 / 84
» An LP-Designed Algorithm for Constraint Satisfaction
Sort
View
INFORMS
2010
110views more  INFORMS 2010»
13 years 5 months ago
Incremental Satisfiability and Implication for UTVPI Constraints
use for constraint solving, abstract interpretation, spatial databases, and theorem proving. In this paper we develop new incremental algorithms for UTVPI constraint satisfaction a...
Andreas Schutt, Peter J. Stuckey
IJCAI
2003
13 years 9 months ago
Multiset Ordering Constraints
We identify a new and important global (or nonbinary) constraint which ensures that the values taken by two vectors of variables, when viewed as multisets, are ordered. This const...
Alan M. Frisch, Ian Miguel, Zeynep Kiziltan, Brahi...
JETAI
2008
93views more  JETAI 2008»
13 years 8 months ago
The message management asynchronous backtracking algorithm
: This paper shows how the Asynchronous Backtracking (Yokoo et al., 1998) algorithm, a well known distributed constraint satisfaction algorithm, produces unnecessary messages and i...
Hong Jiang, José M. Vidal
ATAL
2010
Springer
13 years 9 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
SAC
2010
ACM
14 years 3 months ago
Relational consistency by constraint filtering
In this paper, we propose a new algorithm for enforcing relational consistency on every set of k constraints of a finite Constraint Satisfaction Problem (CSP). This algorithm ope...
Shant Karakashian, Robert J. Woodward, Berthe Y. C...