Communicating ASP and the polynomial hierarchy

Authors:
Kim Bauters;Steven Schockaert;Dirk Vermeir;Martine De Cock
Affiliations:
Department of Applied Mathematics and Computer Science, Universiteit Gent, Krijgslaan, Gent, Belgium;Department of Applied Mathematics and Computer Science, Universiteit Gent, Krijgslaan, Gent, Belgium;Department of Computer Science, Vrije Universiteit Brussel, Brussel, Belgium;Department of Applied Mathematics and Computer Science, Universiteit Gent, Krijgslaan, Gent, Belgium
Venue:
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Year:
2011

Citing 14
Cited 0

The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Multilanguage hierarchical logics, or: how we can do without modal logics

Artificial Intelligence
The computational complexity of propositional STRIPS planning

Artificial Intelligence
The complexity of logic-based abduction

Journal of the ACM (JACM)
Combining answer set programming with description logics for the Semantic Web

Artificial Intelligence
A Logic Language with Stable Model Semantics for Social Reasoning

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Multi-agent Cooperation: A Description Logic View

Multi-Agent Systems for Society
Modular Nonmonotonic Logic Programming Revisited

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Equilibria in heterogeneous nonmonotonic multi-context systems

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Contextual default reasoning

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A uniform integration of higher-order reasoning and external evaluations in answer-set programming

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Minimal and absent information in contexts

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Hierarchical decision making in multi-agent systems using answer set programming

CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
LAIMA: a multi-agent platform using ordered choice logic programming

DALT'05 Proceedings of the Third international conference on Declarative Agent Languages and Technologies

Quantified Score

Hi-index	0.00

Visualization

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.