| 1 |
Front Matter |
|
|
Abstract
|
| 2 |
,Planning for Multiagent Using ASP-Prolog, |
Tran Cao Son,Enrico Pontelli,Ngoc-Hieu Nguyen |
|
Abstract
This paper presents an Answer Set Programming based approach to multiagent planning. The proposed methodology extends the action language . in [12] to represent and reason about plans with cooperative actions of an individual agent operating in a multiagent environment. This language is used to formalize multiagent planning problems and the notion of a joint plan for multiagent in the presence of cooperative actions. Finally, the paper presents a system for computing joint plans based on the ASP-Prolog system.
|
| 3 |
,Expressing Properties of Resource-Bounded Systems: The Logics ,, and ,, |
Nils Bulling,Berndt Farwer |
|
Abstract
Computation systems and logics for modelling such systems have been studied to a great extent in the past decades. This paper introduces resources into the models of systems and discusses the .. and .., based on the well-known .. and .., for reasoning about computations of such systems. We present initial results on the complexity/decidability of model checking.
|
| 4 |
,Reasoning about Multi-agent Domains Using Action Language ,: A Preliminary Study, |
Chitta Baral,Tran Cao Son,Enrico Pontelli |
|
Abstract
This paper investigates the use of action languages, originally developed for representing and reasoning about single-agent domains, in modeling multi-agent domains. We use the action language . and show that minimal extensions are sufficient to capture several multi-agent domains from the literature. The paper also exposes some limitations of action languages in modeling a specific set of features in multi-agent domains.
|
| 5 |
,Model Checking Normative Agent Organisations, |
Louise Dennis,Nick Tinnemeier,John-Jules Meyer |
|
Abstract
We present the integration of a normative programming language in the . framework for model checking multi-agent systems. The result is a framework facilitating the implementation and verification of multi-agent systems coordinated via a normative organisation. The organisation can be programmed in the normative language while the constituent agents may be implemented in a number of (BDI) agent programming languages..We demonstrate how this framework can be used to check properties of the organisation and of the individual agents in an LTL based property specification language. We show that different properties may be checked depending on the information available to the model checker about the internal state of the agents. We discuss, in particular, an error we detected in the organisation code of our case study which was only highlighted by attempting a verification with “white box” agents.
|
| 6 |
,Operational Semantics for BDI Modules in Multi-agent Programming, |
Mehdi Dastani,Bas R. Steunebrink |
|
Abstract
This paper proposes an operational semantics for BDI modules that can be incorporated in multi-agent programming languages. The introduced concept of modules facilitates the implementation of agents, agent roles, and agent profiles. Moreover, the introduced concept of modules enables common programming techniques such as encapsulation and information hiding for BDI-based multi-agent programs. This vision is applied to a BDI-based multi-agent programming language to which specific programming constructs are added to allow the implementation of modules. The syntax and operational semantics of this programming language are provided and some properties of the module related programming constructs are discussed. An example is presented to illustrate how modules can be used to implement BDI-based multi-agent systems.
|
| 7 |
,Inst,: A Query Language for Virtual Institutions Using Answer Set Programming, |
Luke Hopton,Owen Cliffe,Marina De Vos,Julian Padget |
|
Abstract
Institutions provide a mechanism to capture and reason about “correct” and “incorrect” behaviour within a social context. While institutions can be studied in their own right, their real potential is as instruments to govern open software architectures like multi-agent and service-oriented systems. Our domain-specific action language for normative frameworks, Inst. aims to help focus designers’ attention on the expression of issues such as permission, violation and power but does not help the designer in verifying or querying the model they have specified. In this paper we present the query language Inst. which includes a number of powerful features including temporal constraints over events and fluents that can be used in conjunction with Inst. to specify those traces that are of interest in order to investigate and reason over the underlying normative models. The semantics of the query language is provided by translating Inst. queries into ., the same computational language as Inst.. The result is a simple, high-level query and constraint language that builds on and uses the reasoning power of ASP.
|
| 8 |
,Interacting Answer Sets, |
Chiaki Sakama,Tran Cao Son |
|
Abstract
We consider agent societies represented by logic programs. Four different types of social interactions among agents, ., ., ., and ., are formulated as interactions between answer sets of different programs. Answer sets satisfying conditions of interactions represent solutions coordinated in a multiagent society. A unique feature of our framework is that answer set interactions are specified outside of individual programs. This enables us to freely change the social specifications among agents without the need of modifying individual programs and to separate beliefs of agents from social requirements over them. Social interactions among agents are encoded in a single logic program using constraints. Coordinated solutions are then computed using answer set programming.
|
| 9 |
,Argumentation-Based Preference Modelling with Incomplete Information, |
Wietske Visser,Koen V. Hindriks,Catholijn M. Jonker |
|
Abstract
No intelligent decision support system functions even remotely without knowing the preferences of the user. A major problem is that the way average users think about and formulate their preferences does not match the utility-based quantitative frameworks currently used in decision support systems. For the average user qualitative models are a better fit. This paper presents an argumentation-based framework for the modelling of, and automated reasoning about multi-issue preferences of a qualitative nature. The framework presents preferences according to the lexicographic ordering that is well-understood by humans. The main contribution of the paper is that it shows how to reason about preferences when only incomplete information is available. An adequate strategy is proposed that allows reasoning with incomplete information and it is shown how to incorporate this strategy into the argumentation-based framework for modelling preferences.
|
| 10 |
,A Characterization of Mixed-Strategy Nash Equilibria in PCTL Augmented with a Cost Quantifier, |
Pedro Arturo Góngora,David A. Rosenblueth |
|
Abstract
The game-theoretic approach to multi-agent systems has been incorporated into the model-checking agenda by using temporal and dynamic logic to characterize notions such as Nash equilibria. Recent efforts concentrate on pure-strategy games, where intelligent agents act deterministically guided by utility functions. We build upon this tradition by incorporating stochastic actions. First, we present an extension of the Probabilistic Computation-Tree Logic (PCTL) to quantify and compare expected costs. Next, we give a discrete-time Markov chain codification for mixed-strategy games. Finally, we characterize mixed-strategy Nash equilibria.
|
| 11 |
,On the Implementation of Speculative Constraint Processing, |
Jiefei Ma,Alessandra Russo,Krysia Broda,Hiroshi Hosobe,Ken Satoh |
|
Abstract
Speculative computation has been proposed for reasoning with incomplete information in multi-agent systems. This paper presents the first multi-threaded implementation for speculative constraint processing with iterative revision for disjunctive answers in master-slave multi-agent systems.
|
| 12 |
Back Matter |
|
|
Abstract
|