Declarative Agent Languages and Technologies III: Third International Workshop, DALT 2005, Utrecht, The Netherlands, July 25, 2005, Selected and Revised

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

This book constitutes the thoroughly refereed post-proceedings of the Third International Workshop on Declarative Agent Languages and Technologies, DALT 2005, held in Utrecht, The Netherlands in July 2005 as an associated event of AAMAS 2005, the main international conference on autonomous agents and multi-agent systems.

The 14 revised full papers presented were carefully selected during two rounds of reviewing and improvement for inclusion in the book. The papers are organized in topical sections on agent programming and beliefs, architectures and logic programming, knowledge representation and reasoning, and coordination and model checking.

Author(s): Matteo Baldoni, Ulle Endriss, Andrea Omicini, Paolo Torroni
Series: Lecture Notes in Artificial Intelligence 3904
Edition: 1
Publisher: Springer
Year: 2006

Language: English
Pages: 255

Front matter......Page 1
Introduction......Page 11
3APL......Page 12
PROLOG-Based Approaches to Modal Reasoning......Page 15
The Addition of Modal Operators in 3APL......Page 16
The Semantics of Modal Operators in 3APL......Page 18
A Goal-Directed Proof Procedure......Page 20
Soundness of the Proof-Procedure......Page 23
Conclusion and Further Research......Page 25
Introduction......Page 27
Dempster-Shafer Theory......Page 28
Mapping Agent Beliefs to Dempster-Shafer Sets......Page 30
Adding Beliefs......Page 31
Deleting Beliefs......Page 32
Composite Beliefs......Page 33
Inconsistency Problem......Page 34
The Frame of Discernment......Page 35
Mass Calculation......Page 36
Updating and Querying the Belief Base......Page 39
Complexity of Belief Queries......Page 40
Conclusion and Further Work......Page 41
Introduction......Page 43
Language and Semantics......Page 45
Axiomatizations......Page 47
Extensions......Page 48
More General Epistemic States......Page 49
Finitary Theories and Completeness......Page 50
Epistemic Axioms......Page 53
Finitaryness of Epistemic Axioms......Page 54
Some Completeness Results......Page 56
Discussion and Conclusions......Page 58
References......Page 59
Introduction......Page 61
Beliefs......Page 62
Agent Architecture......Page 64
TV Recommender......Page 69
Blocks World......Page 76
Comparision of the Illustrations......Page 79
Discussion......Page 80
Introduction......Page 82
Why Answer Set Programming?......Page 83
Ordered Choice Logic Programming......Page 84
The LAIMA Framework......Page 88
JOF: The LAIMA Implementation......Page 91
Playing Games......Page 93
Conclusions and Directions for Future Research......Page 95
Introduction......Page 99
Electronic Institutions......Page 100
Institutional States......Page 101
Institutional Rules......Page 102
Semantics of Institutional Rules......Page 103
Implementing Institutional Rules......Page 106
Sample Institutional Rules......Page 107
An Architecture for Norm-Aware Agent Societies......Page 109
Norm-Aware Governor Agents......Page 111
Related Work......Page 112
Conclusions, Discussion and Future Work......Page 113
Introduction......Page 116
Features of Evolving Logical Agents......Page 118
Declarative Semantics of Evolving Agents......Page 119
DALI in a Nutshell......Page 120
DALI Communication Architecture......Page 122
Declarative Semantics of Basic DALI Programs......Page 123
Semantics of Communication......Page 128
Generalization......Page 130
Concluding Remarks......Page 131
References......Page 132
Introduction......Page 134
Goals and Typology of Goals......Page 136
Decomposition Operators......Page 139
$SeqOr$ Operator......Page 140
$Case$ Operator......Page 141
$Iter$ Operator......Page 142
Comparison with Other Works on Agent Goals Decomposition......Page 143
The GDT Design Process......Page 144
Comparison with Other Goal-Oriented Agent Models......Page 146
Comparison with Goal-Oriented MAS Development Methods......Page 147
Conclusion......Page 148
Introduction......Page 151
AGM Belief Revision......Page 152
Contraction......Page 154
The Agent's Logic and AGM Postulates......Page 156
Preferred Contractions......Page 158
Revision......Page 160
Related Work......Page 161
Conclusions and Further Work......Page 162
Introduction......Page 165
The AgentSpeak-DL Language......Page 166
Semantics of AgentSpeak-DL......Page 169
Retrieving and Selecting Plans in AgentSpeak-DL......Page 170
Intention Execution: Querying the Belief Base......Page 174
Belief Updating......Page 175
Conclusions and Future Work......Page 177
Introduction......Page 181
Museum Tour Guide Robot Scenario......Page 182
Terminology......Page 183
Expressing the Museum Tour Guide Robot Domain......Page 185
Planning Algorithm......Page 188
Finding Invalid Plans and New Valid Plans......Page 192
Agentizing the Whole Procedure......Page 193
Testing the Museum Tour Guide Robot Scenario......Page 195
Conclusion......Page 196
Introduction......Page 198
Syntax......Page 200
Semantics......Page 201
Finite Model Property for TDL......Page 203
Decidability for TDL......Page 207
A Complete Axiomatic System for TDL......Page 209
Discussion......Page 211
Introduction......Page 215
Basics of Agent Coordination......Page 218
An Intensional Programming Model for Distributed Networks of Agents......Page 219
An Overview of Intensional Programming Language: Lucx......Page 220
Agent Communication......Page 222
Lucx as a Content Choice Language......Page 223
Introducing Coordination Constructs in Lucx......Page 224
Coordination Constructs in Lucx......Page 225
Example......Page 227
Conclusion......Page 229
Introduction......Page 233
Tableau-Based Algorithms for Model Checking......Page 235
ACTL* Logic......Page 236
Dialogue Game Protocols as Transition Systems......Page 238
Verification of Dialogue Game Protocols......Page 239
Tableau Rules for ACTL* and CAN-Based Action Formulae......Page 240
Alternating Büchi Tableau Automata (ABTA) for ACTL*......Page 241
Translating ACTL* into ABTA (Step 1)......Page 242
Run of an ABTA on a Transition System (Step 2)......Page 244
Model Checking Algorithm (Step 3)......Page 249
Related Work and Conclusion......Page 251
Back matter......Page 255