default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Bolander
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c30]Thomas Bolander, Alessandro Burigana:
Better Bounded Bisimulation Contractions. AiML 2024: 249-268- [i9]Thomas Bolander, Alessandro Burigana:
Better Bounded Bisimulation Contractions (Preprint). CoRR abs/2405.00480 (2024) - [i8]Thomas Bolander, Alessandro Burigana, Marco Montali:
Depth-Bounded Epistemic Planning. CoRR abs/2406.01139 (2024) - 2023
- [j14]Vaishak Belle, Thomas Bolander
, Andreas Herzig, Bernhard Nebel:
Epistemic planning: Perspectives on the special issue. Artif. Intell. 316: 103842 (2023) - [j13]Thomas Bolander, Arnaud Lequen:
Parameterized Complexity of Dynamic Belief Updates: A Complete Map. J. Log. Comput. 33(6): 1270-1300 (2023) - [c29]Gaia Belardinelli, Thomas Bolander:
Attention! Dynamic Epistemic Logic Models of (In)attentive Agents. AAMAS 2023: 391-399 - [i7]Gaia Belardinelli, Thomas Bolander:
Attention! Dynamic Epistemic Logic Models of (In)attentive Agents. CoRR abs/2303.13494 (2023) - 2021
- [c28]Andrea Dittadi, Frederik K. Drachmann, Thomas Bolander:
Planning from Pixels in Atari with Learned Symbolic Representations. AAAI 2021: 4941-4949 - [c27]Thomas Bolander, Lasse Dissing, Nicolai Herrmann:
DEL-based Epistemic Planning for Human-Robot Collaboration: Theory and Implementation. KR 2021: 120-129 - [i6]Thomas Bolander, Nina Gierasimczuk, Andrés Occhipinti Liberman:
Learning to Act and Observe in Partially Observable Domains. CoRR abs/2109.06076 (2021) - 2020
- [j12]Thomas Bolander, Tristan Charrier, Sophie Pinchinat, François Schwarzentruber:
DEL-based epistemic planning: Decidability and complexity. Artif. Intell. 287: 103304 (2020) - [c26]Thomas Bolander, Jacob Pjetursson:
Synthesizing human-friendly optimal strategies in board games. CoG 2020: 112-119 - [c25]Thomas Bolander, Arnaud Lequen:
Parameterized Complexity of Dynamic Belief Updates. DaLí 2020: 87-102 - [c24]Lasse Dissing, Thomas Bolander:
Implementing Theory of Mind on a Robot Using Dynamic Epistemic Logic. IJCAI 2020: 1615-1621 - [i5]Thomas Bolander, Robin Engelhardt, Thomas S. Nicolet:
The Curse of Shared Knowledge: Recursive Belief Reasoning in a Coordination Game with Imperfect Information. CoRR abs/2008.08849 (2020) - [i4]Andrea Dittadi, Frederik K. Drachmann, Thomas Bolander:
Planning From Pixels in Atari With Learned Symbolic Representations. CoRR abs/2012.09126 (2020)
2010 – 2019
- 2019
- [j11]Bernhard Nebel, Thomas Bolander, Thorsten Engesser, Robert Mattmüller:
Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity. J. Artif. Intell. Res. 64: 497-527 (2019) - [c23]Bernhard Nebel, Thomas Bolander, Thorsten Engesser, Robert Mattmüller:
Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity (Extended Abstract). IJCAI 2019: 6372-6376 - [c22]Thomas Bolander, Thorsten Engesser, Andreas Herzig, Robert Mattmüller, Bernhard Nebel:
The Dynamic Logic of Policies and Contingent Planning. JELIA 2019: 659-674 - 2018
- [j10]Thomas Bolander, Nina Gierasimczuk:
Learning to act: qualitative learning of deterministic action models. J. Log. Comput. 28(2): 337-365 (2018) - [j9]Jens Ulrik Hansen, Thomas Bolander, Torben Braüner:
Many-valued hybrid logic. J. Log. Comput. 28(5): 883-908 (2018) - [c21]Andrea Dittadi, Thomas Bolander, Ole Winther:
Learning to Plan from Raw Data in Grid-based Games. GCAI 2018: 54-67 - [c20]Thomas Bolander, Thorsten Engesser, Robert Mattmüller, Bernhard Nebel:
Better Eager Than Lazy? How Agent Types Impact the Successfulness of Implicit Coordination. KR 2018: 445-453 - 2017
- [j8]Patrick Blackburn, Thomas Bolander, Torben Braüner, Klaus Frovin Jørgensen:
Completeness and termination for a Seligman-style tableau system. J. Log. Comput. 27(1): 81-107 (2017) - [j7]Mikkel Birkegaard Andersen, Thomas Bolander, Hans van Ditmarsch, Martin Holm Jensen:
Bisimulation and expressivity for conditional belief, degrees of belief, and safe belief. Synth. 194(7): 2447-2487 (2017) - [c19]Thomas Bolander:
A Gentle Introduction to Epistemic Planning: The DEL Approach. M4M@ICLA 2017: 1-22 - [c18]Thorsten Engesser, Thomas Bolander, Robert Mattmüller, Bernhard Nebel:
Cooperative Epistemic Multi-Agent Planning for Implicit Coordination. M4M@ICLA 2017: 75-90 - [i3]Chitta Baral, Thomas Bolander, Hans van Ditmarsch, Sheila A. McIlraith:
Epistemic Planning (Dagstuhl Seminar 17231). Dagstuhl Reports 7(6): 1-47 (2017) - 2016
- [j6]Thomas Bolander, Hans van Ditmarsch, Andreas Herzig, Emiliano Lorini, Pere Pardo, François Schwarzentruber:
Announcements to Attentive Agents. J. Log. Lang. Inf. 25(1): 1-35 (2016) - [c17]Klaus Frovin Jørgensen, Patrick Blackburn, Thomas Bolander, Torben Braüner:
Synthetic completeness proofs for Seligman-style tableau systems. Advances in Modal Logic 2016: 302-321 - 2015
- [c16]Thomas Bolander, Martin Holm Jensen, François Schwarzentruber:
Complexity Results in Epistemic Planning. IJCAI 2015: 2791-2797 - [c15]Thomas Bolander, Nina Gierasimczuk:
Learning Actions Models: Qualitative Approach. LORI 2015: 40-52 - [i2]Mikkel Birkegaard Andersen, Thomas Bolander, Hans van Ditmarsch, Martin Holm Jensen:
Bisimulation and expressivity for conditional belief, degrees of belief, and safe belief. CoRR abs/1506.07990 (2015) - [i1]Thomas Bolander, Nina Gierasimczuk:
Learning Action Models: Qualitative Approach. CoRR abs/1507.04285 (2015) - 2014
- [c14]Thomas Bolander:
Seeing is Believing: Formalising False-Belief Tasks in Dynamic Epistemic Logic. ECSI 2014: 87-107 - 2013
- [c13]Mikkel Birkegaard Andersen, Thomas Bolander, Hans van Ditmarsch, Martin Holm Jensen:
Bisimulation for Single-Agent Plausibility Models. Australasian Conference on Artificial Intelligence 2013: 277-288 - [c12]Guillaume Aucher, Thomas Bolander:
Undecidability in Epistemic Planning. IJCAI 2013: 27-33 - [c11]Patrick Blackburn, Thomas Bolander, Torben Braüner, Klaus Frovin Jørgensen:
A Seligman-Style Tableau System. LPAR 2013: 147-163 - 2012
- [c10]Mikkel Birkegaard Andersen, Thomas Bolander, Martin Holm Jensen:
Conditional Epistemic Planning. JELIA 2012: 94-106 - [e4]Thomas Bolander, Torben Braüner, Silvio Ghilardi, Lawrence S. Moss:
Advances in Modal Logic 9, papers from the ninth conference on "Advances in Modal Logic," held in Copenhagen, Denmark, 22-25 August 2012. College Publications 2012, ISBN 978-1-84890-068-4 [contents] - 2011
- [j5]Thomas Bolander, Mikkel Birkegaard Andersen:
Epistemic planning for single and multi-agent systems. J. Appl. Non Class. Logics 21(1): 9-34 (2011) - [e3]Thomas Bolander, Torben Braüner:
International Workshop on Hybrid Logic and Applications 2010, HyLo@LICS 2010, Edinburgh, Scotland, UK, July 10, 2010. Electronic Notes in Theoretical Computer Science 273, Elsevier 2011 [contents] - 2010
- [j4]Thomas Bolander, René Rydhof Hansen:
Hybrid logical analyses of the ambient calculus. Inf. Comput. 208(5): 433-449 (2010) - [c9]Thomas Bolander, Torben Braüner:
Preface. HyLo@LICS 2010: 1-2 - [e2]Thomas Bolander, Torben Braüner:
Proceedings of the 6th Workshop on Methods for Modalities, M4M-6 2009, Copenhagen, Denmark, November 12-14, 2009. Electronic Notes in Theoretical Computer Science 262, Elsevier 2010 [contents]
2000 – 2009
- 2009
- [j3]Torben Braüner, Thomas Bolander:
Preface. J. Log. Lang. Inf. 18(4): 435-436 (2009) - [c8]Thomas Bolander, Torben Braüner:
Preface. M4M 2009: 1-2 - 2008
- [c7]Jens Hansen, Thomas Bolander, Torben Braüner:
Many-valued hybrid logic. Advances in Modal Logic 2008: 111-132 - 2007
- [j2]Thomas Bolander, Patrick Blackburn:
Termination for Hybrid Tableaus. J. Log. Comput. 17(3): 517-554 (2007) - [c6]Thomas Bolander, René Rydhof Hansen:
Hybrid Logical Analyses of the Ambient Calculus. WoLLIC 2007: 83-100 - [c5]Thomas Bolander, Patrick Blackburn:
Terminating Tableau Calculi for Hybrid Logics Extending K. M4M 2007: 21-39 - [e1]Patrick Blackburn, Thomas Bolander, Torben Braüner, Valeria de Paiva, Jørgen Villadsen:
Proceedings of the International Workshop on Hybrid Logic, HyLo@FLoC 2006, Seattle, WA, USA, August 11, 2006. Electronic Notes in Theoretical Computer Science 174(6), Elsevier 2007 [contents] - 2006
- [j1]Thomas Bolander, Torben Braüner:
Tableau-based Decision Procedures for Hybrid Logic. J. Log. Comput. 16(6): 737-763 (2006) - [c4]Patrick Blackburn, Thomas Bolander, Torben Braüner, Valeria de Paiva, Jørgen Villadsen:
Preface. HyLo@FLoC 2006: 1-2 - [c3]Thomas Bolander, Jens Ulrik Hansen, Michael R. Hansen:
Decidability of a Hybrid Duration Calculus. HyLo@FLoC 2006: 113-133 - 2003
- [c2]Thomas Bolander:
From Logic Programming Semantics to the Consistency of Syntactical Treatments of Knowledge and Belief. IJCAI 2003: 443-448 - 2002
- [c1]Thomas Bolander:
Maximal Introspection of Agents. CLIMA 2002: 183-198
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
