Abstract
Reasoning about Action and Change (RAC) and Answer Set Programming (ASP) are two well-known fields in AI for logic-based reasoning. Each paradigm bears unique features and a possible integration can lead to more effective ways to address hard AI problems. In this paper, we report on implementations that embed RAC formalisms and concepts in ASP and present the experimental results obtained, building on a graph-based problem setting that introduces casual and temporal requirements. © 2014 Springer International Publishing.
Author supplied keywords
Cite
CITATION STYLE
Gouidis, F., Patkos, T., Flouris, G., & Plexousakis, D. (2014). Declarative reasoning approaches for agent coordination. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8445 LNCS, pp. 489–503). Springer Verlag. https://doi.org/10.1007/978-3-319-07064-3_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
