Abstract
In constraint satisfaction, decomposition is a common technique to split a problem in a number of parts in such a way that the global solution can be efficiently assembled from the solutions of the parts. In this paper, we study the decomposition problem from an autonomous agent perspective. Here, a constraint problem has to be solved by different agents each controlling a disjoint set of variables. Such a problem is called concurrently decomposable if each agent is (i) capable to solve its own part of the problem independently of the others, and (ii) the individual solutions always can be merged to a complete solution of the total problem. First of all, we investigate how difficult it is to decide whether or not a given constraint system and agent partitioning allows for such a concurrent decomposition. Secondly, we investigate how difficult it is to find suitable reformulations of the original constraint problem that allow for concurrent decomposition.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. Journal of the ACM 30(3), 479–513 (1983)
Cohen, D.A., Gyssens, M., Jeavons, P.: A unifying theory of structural decompostions for the constraint satisfaction problems. In: Complexity of Constraints. Dagstuhl Seminar Proceedings 06401 (2006)
Dechter, R.: Constraint Processing. Morgan Kaufmann Publishers, San Francisco (2003)
Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artif. Intell. 38(3), 353–366 (1989)
Gottlob, G., Leone, N., Scarcello, F.: A comparison of structural csp decomposition methods. Artificial Intelligence 124, 2000 (1999)
Hsu, C.-W., Wah, B.W., Huang, R., Chen, Y.: Constraint partitioning for solving planning problems with trajectory constraints and goal preferences. In: IJCAI, pp. 1924–1929 (2007)
Hunsberger, L.: Algorithms for a temporal decoupling problem in multi-agent planning. In: AAAI 2002 (2002)
Naanaa, W.: A domain decomposition algorithm for constraint satisfaction. J. Exp. Algorithmics 13, 1.13–1.23 (2009)
Schaefer, M., Umans, C.: Completeness in the polynomial-time hierarchy: A compendium. SIGACT News 33(3), 32–49 (2002)
Shoham, Y., Leyton-Brown, K.: Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations. CUP, New York (2009)
Wah, B.W., Chen, Y.: Constraint partitioning in penalty formulations for solving temporal planning problems. Artificial Intelligence 170(3), 187–231 (2006)
Yokoo, M., Hirayama, K.: Distributed breakout algorithm for solving distributed constraint satisfaction problems. In: AAMAS1996, pp. 401–408 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Witteveen, C., van der Hoek, W., Roos, N. (2009). Concurrently Decomposable Constraint Systems. In: Braubach, L., van der Hoek, W., Petta, P., Pokahr, A. (eds) Multiagent System Technologies. MATES 2009. Lecture Notes in Computer Science(), vol 5774. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04143-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-04143-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04142-6
Online ISBN: 978-3-642-04143-3
eBook Packages: Computer ScienceComputer Science (R0)