Name
Abstract | ||
|---|---|---|
In this article, we study a dialogue-based approach to multi-agent collaborative plan search in the framework of t-DeLP, an extension of DeLP for defeasible temporal reasoning. In t-DeLP programs, temporal facts and rules combine into arguments, which compare against each other to decide which of their conclusions are to prevail. By adding temporal actions for multiple agents to this argumentative logic programming framework, one obtains a centralized planning framework. In this planning system, it can be shown that breadth-first search is sound and complete for both forward and backward planning. The main contribution is to extend these results in centralized planning to cooperative planning tasks, where the executing agents themselves are assumed to have reasoning and planning abilities. In particular, we propose a planning algorithm where agents exchange information on plans using suitable dialogues. We show that the soundness and completeness properties of centralized t-DeLP plan search are preserved, so the dialoguing agents will reach an agreement upon a joint plan if and only if some solution exists. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1093/logcom/exv007 | JOURNAL OF LOGIC AND COMPUTATION |
Keywords | Field | DocType |
Planning,argumentation,multi-agent systems,defeasible logic,temporal reasoning,dialogue | Argumentative,Business system planning,Defeasible logic,Computer science,Argumentation theory,Defeasible reasoning,Artificial intelligence,Soundness,Defeasible estate,Completeness (order theory) | Conference |
Volume | Issue | ISSN |
28 | 3 | 0955-792X |
Citations | PageRank | References |
2 | 0.40 | 18 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pere Pardo | 1 | 47 | 8.63 |
| Lluis Godo | 2 | 1392 | 173.03 |