Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-12T06:15:25.137Z Has data issue: false hasContentIssue false

Modelling Multi-Agent Epistemic Planning in ASP

Published online by Cambridge University Press:  21 September 2020

ALESSANDRO BURIGANA
Affiliation:
University of Udine, Udine, Italy (e-mail: burigana.alessandro@spes.uniud.it) (e-mail: francesco.fabiano@uniud.it, agostino.dovier@uniud.it)
FRANCESCO FABIANO
Affiliation:
University of Udine, Udine, Italy (e-mail: burigana.alessandro@spes.uniud.it) (e-mail: francesco.fabiano@uniud.it, agostino.dovier@uniud.it)
AGOSTINO DOVIER
Affiliation:
University of Udine, Udine, Italy (e-mail: burigana.alessandro@spes.uniud.it) (e-mail: francesco.fabiano@uniud.it, agostino.dovier@uniud.it)
ENRICO PONTELLI
Affiliation:
New Mexico State University, Las Cruces, NM, USA (e-mail: epontell@cs.nmsu.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Designing agents that reason and act upon the world has always been one of the main objectives of the Artificial Intelligence community. While for planning in “simple” domains the agents can solely rely on facts about the world, in several contexts, e.g., economy, security, justice and politics, the mere knowledge of the world could be insufficient to reach a desired goal. In these scenarios, epistemic reasoning, i.e., reasoning about agents’ beliefs about themselves and about other agents’ beliefs, is essential to design winning strategies. This paper addresses the problem of reasoning in multi-agent epistemic settings exploiting declarative programming techniques. In particular, the paper presents an actual implementation of a multi-shot Answer Set Programming-based planner that can reason in multi-agent epistemic settings, called PLATO (ePistemic muLti-agent Answer seT programming sOlver). The ASP paradigm enables a concise and elegant design of the planner, w.r.t. other imperative implementations, facilitating the development of formal verification of correctness. The paper shows how the planner, exploiting an ad-hoc epistemic state representation and the efficiency of ASP solvers, has competitive performance results on benchmarks collected from the literature.

Information

Type
Original Article
Copyright
© The Author(s), 2020. Published by Cambridge University Press