Communicating ASP and the polynomial hierarchy

Kim Bauters; Steven Schockaert; Martine De Cock; Dirk Vermeir

Communicating ASP and the polynomial hierarchy

Kim Bauters, Steven Schockaert, Martine De Cock, Dirk Vermeir

Logic Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference paper

3 Citations (Scopus)

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.

Original language	English
Title of host publication	Proceedings of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)
Editors	James P. Delgrande, Wolfgang Faber
Publisher	Springer Verlag
Pages	67-79
Number of pages	13
Volume	6645
ISBN (Print)	978-3-642-20894-2
Publication status	Published - 2011
Event	Unknown - Duration: 1 Jan 2011 → …

Publication series

Name	Lecture Notes in Computer Science

Conference

Conference	Unknown
Period	1/01/11 → …

Bibliographical note

James P. Delgrande, Wolfgang Faber

Keywords

answer set programming
communicating agents

Access to Document

http://www.cwi.ugent.be/kim/lpnmr2011.pdf

Handle.net

Persistent link

Unknown (External organisation)
Dirk Vermeir (Member)
21 May 2003 → …
Activity: Membership › Membership of external research organisation

Cite this

Bauters, K., Schockaert, S., De Cock, M., & Vermeir, D. (2011). Communicating ASP and the polynomial hierarchy. In J. P. Delgrande, & W. Faber (Eds.), Proceedings of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR) (Vol. 6645, pp. 67-79). (Lecture Notes in Computer Science). Springer Verlag. http://www.cwi.ugent.be/kim/lpnmr2011.pdf

@inproceedings{25a41b91fc9e4c988860c14d57d494d2,

title = "Communicating ASP and the polynomial hierarchy",

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.",

keywords = "answer set programming, communicating agents",

author = "Kim Bauters and Steven Schockaert and {De Cock}, Martine and Dirk Vermeir",

note = "James P. Delgrande, Wolfgang Faber; Unknown ; Conference date: 01-01-2011",

year = "2011",

language = "English",

isbn = "978-3-642-20894-2",

volume = "6645",

series = "Lecture Notes in Computer Science",

publisher = "Springer Verlag",

pages = "67--79",

editor = "Delgrande, {James P.} and Wolfgang Faber",

booktitle = "Proceedings of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)",

address = "Germany",

}

Bauters, K, Schockaert, S, De Cock, M & Vermeir, D 2011, Communicating ASP and the polynomial hierarchy. in JP Delgrande & W Faber (eds), Proceedings of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). vol. 6645, Lecture Notes in Computer Science, Springer Verlag, pp. 67-79, Unknown, 1/01/11. <http://www.cwi.ugent.be/kim/lpnmr2011.pdf>

Communicating ASP and the polynomial hierarchy. / Bauters, Kim; Schockaert, Steven; De Cock, Martine et al.
Proceedings of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR). ed. / James P. Delgrande; Wolfgang Faber. Vol. 6645 Springer Verlag, 2011. p. 67-79 (Lecture Notes in Computer Science).

Research output: Chapter in Book/Report/Conference proceeding › Conference paper

TY - GEN

T1 - Communicating ASP and the polynomial hierarchy

AU - Bauters, Kim

AU - Schockaert, Steven

AU - De Cock, Martine

AU - Vermeir, Dirk

N1 - James P. Delgrande, Wolfgang Faber

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - answer set programming

KW - communicating agents

M3 - Conference paper

SN - 978-3-642-20894-2

VL - 6645

T3 - Lecture Notes in Computer Science

SP - 67

EP - 79

BT - Proceedings of the 11th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR)

A2 - Delgrande, James P.

A2 - Faber, Wolfgang

PB - Springer Verlag

T2 - Unknown

Y2 - 1 January 2011

ER -

Communicating ASP and the polynomial hierarchy

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Handle.net

Fingerprint

Activities

Unknown (External organisation)

Cite this