Multi-Agent Plan Verification with Answer Set Programming
S. Opfer, S. Niemczyk, and K. Geihs. Proceedings ot the Third Workshop on Model-Driven Robot Software Engineering (MORSE16), Leipzig, Germany, ACM, (July 2016)
Abstract
Reasoning about multi-agent plans allows to detect modelling failures and to improve the efficiency of the modelling process. Therefore, we evaluate the applicability of an answer set programming based reasoning support for the multi-agent modelling language ALICA. For a proper judgement several reasoning tasks of different complexity are investigated. The overall architecture is highlighted and encountered problems are discussed. Finally it is concluded that answer set programming is a promising approach for reasoning about multi-agent plans.
%0 Conference Paper
%1 opfer2016multiagent
%A Opfer, Stephan
%A Niemczyk, Stefan
%A Geihs, Kurt
%B Proceedings ot the Third Workshop on Model-Driven Robot Software Engineering (MORSE16)
%C Leipzig, Germany
%D 2016
%I ACM
%K alica itegpub vs
%T Multi-Agent Plan Verification with Answer Set Programming
%X Reasoning about multi-agent plans allows to detect modelling failures and to improve the efficiency of the modelling process. Therefore, we evaluate the applicability of an answer set programming based reasoning support for the multi-agent modelling language ALICA. For a proper judgement several reasoning tasks of different complexity are investigated. The overall architecture is highlighted and encountered problems are discussed. Finally it is concluded that answer set programming is a promising approach for reasoning about multi-agent plans.
@inproceedings{opfer2016multiagent,
abstract = {Reasoning about multi-agent plans allows to detect modelling failures and to improve the efficiency of the modelling process. Therefore, we evaluate the applicability of an answer set programming based reasoning support for the multi-agent modelling language ALICA. For a proper judgement several reasoning tasks of different complexity are investigated. The overall architecture is highlighted and encountered problems are discussed. Finally it is concluded that answer set programming is a promising approach for reasoning about multi-agent plans.},
added-at = {2017-01-02T17:26:28.000+0100},
address = {Leipzig, Germany},
author = {Opfer, Stephan and Niemczyk, Stefan and Geihs, Kurt},
biburl = {https://www.bibsonomy.org/bibtex/2be2059a50de05a7d1fd73a6b7fea3492/vskassel},
booktitle = {Proceedings ot the Third Workshop on Model-Driven Robot Software Engineering (MORSE16)},
interhash = {05980fb92ee993f2ae9e48d62a9df0e3},
intrahash = {be2059a50de05a7d1fd73a6b7fea3492},
keywords = {alica itegpub vs},
month = jul,
publisher = {ACM},
timestamp = {2018-04-12T16:10:56.000+0200},
title = {Multi-Agent Plan Verification with Answer Set Programming},
year = 2016
}