Abstract
In this chapter the external constraint processing approach αe [112], [115], is presented, which has been assumed to exist in the theoretical [199], [117], part of this work. Based on some special demands posed [114], [116] by the AuReCon concepts the state of the art in distributed constraint problem solving is discussed in detail. Extending the agent interaction protocols from Chap. 5, we present our own contribution to this field — multi-phase agreement finding. Using a formal algebraic Petri net model and according proof methods, its correctness and termination is proven. Finally, practical aspects of deploying the protocol in medical appointment scheduling are investigated.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2002). 6. External Constraint Problem Solving. In: Hannebauer, M. (eds) Autonomous Dynamic Reconfiguration in Multi-Agent Systems. Lecture Notes in Computer Science(), vol 2427. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45834-4_6
Download citation
DOI: https://doi.org/10.1007/3-540-45834-4_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44312-4
Online ISBN: 978-3-540-45834-0
eBook Packages: Springer Book Archive