CLIMA-IX Call for Participation

[F Sadri]

CLIMA-IX
9th International Workshop on Computational Logic in Multi-Agent Systems 
(CLIMA)
[Co-located with 11th European Conference on LOGICS IN ARTIFICIAL 
INTELLIGENCE (JELIA-08)]
Technische Universität Dresden, Germany        29th-30th September, 2008


REGISTRATION/PARTICIPATION:
Registration for CLIMA is now open. This must be carried out via the 
JELIA registration page http://www.jelia.eu/2008/coming/registration.html

Note that the deadline for early registration is August 20th.

BACKGROUND:
Multi-Agent Systems are communities of problem-solving entities that can 
perceive and act upon their environment in order to achieve both their 
individual goals and their joint goals. The work on such systems 
integrates many technologies and concepts from artificial intelligence 
and other areas of computing as well as other disciplines. Over recent 
years, the agent paradigm gained popularity, due to its applicability to 
a full spectrum of domains, such as search engines, recommendation 
systems, educational support, e-procurement, simulation and routing, 
electronic commerce and trade, etc. Computational logic provides a 
well-defined, general, and rigorous framework for studying the syntax, 
semantics and procedures for the various tasks in individual agents, as 
well as the interaction between, and integration amongst, agents in 
multi-agent systems. It also provides tools, techniques and standards 
for implementations and environments, for linking specifications to 
implementations, and for the verification of properties of individual 
agents, multi-agent systems and their implementations.

AIM AND SCOPE:
The aim of CLIMA is to bring together active researchers from all the 
above areas to discuss and present their work. Relevant topics include, 
but are not limited to, the following (all with a focus on agents, 
multi-agent systems, or agent organisations):

     * logical foundations
     * extensions of logic programming
     * modal logic approaches
     * logic-based programming languages
     * non-monotonic reasoning
     * decision theory
     * hypothetical reasoning and learning
     * knowledge and belief representation and updates
     * operational semantics and execution agent models
     * model checking approaches using (multi-)agent logics
     * semantics of interaction and agent communication languages
     * distributed constraint satisfaction
     * temporal reasoning
     * distributed theorem proving
     * logic-based implementations
     * specification and verification of formal properties


INVITED SPEAKERS:

     * Mehdi Dastani

       Title: Programming Multi-Agent Systems: Issues and Milestones

       Abstract:
           The development of multi-agent systems requires programming 
languages that facilitate the implementation of autonomous agents and 
mechanisms that control and regulate agents' behaviours. It also 
requires computational tools to verify multi-agent programs. In this 
talk, I give a brief overview of recent developments in this research 
field and discuss concepts, tools and techniques that are used in 
different multi-agent programming approaches. In particular, I will 
focus on a multi-agent programming language called 2APL (A Practical 
Agent Programming Language) and explain different approaches to verify 
2APL programs.

     * Wojtek Jamroga

       Title: Does Complexity Matter?

       Abstract:
           A study of computational complexity is nowadays almost 
obligatory in a paper on logic in MAS. Authors usually study the 
complexity of model checking and/or satisfiability checking of their 
logics in order to back the usefulness of the logics with a formal 
argument. In my talk, I suggest that the results are often removed from 
the "practical" complexity which is encountered when one tries to use 
the formalisms in reality. Moreover, it is possible to manipulate the 
context so that different complexity results are obtained for the same 
problem. I support the claim with a review of complexity results for 
model checking of temporal and strategic logics. I also briefly discuss 
some ideas that might help to reduce the real complexity of computation, 
at the expense of either generality or accuracy.


ACCEPTED PAPERS:

     * Contracts Violation: Justification via Argumentation - Stefania 
Costantini, Arianna Tocchio and Panagiota Tsintza.

     * Specification and Dynamic Verification of Agent Properties - 
Stefania Costantini, Pierangelo Dell'Acqua, Luis Moniz Pereira and 
Panagiota Tsintza.

     * Revisiting Satisfiability and Model-Checking for CTLK with 
Synchrony and Perfect Recall - Catalin Dima.

     * Iterated Belief Revision for Legal Belief - Yoshitaka Suzuki.

     * Probabilistic Planning with Imperfect Sensing Actions using 
Hybrid Probabilistic Logic Programs - Emad Saad.

     * Verifying Agents Conformance with Multiparty Protocols - Laura 
Giordano and Alberto Martelli.

     * Bounded-Resource Reasoning as (Strong or Classical) Planning - 
Alexandre Albore, Natasha Alechina, Piergiorgio Bertoli, Chiara Ghidini 
and Brian Logan.

     * Embedding linear-time temporal logic into inifinitary logic: 
Application to the Cut-Elimination Theorem for a Multi-Agent Infinitary 
Epistemic Linear-Time Temporal Logic - Norihiro Kamide.

     * Argument-based Decision Making and Negotiation in E-business: 
Contracting a Land Lease for a Computer Assembly Plant - Phan Minh Dung, 
Phan Minh Thang and Nguyen Duy Hung.

     * Towards an Argument-based Model of Legal Doctrines in Common Law 
of Contracts - Phan Minh Dung and Phan Minh Thang.

     * Programming Social Processes with Action Languages - Juan Manuel 
Serrano and Sergio Saugar.

     * A Stochastic Agent Logic and its Model Checking - Marius 
Bujorianu and Manuela Luminita Bujorianu.