Intelligent Agents and Multi-Agent Systems: 7th Pacific Rim International Workshop on Multi-Agents, PRIMA 2004, Auckland, New Zealand, August 8-13,

Titelei......Page 1
Preface......Page 5
PRIMA 2004 Organization......Page 7
Table of Contents......Page 9
1.1 Update Logic......Page 11
1.2 Belief Revision Theory: W.Spohn’s Approach......Page 14
2.1 The Static Part......Page 16
2.2 The Dynamic Part......Page 18
2.3 The Update Mechanism......Page 20
2.4 The Full Language L(Σsg)......Page 23
3.2 Completeness and Soundness Proofs......Page 24
4 Comparison with the AGM Postulates......Page 25
References......Page 27
1 Introduction......Page 28
2 Evolving e-Markets by Integrating Their Specifications......Page 29
3 e-Markets Learning from Each Other......Page 30
3.2 e-Market Evolution Framework......Page 31
3.3 e-Markets Integration Algorithm......Page 33
4 Theoretical Analysis of Role Merging......Page 36
5 Discussion and Conclusion......Page 37
References......Page 38
1 Introduction......Page 39
2 Related Works......Page 40
3.1 Informal Description of the DIMA Multi-agents Model......Page 41
3.2 Control Mechanism......Page 42
4.1 Rewriting Logic......Page 43
5 Modeling of the DIMA Model Using Maude......Page 44
5.1 Formalizing the Internal Behavior of an Agent......Page 45
5.2 Formalizing an Inter-agents Control Mechanism Using Maude......Page 46
5.3 Integrity Constraints......Page 48
6.1 Simulation and Validation of the Internal Behavior of an Agent......Page 49
6.2 Implementation......Page 50
References......Page 51
1 Introduction......Page 53
2 Background......Page 54
3.1 Agent and Agent’s Goal......Page 55
3.2 Goal Tree......Page 56
3.3 Planning Component......Page 57
4 Implementation Details......Page 59
4.2 Implementation on Palm Devices......Page 60
4.3 Implementation on the Cellular Phone(iAppli/ezPlus)......Page 61
5 Related Work......Page 62
6 Discussion and Future Work......Page 64
References......Page 66
1.1 The “Safe to Act” Problem......Page 67
2.1 Subgoal Independence and Serializability......Page 68
2.4 Other Related Research......Page 69
3.1 Guaranteeing “Safeness to Act”: Critical Serialisability......Page 70
3.2 Plans......Page 72
3.3 Determining Which Step Should Be Made Executable First: Distance to Execution......Page 73
4 Conclusions and Future Research......Page 74
References......Page 75
1 Introduction......Page 77
2 Co-adaptive Matchmaking......Page 78
3.1 Background......Page 80
3.2 Mechanism......Page 81
4.1 Setting......Page 82
4.2 Result......Page 83
5.1 Setting......Page 85
5.2 Result......Page 87
6 Related Work......Page 88
References......Page 89
1 Introduction......Page 91
2.1 The Auction Scheme......Page 92
2.5 Profit......Page 93
3 The Z-Process in a Reverse English Auction......Page 94
3.3 Known Parameters......Page 95
3.7 Z-Process Algorithm......Page 96
4 Analysis of the Z-Process in a Reverse English Auction......Page 97
4.1 Expected Profit and Dominant Strategy......Page 98
4.2 Heterogeneous Bidding Agents......Page 99
6 Conclusion and Future Work......Page 100
References......Page 101
1 Introduction......Page 102
2.1 Definition......Page 103
2.2 Agreement Formation for Meeting Room Reservation Problem......Page 104
2.3 Expected Profit of Agents in Meeting Room Reservation Problem......Page 105
3.1 Hybrid Method: A Single Agent Approach......Page 107
3.2 Leveled Method: A Multi-agent Approach......Page 109
3.3 Entering into Pre-agreement......Page 110
4 Related Work......Page 111
5 Conclusions and Future Work......Page 112
References......Page 113
1 The Challenge......Page 114
2 Efficiency Through Misinformation......Page 117
References......Page 123
1 Introduction......Page 125
2 Requirements......Page 126
3.1 The Role of Agents......Page 127
3.2 Relevant Aspects of Agents......Page 129
4 Some Early Attempts......Page 130
5 Engineering Agents-Based Mobile Services: Mobile Computing Example Scenario......Page 131
6 Conclusions......Page 135
References......Page 136
1 Introduction......Page 138
2 Background......Page 139
3.1 A Motivating Example......Page 140
3.2 Impression......Page 142
3.3 Reputation......Page 143
3.4 Risk Attitude and Trustworthiness......Page 144
3.5 Persuasiveness of a Message vs. Stubbornness of the Receiver......Page 145
4.2 Impression......Page 149

4.4 Risk Attitude and Deceivability......Page 150
4.5 Temptation of Lying vs. Sincerity of the Sender......Page 151
5 Performance Analysis......Page 153
6 Conclusion......Page 155
References......Page 156
1 Introduction......Page 158
2 Overview of Automatic Semantic Annotation Systems for Image Retrieval......Page 159
2.1 The Annotation Guide Agent......Page 160
3.1 The Degree of Scatter......Page 161
3.2 The Common Sense Inducibility......Page 162
3.4 Normalization......Page 164
4.1 Experimental Design and Data Collection......Page 165
4.2 Experiment 1......Page 166
4.3 Experiment 2......Page 167
5 Discussion and Conclusions......Page 168
References......Page 170
1 Introduction......Page 172
2 Motivation......Page 174
3 Structured AIP Definition......Page 175
3.1 AIP Structure......Page 176
3.2 AIP Property Suite......Page 179
4.1 Domain-Directed Analysis Phase......Page 181
4.2 Design/Verification Phase......Page 182
5 Example......Page 183
6 Discussion......Page 184
References......Page 185
1 Introduction......Page 188
2.1 Personal and Participative Assistance in Negotiation......Page 189
2.2 Research Issues......Page 190
3.1 Architecture......Page 191
3.2 Illustrative Example......Page 192
4.1 Interaction Protocols......Page 194
4.2 Assistance and Participation......Page 196
5.1 Assistance Projects......Page 198
5.2 Negotiation Support Systems......Page 199
6 Conclusion......Page 200
References......Page 201
1 Introduction......Page 203
2 Architecture of the System......Page 204
2.1 The Workflow Modeller......Page 206
3.1 A Distributed Process Model......Page 207
3.2 Adaptive Workflow Process Operation......Page 212
4 Discussions and Future Work......Page 213
References......Page 214
1 Introduction......Page 216
2.3 Related Work......Page 217
3.1 Workflow Patterns......Page 219
2.5 Flexibilities of Our Workflow System......Page 218
3.1.4 State Based Patterns......Page 220
3.1.5 Cancellation Patterns......Page 221
3.2.1 Synchronous Communication......Page 222
3.2.2 Asynchronous Communication......Page 223
4 Conclusion......Page 224
References......Page 225
1 Introduction......Page 227
2 The Problem of Impromptu Coordination......Page 228
2.3 Characteristics of Impromptu Coordination......Page 229
3 Negotiation for Impromptu Coordination......Page 231
3.2 The Negotiation Framework......Page 232
3.3 Illustrative Example......Page 234
3.4 Characteristics Revisited......Page 235
References......Page 236
1 Introduction......Page 238
2 The Specification Language......Page 239
2.2 The Temporal Logic......Page 240
2.4 The Semantics of Temporal Formulas......Page 241
3.1 Specification Phase......Page 242
3.2 Refinement Phase......Page 243
3.3 Verification Phase......Page 245
4.1 Specification Phase......Page 246
4.2 Refinement Phase......Page 249
5 Conclusion......Page 251
References......Page 252
1 Introduction......Page 253
2.1 Distributed and Mobile Applications......Page 254
2.2 Drawing Inspiration from Cell Transformation and Locomotion......Page 255
3.1 Mobile Component......Page 256
3.2 Component Host......Page 259
4.1 Migration Policy Programming......Page 260
5 Current Status......Page 262
6.1 Desktop Teleporting in Ubiquitous Computing Environments......Page 263
6.3 Component Diffusion in Sensor Networks......Page 264
7 Related Work......Page 265
8 Conclusion......Page 266
References......Page 267
1 Introduction......Page 269
2 Tetralemma......Page 271
2.1 The Third Lemma: ‘It Is and It Is Not’......Page 272
3 Paraconsistent Logic Programming Language......Page 273
4.1 Arguments......Page 276
4.2 Difference as a Momentum of Argumentation......Page 277
5 Semantics for the Argumentation Framework......Page 278
6 Dialogical Proof Theory for the Argumentation Framework......Page 280
7 Illustrative Examples......Page 281
8 Incorporation of Dialectics into Argumentation......Page 285
9 Concluding Remark and Future Work......Page 286
References......Page 287
1 Introduction......Page 289
2 Project Teaming in Telework Community......Page 290
4 Overview of Agent-Based Support System for Project Teaming......Page 291
5.1 Representation of Job Request......Page 293
5.2 Representation of Worker Request......Page 294
5.3 Model of Elaboration of LJC......Page 295
6.1 Design of JSA and WSA in JMAS......Page 296
7 Prototypical System of Agent-Based Support System for Project Teaming for Teleworkers......Page 297
8 Conclusion......Page 299
References......Page 300
1 Introduction......Page 301
2 Interface Agent......Page 303
3 IERuleFormat......Page 305
4 IE Rule Learner and Rule Interpreter......Page 306
5 Experimental Results......Page 309
References......Page 312
1 Introduction......Page 313
2 Web Navigation Using Hyperlinks......Page 314
3 Ontology as a Knowledge Base......Page 316
4 Navigation Agent as a Classifier......Page 319
5 Empirical Results......Page 322
6 Conclusion......Page 324
References......Page 325
1 Introduction......Page 327
2.2 Infrastructure......Page 328
3 System Architecture......Page 329
3.2 Overall Architecture......Page 330
3.5 Traffic Processing and Measuring Against Obstacles......Page 331
3.6 Application of WAS Agent and TP Monitoring Agent......Page 332
4.2 Implementation Scheme......Page 334
5 Empirical Result and Analysis......Page 335
5.1 Effect of Confirming Appointment Agent System......Page 336
References......Page 338
Back matter......Page 339