Search Results for author: Thomas Bolander

Found 7 papers, 1 papers with code

Attention! Dynamic Epistemic Logic Models of (In)attentive Agents

no code implementations23 Mar 2023 Gaia Belardinelli, Thomas Bolander

We then extend the framework to account for inattentive agents that, instead of assuming nothing happens, may default to a specific truth-value of what they failed to attend to (a sort of prior concerning the unattended atoms).

Learning to Act and Observe in Partially Observable Domains

no code implementations13 Sep 2021 Thomas Bolander, Nina Gierasimczuk, Andrés Occhipinti Liberman

We consider a learning agent in a partially observable environment, with which the agent has never interacted before, and about which it learns both what it can observe and how its actions affect the environment.

Planning from Pixels in Atari with Learned Symbolic Representations

1 code implementation16 Dec 2020 Andrea Dittadi, Frederik K. Drachmann, Thomas Bolander

Width-based planning methods have been shown to yield state-of-the-art performance in the Atari 2600 domain using pixel input.

Cooperative Epistemic Multi-Agent Planning for Implicit Coordination

no code implementations7 Mar 2017 Thorsten Engesser, Thomas Bolander, Robert Mattmüller, Bernhard Nebel

Epistemic planning can be used for decision making in multi-agent situations with distributed knowledge and capabilities.

Decision Making

A Gentle Introduction to Epistemic Planning: The DEL Approach

no code implementations7 Mar 2017 Thomas Bolander

Epistemic planning can be used for decision making in multi-agent situations with distributed knowledge and capabilities.

Decision Making

Learning Action Models: Qualitative Approach

no code implementations15 Jul 2015 Thomas Bolander, Nina Gierasimczuk

In this paper we introduce a framework for studying learnability of action models from observations.

Bisimulation and expressivity for conditional belief, degrees of belief, and safe belief

no code implementations26 Jun 2015 Mikkel Birkegaard Andersen, Thomas Bolander, Hans van Ditmarsch, Martin Holm Jensen

We define that notion of bisimulation and prove the required characterisations: on the class of image-finite and preimage-finite models (with respect to the plausibility relation), two pointed Kripke models are modally equivalent in either of the three logics, if and only if they are bisimilar.

Cannot find the paper you are looking for? You can Submit a new open access paper.