Standard
Epistemic Planning with Attention as a Bounded Resource. / Belardinelli, Gaia; Rendsvig, Rasmus Kræmmer.
Logic, Rationality, and Interaction, 8th International Workshop, LORI 2021, Xi'ian, China, October 16-18, 2021, Proceedings. Vol. LNCS volume 13039 2021. p. 14-30 (Lecture Notes in Computer Science; No. 13039).
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Harvard
Belardinelli, G & Rendsvig, RK 2021,
Epistemic Planning with Attention as a Bounded Resource. in
Logic, Rationality, and Interaction, 8th International Workshop, LORI 2021, Xi'ian, China, October 16-18, 2021, Proceedings. vol. LNCS volume 13039, Lecture Notes in Computer Science, no. 13039, pp. 14-30.
https://doi.org/10.1007/978-3-030-88708-7_2APA
Belardinelli, G., & Rendsvig, R. K. (2021).
Epistemic Planning with Attention as a Bounded Resource. In
Logic, Rationality, and Interaction, 8th International Workshop, LORI 2021, Xi'ian, China, October 16-18, 2021, Proceedings (Vol. LNCS volume 13039, pp. 14-30). Lecture Notes in Computer Science No. 13039
https://doi.org/10.1007/978-3-030-88708-7_2Vancouver
Belardinelli G, Rendsvig RK.
Epistemic Planning with Attention as a Bounded Resource. In Logic, Rationality, and Interaction, 8th International Workshop, LORI 2021, Xi'ian, China, October 16-18, 2021, Proceedings. Vol. LNCS volume 13039. 2021. p. 14-30. (Lecture Notes in Computer Science; No. 13039).
https://doi.org/10.1007/978-3-030-88708-7_2Author
Belardinelli, Gaia ; Rendsvig, Rasmus Kræmmer. / Epistemic Planning with Attention as a Bounded Resource. Logic, Rationality, and Interaction, 8th International Workshop, LORI 2021, Xi'ian, China, October 16-18, 2021, Proceedings. Vol. LNCS volume 13039 2021. pp. 14-30 (Lecture Notes in Computer Science; No. 13039).
Bibtex
@inproceedings{f87360c3178446cea1024a416afd8300,
title = "Epistemic Planning with Attention as a Bounded Resource",
abstract = "Where information grows abundant, attention becomes a scarce resource. As a result, agents must plan wisely how to allocate their attention in order to achieve epistemic efficiency. Here, we present a framework for multi-agent epistemic planning with attention, based on Dynamic Epistemic Logic (DEL, a powerful formalism for epistemic planning). We identify the framework as a fragment of standard DEL, and consider its plan existence problem. While in the general case undecidable, we show that when attention is required for learning, all instances of the problem are decidable. ",
author = "Gaia Belardinelli and Rendsvig, {Rasmus Kr{\ae}mmer}",
year = "2021",
doi = "10.1007/978-3-030-88708-7_2",
language = "English",
volume = "LNCS volume 13039",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
number = "13039",
pages = "14--30",
booktitle = "Logic, Rationality, and Interaction, 8th International Workshop, LORI 2021, Xi'ian, China, October 16-18, 2021, Proceedings",
}
RIS
TY - GEN
T1 - Epistemic Planning with Attention as a Bounded Resource
AU - Belardinelli, Gaia
AU - Rendsvig, Rasmus Kræmmer
PY - 2021
Y1 - 2021
N2 - Where information grows abundant, attention becomes a scarce resource. As a result, agents must plan wisely how to allocate their attention in order to achieve epistemic efficiency. Here, we present a framework for multi-agent epistemic planning with attention, based on Dynamic Epistemic Logic (DEL, a powerful formalism for epistemic planning). We identify the framework as a fragment of standard DEL, and consider its plan existence problem. While in the general case undecidable, we show that when attention is required for learning, all instances of the problem are decidable.
AB - Where information grows abundant, attention becomes a scarce resource. As a result, agents must plan wisely how to allocate their attention in order to achieve epistemic efficiency. Here, we present a framework for multi-agent epistemic planning with attention, based on Dynamic Epistemic Logic (DEL, a powerful formalism for epistemic planning). We identify the framework as a fragment of standard DEL, and consider its plan existence problem. While in the general case undecidable, we show that when attention is required for learning, all instances of the problem are decidable.
U2 - 10.1007/978-3-030-88708-7_2
DO - 10.1007/978-3-030-88708-7_2
M3 - Article in proceedings
VL - LNCS volume 13039
T3 - Lecture Notes in Computer Science
SP - 14
EP - 30
BT - Logic, Rationality, and Interaction, 8th International Workshop, LORI 2021, Xi'ian, China, October 16-18, 2021, Proceedings
ER -
