About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Journal article

DEL-based epistemic planning: Decidability and complexity

From

Department of Applied Mathematics and Computer Science, Technical University of Denmark1

Algorithms and Logic, Department of Applied Mathematics and Computer Science, Technical University of Denmark2

Université de Rennes3

Epistemic planning can be used for decision making in multi-agent systems with distributed knowledge and capabilities. Dynamic Epistemic Logic (DEL) has been shown to provide a very natural and expressive framework for epistemic planning. In this paper, we present a systematic overview of known complexity and decidability results for epistemic planning based on DEL, as well as provide some new results and improved proofs of existing results based on reductions between the problems.

Language: English
Year: 2020
Pages: 103304
ISSN: 18727921 and 00043702
Types: Journal article
DOI: 10.1016/j.artint.2020.103304
ORCIDs: Bolander, Thomas

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user

Access

Analysis