Constraint Satisfaction Techniques for Agent-Based Reasoning (Google eBook)

Nicoleta Neagu

Springer Science & Business, Mar 24, 2005 - 157 pages

An important aspect of multi agent systems are agent reasoning techniques for problem solving, either at the level of a single agent or at the level of distributed collaboration amongst multiple agents. Constraint satisfaction problems are significant in the domain of automated reasoning for artificial intelligence. They can be applied to modeling and solving of a wide range of combinatorial applications such as planning, scheduling and resource sharing in a variety of practical domains e.g. transportation, production, supply-chains, network management, and human resource management. In this book we study new techniques for solving constraint satisfaction problems, with a special focus on solution adaptation applied to agent reasoning. Most work in constraint satisfaction has focused on computing a solution to a given problem. In practice, it often occurs that an existing solution needs to be modified to satisfy additional criteria or accommodate changes in the problem. Based on constraint satisfaction problem structures and their symmetries, we develop techniques for adapting solutions in applications and show how these techniques can be used when the agent is situated in dynamic and distributed environments. This book is addressed to researchers in the artificial intelligence domain who are interested in constraint satisfaction techniques for agent reasoning. Moreover, as these methods are important for many applications such as planning, scheduling, diagnosis and resource allocation, researchers and application engineers in these domains will also benefit from applying the techniques described in this book.

Contents

• III: 1
• IV: 3
• V: 5
• VI: 7
• VII: 9
• VIII: 11
• IX: 12
• X: 14
• XI: 20
• XII: 22
• XIII: 42
• XIV: 59
• XV: 60
• XVI: 63
• XVII: 72
• XVIII: 77
• XIX: 81
• XX: 88
• XXI: 93
• XXII: 95
• XXIII: 98
• XXIV: 107
• XXV: 108
• XXVI: 110
• XXVII: 111
• XXVIII: 117
• XXIX: 119
• XXX: 121
• XXXI: 123
• XXXII: 126
• XXXIII: 127
• XXXIV: 131
• XXXV: 138
• XXXVI: 141
• XXXVII: 142
• XXXVIII: 146
• XXXIX: 147
• XL: 149

Popular passages

Page 159 - Your Specialized Publisher in Mathematics Birkhduser For orders originating from all over the world except USA/Canada/Latin America: Birkhauser Verlag AG c/o Springer GmbH & Co Haberstrasse 7...‎

Page 1 - However, an increasing number of researchers find the following characterisation useful [10]: an agent is an encapsulated computer system that is situated in some environment, and that is capable of flexible, autonomous action in that environment in order to meet its design objectives There are a number of points about this definition that require further explanation.‎

Page 1 - DAI is the study, construction, and application of multiagent Systems, that is, Systems in which several interacting, intelligent agents pursue some set of goals or perform some set of tasks."3 Insbesondere im deutschsprachigen Raum findet auch der Begriff der Kenetik Verwendung: Die Kenetik „erfordert die Fähigkeit.‎

Page 155 - T. Schiex and G. Verfaillie. Nogood Recording for Static and Dynamic Constraint Satisfaction Problems.‎

Page 60 - A; + is commutative, associative and 0 is its unit element; x is associative, distributes over +, 1 is its unit element and 0 is its absorbing element. A c-semiring ( "c...‎

Bibliographic information

• Title: Constraint Satisfaction Techniques for Agent-Based Reasoning; Whitestein Series in Software Agent Technologies; Whitestein Series in Software Agent Technologies and Autonomic Computing
• Author: Nicoleta Neagu
• Edition: illustrated
• Publisher: Springer Science & Business, 2005
• ISBN: 3764372176, 9783764372170
• Length: 157 pages
• Subjects: Artificial intelligence; Computers / Computer Science; Computers / General; Computers / Intelligence (AI) & Semantics; Electronic books; Intelligent agents (Computer software)