Computational Logic in Multi-Agent Systems: 6th International Workshop, CLIMA VI, London, UK, June 27-29, 2005, Revised Selected and Invited Papers

Front matter......Page 1
Introduction......Page 17
Putting Logic in its Place in the Agent Cycle......Page 19
ALP Combines Forward and Backward Reasoning......Page 21
ALP Combines Reactive and Proactive Thinking......Page 23
Thinking Needs to be Combined with Deciding What to Do......Page 26
Combining ALP with Decision Theory......Page 27
Decision Making Can Often Be Compiled into the Thinking Component of the Agent Cycle......Page 28
Higher Levels of Thinking Can Be Compiled into Lower Levels......Page 29
Combining Deliberative and Intuitive Thinking......Page 30
Neural Networks......Page 32
Logic as Wide-Spectrum Language of Thought......Page 34
Thinking = Logic + Control......Page 35
Conclusions......Page 36
References......Page 37
Introduction......Page 39
Informal Requirements About Ability......Page 41
Model of Ability......Page 42
Extensions to More Complex Actions......Page 43
The Language......Page 44
The Axioms......Page 45
Description of the Example......Page 47
Formulas in the Situation Calculus......Page 48
Some Conclusions......Page 49
Discussion......Page 50
Introduction......Page 53
Syntax and Semantics of Quantified Multimodal Logics......Page 54
Modal Logic Programs......Page 56
The Wise Men Puzzle......Page 57
Labeled Modal Operators......Page 59
Model Generators......Page 60
Fixpoint Semantics......Page 62
SLD-Resolution......Page 63
Soundness and Completeness......Page 65
Inheritance in a Hierarchy of Classes......Page 67
An Example for Modal Deductive Databases......Page 68
Related Works and Possible Extensions......Page 69
Conclusions......Page 70
Introduction......Page 73
Logic......Page 75
The Epistemic Logic of Syntactic Structures......Page 76
Knowing at Most......Page 77
Axiomatizations of Syntactic Structures......Page 78
An Infinitary System......Page 79
A System for a Weaker Language......Page 85
Only Knowing......Page 88
Conclusions......Page 89
Introduction......Page 93
Syntax......Page 95
Semantics......Page 97
Finitely Bounded Sub-languages......Page 98
Examples: Belief Representations with Defaults......Page 103
The Modal Reduction Theorem......Page 107
Equivalence of $Æ_I$ and $L_I$......Page 108
Conclusion and Future Work......Page 110
Introduction......Page 112
The Basic Pre-order on Information Sources......Page 113
The Poset of Trust-Equivalent Source Units......Page 114
A Lattice of Trust Levels......Page 117
A Tree of $Fallbacks$ for Broken Trust......Page 119
Agreement and Consolidation......Page 120
Intermezzo: The Logic $Æ_T$......Page 121
Encoding the Fallback Tree as Defaults in $Æ_T$......Page 122
From Information Sources to Doxastic Agents......Page 124
Related Work......Page 126
Introduction......Page 128
Language and Semantics of $MBQL$......Page 130
Some Auxiliary Tools of the Decision Algorithm......Page 131
Description of the Decision Algorithm......Page 136
Termination of Presented Decision Procedure......Page 141
Soundness and Completeness of $MBQ^{\ast}$......Page 142
Some History......Page 145
Some Applications......Page 146
Where's the Difficulty?......Page 147
SNF......Page 149
Clausal Resolution......Page 150
Clausal Temporal Resolution......Page 151
Executable Temporal Logics......Page 152
Summary......Page 154
Introduction......Page 159
$Jason$ Extension of the AgentSpeak Language......Page 160
Informal Semantics......Page 164
Agent Communication in $Jason$......Page 167
Cooperation in AgentSpeak......Page 168
Configuring Multi-agent Systems......Page 170
Creating Environments......Page 171
Customising Agents......Page 172
Available Tools and Documentation......Page 174
Discussion......Page 176
Final Remarks......Page 177
The Model......Page 181
Examples......Page 182
The KGP Model in a Nutshell......Page 186
KB, the Agent’s Knowledge Base......Page 187
Goals and Plan......Page 193
The Capabilities......Page 194
The Transitions......Page 196
Cycle Theories for Declarative Control......Page 197
Conclusion......Page 199
References......Page 200
Introduction......Page 202
Auction Application......Page 204
Threads and Inter-thread Communication......Page 206
Communication Using the Database......Page 207
ICM Messages......Page 208
Elvin Messages......Page 209
Processing the Message Buffer......Page 210
Bidding Behaviour......Page 211
The Bidding Agents......Page 214
The Auctioneers......Page 216
Concluding Remarks......Page 217
Some Related Languages......Page 218
Introduction......Page 222
Careful Profile......Page 223
The KGP Model of Agency......Page 224
Cycle Theories......Page 227
Behaviour Profiles......Page 229
Careful Profile......Page 230
Focussed Profile......Page 232
Full Planner Profile......Page 236
Conclusion......Page 238
Introduction......Page 242
Contract Representation......Page 243
Short-Term Contracts......Page 244
Long-Term Contracts......Page 245
Communication......Page 246
Contract Evaluation......Page 247
Authoritative Agents......Page 248
Imported Fluents......Page 249
AgentSpeak(L)......Page 250
Meta-information About Contracts......Page 251
Plan Library for Contract Execution......Page 252
Plan Library for Customer Agent......Page 253
Plan Library for Vendor Agent......Page 254
Related Work......Page 255
Conclusion......Page 257
Introduction......Page 259
Abduction......Page 262
Constraint Logic Programming......Page 263
The SCIFF Language......Page 264
The Social Knowledge Base......Page 265
The Social Integrity Constraints......Page 266
Declarative Semantics......Page 271
The SCIFF Proof-Procedure......Page 272
The SOCS-SI Tool......Page 273
Discussion......Page 274
Related Work......Page 275
Conclusions and Future Work......Page 276
Introduction......Page 281
Conformant and Interoperable Agents......Page 283
Conformance Test......Page 286
The Automaton $M_{conf}$......Page 287
Conformance and Interoperability......Page 289
The DyLOG Language: A Case Study......Page 292
Conclusions and Related Work......Page 295
Introduction......Page 300
Scenarios......Page 301
Contextualizing Terminologies......Page 303
A Formal Framework......Page 304
Language......Page 305
Semantics......Page 306
Models for $L^{CT}$......Page 307
Operations on Contexts......Page 308
Assertions......Page 309
Natural Expansions of $L^{CT}$......Page 310
Formalizing the First Scenario......Page 312
Formalizing the Second Scenario......Page 315
Conclusions and Future Work......Page 317
Introduction......Page 319
Attributing Mental Attitudes......Page 321
Input/Output Logic......Page 323
Constitutive Norms vs Regulative Norms......Page 325
The Formal Model......Page 327
The Trade-Off Between Constitutive and Regulative Norms......Page 331
Related Work......Page 333
Conclusions......Page 334
Introduction......Page 336
Preliminaries......Page 338
Combining Answer Sets......Page 341
Composing Programs......Page 344
Permissible Composition......Page 349
Discussion......Page 350
Conclusion......Page 353
Introduction......Page 356
Framework Definition......Page 358
Semantics of Speculative Constraint Processing......Page 360
Overview of the Operational Model......Page 361
Preliminary Definitions......Page 364
Process Reduction Phase......Page 365
Fact Arrival Phase......Page 367
Execution Trace Example......Page 368
Space Complexity of Our Approach......Page 370
Conclusion......Page 371
Introduction......Page 374
A Brief Introduction to the Situation Calculus and to a GOLOG Extension......Page 376
Doing a Procedure......Page 378
A Simple Example......Page 379
General Method to Compute the Probabilities......Page 382
Heuristics to Estimate the Probabilities......Page 383
Conclusion......Page 386
Introduction......Page 389
Scenario Description......Page 390
Received Submissions......Page 391
Winning Criteria......Page 392
How to Determine the Winning System?......Page 393
Evaluation of Submitted Programs......Page 394
Results and Winners......Page 396
What Did We Learn for the Second Contest......Page 398
Conclusion......Page 399
Problem Description......Page 401
Architecture......Page 402
Agent Language......Page 403
Intention Selection and Knowledge Maintenance......Page 404
Communication......Page 405
Negotiation......Page 406
Exploration......Page 407
Implementation......Page 408
Analysis/Conclusion......Page 409
Introduction......Page 412
Using Tropos for the FCAP......Page 413
Extending Detailed Design......Page 415
The Prolog Implementation......Page 416
Conclusions......Page 420
References......Page 421
Introduction......Page 422
The Problem --- A General Approach......Page 423
The Agents......Page 425
The Problem --- Logical Aspects......Page 426
Future Work......Page 428
Introduction......Page 430
The Environment: A Grid World......Page 431
The Cooperation Strategy......Page 432
Results......Page 434
Conclusion......Page 435
Introduction......Page 436
The SOCS Model of Agent Societies......Page 437
Properties......Page 438
Implementation and Experimentation......Page 439
SOCS Dissemination Meeting at CLIMA VI......Page 440
Back matter......Page 443