Communicating ASP and the polynomial hierarchy

Bauters, Kim, Schockaert, Steven ORCID: https://orcid.org/0000-0002-9256-2881, Vermeir, Dirk and De Cock, Martine 2011. Communicating ASP and the polynomial hierarchy. Presented at: LPNMR 2011: 11th International Conference on Logic Programming and Nonmonotonic Reasoning, Vancouver, BC, Canada, 16-19 May 2011. Published in: Delgrande, J. P. and Faber, W. eds. Logic Programming and Nonmonotonic Reasoning: 11th International Conference, LPNMR 2011, Vancouver, Canada, May 16-19, 2011. Proceedings. Lecture Notes in Computer Science. Lecture Notes in Computer Science , vol.6645 Berlin and Heidelberg: Springer, pp. 67-79. 10.1007/978-3-642-20895-9_8

Full text not available from this repository.

Abstract

Communicating answer set programming is a framework to represent and reason about the combined knowledge of multiple agents using the idea of stable models. The semantics and expressiveness of this framework crucially depends on the nature of the communication mechanism that is adopted. The communication mechanism we introduce in this paper allows us to focus on a sequence of programs, where each program in the sequence may successively eliminate some of the remaining models. The underlying intuition is that of leaders and followers: each agent’s decisions are limited by what its leaders have previously decided. We show that extending answer set programs in this way allows us to capture the entire polynomial hierarchy.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Publisher:	Springer
ISSN:	0302-9743
Last Modified:	25 Oct 2022 09:42
URI:	https://orca.cardiff.ac.uk/id/eprint/59688

Citation Data

Cited 3 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item