default search action
Hans van Ditmarsch
Hans P. van Ditmarsch
Person information
- affiliation: CNRS, France
- affiliation (former): University of Seville, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j90]Armando Castañeda
, Hans van Ditmarsch, David A. Rosenblueth, Diego A. Velázquez
Pattern Models: A Dynamic Epistemic Logic For Distributed Systems. Comput. J. 67(7): 2421-2440 (2024) - [j89]Raphaela Butz
Evaluating the Usefulness of Counterfactual Explanations from Bayesian Networks. Hum. Centric Intell. Syst. 4(2): 286-298 (2024) - [j88]Hans van Ditmarsch, Sunil Simon:
Boolean Observation Games. J. Artif. Intell. Res. 79: 307-357 (2024) - [c85]Philippe Balbiani, Hans van Ditmarsch:
Towards Dynamic Distributed Knowledge. AiML 2024: 125-146 - [c84]Marta Bílková, Hans van Ditmarsch, Roman Kuznets, Rojo Randrianomentsoa:
Bisimulation for Impure Simplicial Complexes. AiML 2024: 225-248 - [c83]Hans van Ditmarsch
A Logic for Repair and State Recovery in Byzantine Fault-Tolerant Multi-agent Systems. IJCAR (2) 2024: 114-134 - [i40]Hans van Ditmarsch, Krisztina Fruzsa, Roman Kuznets
A Logic for Repair and State Recovery in Byzantine Fault-tolerant Multi-agent Systems. CoRR abs/2401.06451 (2024) - [i39]Thomas Ågotnes, Hans van Ditmarsch, Tim French:
The Undecidability of Quantified Announcements. CoRR abs/2405.15671 (2024) - [i38]Marta Bílková, Hans van Ditmarsch, Roman Kuznets
Bisimulation for Impure Simplicial Complexes. CoRR abs/2406.16785 (2024) - 2023
- [j87]Hans van Ditmarsch
To be announced. Inf. Comput. 292: 105026 (2023) - [j86]Hans van Ditmarsch
An Epistemic Separation Logic with Action Models. J. Log. Lang. Inf. 32(1): 89-116 (2023) - [j85]Armando Castañeda, Hans van Ditmarsch
Communication Pattern Logic: Epistemic and Topological Views. J. Philos. Log. 52(5): 1445-1473 (2023) - [j84]Rojo Fanamperana Randrianomentsoa
Impure Simplicial Complexes: Complete Axiomatization. Log. Methods Comput. Sci. 19(4) (2023) - [j83]Natasha Alechina
The Expressivity of Quantified Group Announcements. J. Log. Comput. 33(6): 1122-1151 (2023) - [j82]Hans van Ditmarsch, Mo Liu, Louwe B. Kuijer, Igor Sedlár:
Almost APAL. J. Log. Comput. 33(6): 1350-1378 (2023) - [j81]Hans van Ditmarsch
Everyone Knows That Everyone Knows: Gossip Protocols for Super Experts. Stud Logica 111(3): 453-499 (2023) - [c82]Hans van Ditmarsch, Louwe B. Kuijer, Mo Liu:
An Arrow-Based Dynamic Logic of Normative Systems and Its Decidability. LORI 2023: 63-76 - [c81]Hans van Ditmarsch, Didier Galmiche, Marta Gawek:
A Separation Logic with Histories of Epistemic Actions as Resources. WoLLIC 2023: 161-177 - [c80]Hans van Ditmarsch, Roman Kuznets
On Two- and Three-valued Semantics for Impure Simplicial Complexes. GandALF 2023: 50-66 - [c79]Armando Castañeda, Hans van Ditmarsch, David A. Rosenblueth, Diego A. Velázquez:
Comparing the Update Expressivity of Communication Patterns and Action Models. TARK 2023: 157-172 - [i37]Armando Castañeda, Hans van Ditmarsch, Roman Kuznets
Epistemic and Topological Reasoning in Distributed Systems (Dagstuhl Seminar 23272). Dagstuhl Reports 13(7): 34-65 (2023) - 2022
- [j80]Hans van Ditmarsch, Tim French
Quantifying over Boolean announcements. Log. Methods Comput. Sci. 18(1) (2022) - [j79]Philippe Balbiani, Hans van Ditmarsch, Saúl Fernández González
Asynchronous Announcements. ACM Trans. Comput. Log. 23(2): 10:1-10:38 (2022) - [c78]Krisztina Fruzsa, Roman Kuznets, Hans van Ditmarsch:
A New Hope. AiML 2022: 349-369 - [c77]Hans van Ditmarsch
The Limits to Gossip: Second-Order Shared Knowledge of All Secrets is Unsatisfiable. WoLLIC 2022: 237-249 - [i36]Hans van Ditmarsch, Sunil Simon:
Boolean Observation Games. CoRR abs/2202.03637 (2022) - [i35]Hans van Ditmarsch, Tim French, Rustam Galimullin
Satisfiability of Quantified Boolean Announcements. CoRR abs/2206.00903 (2022) - [i34]Armando Castañeda, Hans van Ditmarsch, David A. Rosenblueth, Diego A. Velázquez:
Communication Pattern Logic: Epistemic and Topological Views. CoRR abs/2207.00823 (2022) - [i33]Hao Wu, Hans van Ditmarsch, Jinsheng Chen:
A Labelled Sequent Calculus for Public Announcement Logic. CoRR abs/2207.10262 (2022) - [i32]Rojo Randrianomentsoa, Hans van Ditmarsch, Roman Kuznets
Impure Simplicial Complexes: Complete Axiomatization. CoRR abs/2211.13543 (2022) - 2021
- [j78]Hans van Ditmarsch, David Fernández-Duque, Vaishnavi Sundararajan, S. P. Suresh:
Who holds the best card? Secure communication of optimal secret bits. Australas. J Comb. 80: 1-29 (2021) - [j77]Carlos Areces
Copy and remove as dynamic operators. J. Appl. Non Class. Logics 31(3-4): 181-220 (2021) - [j76]Hans van Ditmarsch, Éric Goubault, Marijana Lazic, Jérémy Ledent
A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks. J. Log. Algebraic Methods Program. 121: 100662 (2021) - [j75]Natasha Alechina
Verification and Strategy Synthesis for Coalition Announcement Logic. J. Log. Lang. Inf. 30(4): 671-700 (2021) - [j74]Hans van Ditmarsch
Positive Announcements. Stud Logica 109(3): 639-681 (2021) - [c76]Hans van Ditmarsch:
Wanted Dead or Alive: Epistemic Logic for Impure Simplicial Complexes. WoLLIC 2021: 31-46 - [c75]Hans van Ditmarsch, Tim French
No Finite Model Property for Logics of Quantified Announcements. TARK 2021: 129-138 - [i31]Hans van Ditmarsch:
Wanted Dead or Alive : Epistemic logic for impure simplicial complexes. CoRR abs/2103.03032 (2021) - [i30]Jinsheng Chen, Hans van Ditmarsch, Giuseppe Greco, Apostolos Tzimoulis:
Neighbourhood semantics for graded modal logic. CoRR abs/2105.09202 (2021) - 2020
- [j73]Hans van Ditmarsch, Wiebe van der Hoek
The logic of gossiping. Artif. Intell. 286: 103306 (2020) - [j72]Zeinab Bakhtiari, Hans van Ditmarsch, Umberto Rivieccio:
Bilattice logic of epistemic actions and knowledge. Ann. Pure Appl. Log. 171(6): 102790 (2020) - [j71]Hans van Ditmarsch, Wiebe van der Hoek
Arrow update synthesis. Inf. Comput. 275: 104544 (2020) - [j70]Hans van Ditmarsch, Petra Hendriks
Editors' Review and Introduction: Lying in Logic, Language, and Cognition. Top. Cogn. Sci. 12(2): 466-484 (2020) - [c74]Philippe Balbiani, Hans van Ditmarsch, Saúl Fernández González:
Quantifying over Asynchronous Information Change. AiML 2020: 33-52 - [c73]Hans van Ditmarsch
Expressivity of Some Versions of APAL. DaLí 2020: 120-136 - [c72]Philippe Balbiani
From Public Announcements to Asynchronous Announcements. ECAI 2020: 75-82 - [i29]Hans van Ditmarsch, Eric Goubault, Jérémy Ledent, Sergio Rajsbaum:
Knowledge and simplicial complexes. CoRR abs/2002.08863 (2020) - [i28]Hans van Ditmarsch:
Quantifying Notes Revisited. CoRR abs/2004.05802 (2020) - [i27]Hans van Ditmarsch, Malvin Gattinger, Rahim Ramezanian:
Everyone Knows that Everyone Knows: Gossip Protocols for Super Experts. CoRR abs/2011.13203 (2020)
2010 – 2019
- 2019
- [j69]Liangda Fang, Yongmei Liu, Hans van Ditmarsch:
Forgetting in multi-agent modal logics. Artif. Intell. 266: 51-80 (2019) - [j68]Hans van Ditmarsch, Malvin Gattinger, Louwe B. Kuijer, Pere Pardo:
Strengthening Gossip Protocols using Protocol-Dependent Knowledge. FLAP 6(1): 157-203 (2019) - [j67]Jean-René Courtault, Hans van Ditmarsch, Didier Galmiche:
A public announcement separation logic. Math. Struct. Comput. Sci. 29(6): 828-871 (2019) - [j66]Minghui Ma, Hans van Ditmarsch:
Dynamic Graded Epistemic Logic. Rev. Symb. Log. 12(4): 663-684 (2019) - [j65]Hans van Ditmarsch:
Correction to: Dynamics of lying. Synth. 196(6): 2543 (2019) - [j64]Hans van Ditmarsch, Sophia Knight
Announcement as effort on topological spaces. Synth. 196(7): 2927-2969 (2019) - [c71]Tim French, Rustam Galimullin, Hans van Ditmarsch, Natasha Alechina:
Groups Versus Coalitions: On the Relative Expressivity of GAL and CAL. AAMAS 2019: 953-961 - [c70]Hans van Ditmarsch
Reachability of Five Gossip Protocols. RP 2019: 218-231 - [c69]Hans van Ditmarsch, Louwe B. Kuijer:
Knowledge Without Complete Certainty. WoLLIC 2019: 619-632 - [i26]Hans van Ditmarsch, Malvin Gattinger, Louwe B. Kuijer, Pere Pardo:
Strengthening Gossip Protocols using Protocol-Dependent Knowledge. CoRR abs/1907.12321 (2019) - 2018
- [j63]Hans van Ditmarsch, Tim French
Implicit, explicit and speculative knowledge. Artif. Intell. 256: 35-67 (2018) - [j62]Hans van Ditmarsch, Sophia Knight
Private Announcements on Topological Spaces. Stud Logica 106(3): 481-513 (2018) - [j61]Thomas Ågotnes, Hans van Ditmarsch
True lies. Synth. 195(10): 4581-4615 (2018) - [c68]Rustam Galimullin
Model Checking for Coalition Announcement Logic. KI 2018: 11-23 - [i25]Hans van Ditmarsch, Wiebe van der Hoek, Barteld Kooi, Louwe B. Kuijer:
Arrow Update Synthesis. CoRR abs/1802.00914 (2018) - [i24]Hans van Ditmarsch, Tim French, James Hales:
Positive Announcements. CoRR abs/1803.01696 (2018) - [i23]Zeinab Bakhtiari, Hans van Ditmarsch, Abdallah Saffidine:
How does uncertainty about other voters determine a strategic vote? CoRR abs/1809.10489 (2018) - 2017
- [j60]Hans van Ditmarsch, Wiebe van der Hoek
Arbitrary arrow update logic. Artif. Intell. 242: 80-106 (2017) - [j59]Carlos Areces
The modal logic of copy and remove. Inf. Comput. 255: 243-261 (2017) - [j58]Hans van Ditmarsch, Jan van Eijck, Pere Pardo
Epistemic protocols for dynamic gossip. J. Appl. Log. 20: 1-31 (2017) - [j57]Mikkel Birkegaard Andersen, Thomas Bolander
Bisimulation and expressivity for conditional belief, degrees of belief, and safe belief. Synth. 194(7): 2447-2487 (2017) - [j56]Hans van Ditmarsch, Wiebe van der Hoek
The undecidability of arbitrary arrow update logic. Theor. Comput. Sci. 693: 1-12 (2017) - [c67]Hans van Ditmarsch
The Expected Duration of Sequential Gossiping. EUMAS/AT 2017: 131-146 - [c66]Zeinab Bakhtiari, Hans van Ditmarsch, Helle Hvid Hansen
Neighbourhood Contingency Bisimulation. ICLA 2017: 48-63 - [c65]Christophe Chareton, Hans van Ditmarsch:
Strategic Knowledge of the Past in Quantum Cryptography. LORI 2017: 347-361 - [c64]Hans van Ditmarsch, Ioannis Kokkinis
Reachability and Expectation in Gossiping. PRIMA 2017: 93-109 - [c63]Hans van Ditmarsch, Michael Ian Hartley, Barteld Kooi, Jonathan Welton, Joseph B. W. Yeo
Cheryl's Birthday. TARK 2017: 1-9 - [c62]Francesco Belardinelli
A Logic for Global and Local Announcements. TARK 2017: 28-42 - [i22]Hans van Ditmarsch:
Asynchronous Announcements. CoRR abs/1705.03392 (2017) - [i21]Hans van Ditmarsch, Tim French:
Quantifying over boolean announcements. CoRR abs/1712.05310 (2017) - [i20]Chitta Baral, Thomas Bolander
Epistemic Planning (Dagstuhl Seminar 17231). Dagstuhl Reports 7(6): 1-47 (2017) - 2016
- [j55]Hans van Ditmarsch, Jie Fan:
Propositional quantification in logics of contingency. J. Appl. Non Class. Logics 26(1): 81-102 (2016) - [j54]Thomas Bolander
Announcements to Attentive Agents. J. Log. Lang. Inf. 25(1): 1-35 (2016) - [j53]Thomas Ågotnes, Hans van Ditmarsch, Timothy Noel French
The Undecidability of Quantified Announcements. Stud Logica 104(4): 597-640 (2016) - [c61]Zeinab Bakhtiari, Hans van Ditmarsch, Sabine Frittella
Algebraic semantics of refinement modal logic. Advances in Modal Logic 2016: 38-57 - [c60]Philippe Balbiani, Hans van Ditmarsch, Andreas Herzig:
Before announcement. Advances in Modal Logic 2016: 58-77 - [c59]Hans van Ditmarsch, Wiebe van der Hoek, Louwe B. Kuijer:
Fully Arbitrary Public Announcements. Advances in Modal Logic 2016: 252-267 - [c58]Francesco Belardinelli
Second-order Propositional Announcement Logic. AAMAS 2016: 635-643 - [c57]Hans van Ditmarsch:
Epistemic Gossip Protocols. CLAR 2016: 1 - [c56]Liangda Fang, Yongmei Liu, Hans van Ditmarsch:
Forgetting in Multi-Agent Modal Logics. IJCAI 2016: 1066-1073 - [i19]Thomas Ågotnes, Hans van Ditmarsch, Yanjing Wang:
True Lies. CoRR abs/1606.08333 (2016) - [i18]Hans van Ditmarsch, Wiebe van der Hoek, Louwe B. Kuijer:
The Undecidability of Arbitrary Arrow Update Logic. CoRR abs/1609.05686 (2016) - 2015
- [b1]Hans van Ditmarsch, Barteld Kooi:
One Hundred Prisoners and a Light Bulb. Springer 2015, ISBN 978-3-319-16693-3, pp. I-IX, 1-188 - [j52]Andrés Cordón-Franco
A geometric protocol for cryptography with cards. Des. Codes Cryptogr. 74(1): 113-125 (2015) - [j51]Hans van Ditmarsch, Petar Iliev:
The succinctness of the cover modality. J. Appl. Non Class. Logics 25(4): 373-405 (2015) - [j50]Jie Fan, Yanjing Wang
Contingency and Knowing Whether. Rev. Symb. Log. 8(1): 75-107 (2015) - [j49]Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat:
The complexity of one-agent refinement modal logic. Theor. Comput. Sci. 603: 58-83 (2015) - [c55]Jie Fan, Hans van Ditmarsch:
Neighborhood Contingency Logic. ICLA 2015: 88-99 - [c54]Jean-René Courtault, Hans van Ditmarsch, Didier Galmiche:
An Epistemic Separation Logic. WoLLIC 2015: 156-173 - [c53]Hans van Ditmarsch, Sophia Knight
Announcement as effort on topological spaces. TARK 2015: 283-297 - [i17]Hans van Ditmarsch, Joseph Y. Halpern, Wiebe van der Hoek, Barteld P. Kooi:
An Introduction to Logics of Knowledge and Belief. CoRR abs/1503.00806 (2015) - [i16]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) - [i15]Hans van Ditmarsch, Jan van Eijck, Pere Pardo, Rahim Ramezanian, François Schwarzentruber:
Dynamic Gossip. CoRR abs/1511.00867 (2015) - 2014
- [j48]Hans van Ditmarsch, Sujata Ghosh, Rineke Verbrugge, Yanjing Wang
Hidden protocols: Modifying our expectations in an evolving world. Artif. Intell. 208: 18-40 (2014) - [j47]Laura Bozzelli, Hans van Ditmarsch, Tim French
Refinement modal logic. Inf. Comput. 239: 303-339 (2014) - [j46]Giacomo Bonanno, Hans van Ditmarsch, Wiebe van der Hoek
Introduction. IGTR 16(1) (2014) - [j45]Hans van Ditmarsch, Tim French
Semantics for Knowledge and Change of Awareness. J. Log. Lang. Inf. 23(2): 169-195 (2014) - [j44]Hans van Ditmarsch, David Fernández-Duque
On the definability of simulation and bisimulation in epistemic logic. J. Log. Comput. 24(6): 1209-1227 (2014) - [j43]Hans van Ditmarsch:
Dynamics of lying. Synth. 191(5): 745-777 (2014) - [c52]Hans van Ditmarsch, Jie Fan, Wiebe van der Hoek, Petar Iliev:
Some Exponential Lower Bounds on Formula-size in Modal Logic. Advances in Modal Logic 2014: 139-157 - [c51]Jie Fan, Yanjing Wang, Hans van Ditmarsch:
Almost Necessary. Advances in Modal Logic 2014: 178-196 - [c50]Thomas Ågotnes, Hans van Ditmarsch, Tim French:
The undecidability of group announcements. AAMAS 2014: 893-900 - [c49]Hans van Ditmarsch, Sophia Knight
Partial Information and Uniform Strategies. CLIMA 2014: 183-198 - [c48]Maduka Attamah, Hans van Ditmarsch, Davide Grossi
Knowledge and Gossip. ECAI 2014: 21-26 - [c47]Maduka Attamah, Hans van Ditmarsch, Davide Grossi
A Framework for Epistemic Gossip Protocols. EUMAS 2014: 193-209 - [c46]Hans van Ditmarsch, Sophia Knight
Arbitrary Announcements on Topological Subset Spaces. EUMAS 2014: 252-266 - [c45]Hans van Ditmarsch:
The Ditmarsch Tale of Wonders. KI 2014: 1-12 - [c44]Carlos Areces
Logics with Copy and Remove. WoLLIC 2014: 51-65 - [p3]Thomas Ågotnes, Hans van Ditmarsch:
Knowledge Games and Coalitional Abilities. Johan van Benthem on Logic and Information Dynamics 2014: 451-485 - [i14]Philippe Balbiani, Hans van Ditmarsch:
A simple proof of the completeness of APAL. CoRR abs/1409.2612 (2014) - 2013
- [j42]Hans van Ditmarsch, Wiebe van der Hoek
Connecting dynamic epistemic and temporal epistemic logics. Log. J. IGPL 21(3): 380-403 (2013) - [j41]Giacomo Bonanno, Hans van Ditmarsch, Wiebe van der Hoek
Editorial Introduction to the Special Issue LOFT Sevilla. J. Philos. Log. 42(6): 795-798 (2013) - [j40]Andrés Cordón-Franco, Hans van Ditmarsch, Ángel Nepomuceno-Fernández:
Dynamic Consequence and Public announcement. Rev. Symb. Log. 6(4): 659-679 (2013) - [j39]Hans van Ditmarsch:
Revocable Belief Revision. Stud Logica 101(6): 1185-1214 (2013) - [j38]Hans van Ditmarsch, Jérôme Lang:
Editorial introduction to the special issue LORI Guangzhou. Synth. 190(Supplement-1): 1-4 (2013) - [j37]Andrés Cordón-Franco
A colouring protocol for the generalized Russian cards problem. Theor. Comput. Sci. 495: 81-95 (2013) - [c43]Mikkel Birkegaard Andersen, Thomas Bolander
Bisimulation for Single-Agent Plausibility Models. Australasian Conference on Artificial Intelligence 2013: 277-288 - [c42]Philippe Balbiani
Subset Space Logic with Arbitrary Announcements. ICLA 2013: 233-244 - [c41]Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat:
The Complexity of One-Agent Refinement Modal Logic. IJCAI 2013: 2977-2981 - [c40]Hans van Ditmarsch, Andreas Herzig, Emiliano Lorini, François Schwarzentruber
Listen to Me! Public Announcements to Agents That Pay Attention - or Not. LORI 2013: 96-109 - [c39]Hans van Ditmarsch, Tim French, Fernando R. Velázquez-Quesada, Yì N. Wáng:
Knowledge, awareness, and bisimulation. TARK 2013 - [c38]Hans van Ditmarsch, Jérôme Lang, Abdallah Saffidine:
Strategic voting and the logic of knowledge. TARK 2013 - [i13]Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque, Fernando Soler-Toscano:
A geometric protocol for cryptography with cards. CoRR abs/1301.4289 (2013) - [i12]Hans van Ditmarsch, Tim French, Fernando R. Velázquez-Quesada, Yi Nicholas Wang:
Knowledge, Awareness, and Bisimulation. CoRR abs/1310.6410 (2013) - [i11]Hans van Ditmarsch, Jérôme Lang, Abdallah Saffidine:
Strategic Voting and the Logic of Knowledge. CoRR abs/1310.6436 (2013) - [i10]Jie Fan, Yanjing Wang, Hans van Ditmarsch:
Knowing Whether. CoRR abs/1312.0144 (2013) - 2012
- [j36]Hans van Ditmarsch, Wiebe van der Hoek
Local properties in modal logic. Artif. Intell. 187: 133-155 (2012) - [j35]Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque, Joost J. Joosten, Fernando Soler-Toscano:
A secure additive protocol for card players. Australas. J Comb. 54: 163-176 (2012) - [j34]Hans van Ditmarsch, Andreas Herzig, Tiago de Lima:
Public announcements, public assignments and the complexity of their logic. J. Appl. Non Class. Logics 22(3): 249-273 (2012) - [j33]Hans van Ditmarsch:
Johan van Benthem, Modal Logic for Open Minds, CSLI Lecture Notes, Stanford University, 2010, pp. 350. ISBN: 9781575865997 (hardcover) US $70.00, ISBN: 9781575865980 (paperback) US $30.00. Stud Logica 100(5): 1055-1057 (2012) - [c37]Hans van Ditmarsch, Tim French, Fernando R. Velázquez-Quesada:
Action models for knowledge and awareness. AAMAS 2012: 1091-1098 - [c36]Hans van Ditmarsch, Jérôme Lang, Abdallah Saffidine:
Strategic voting and the logic of knowledge. AAMAS 2012: 1247-1248 - [c35]Philippe Balbiani, Hans van Ditmarsch, Andreas Herzig, Tiago de Lima:
Some Truths Are Best Left Unsaid. Advances in Modal Logic 2012: 36-54 - [c34]Laura Bozzelli, Hans van Ditmarsch, Sophie Pinchinat:
The Complexity of One-Agent Refinement Modal Logic. JELIA 2012: 120-133 - [c33]Ignacio Hernández-Antón, Fernando Soler-Toscano
Unconditionally Secure Protocols with Genetic Algorithms. PAAMS (Special Sessions) 2012: 121-128 - [c32]Hans van Ditmarsch, Jan van Eijck, Ignacio Hernández-Antón, Floor Sietsma, Sunil Simon, Fernando Soler-Toscano
Modelling Cryptographic Keys in Dynamic Epistemic Logic with DEMO. PAAMS (Special Sessions) 2012: 155-162 - [c31]Thomas Ågotnes, Hans van Ditmarsch:
Coalitional Public Announcement Games. PRIMA 2012: 1-15 - [c30]Hans van Ditmarsch:
Quantifying Notes. WoLLIC 2012: 89-109 - [p2]Hans van Ditmarsch, Jan van Eijck, Floor Sietsma, Yanjing Wang
On the Logic of Lying. Games, Actions and Social Software 2012: 41-72 - [i9]Laura Bozzelli, Hans van Ditmarsch, Tim French, James Hales, Sophie Pinchinat:
Refinement Modal Logic. CoRR abs/1202.3538 (2012) - [i8]Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque, Fernando Soler-Toscano:
A colouring protocol for the generalized Russian cards problem. CoRR abs/1207.5216 (2012) - 2011
- [j32]Thomas Ågotnes, Johan van Benthem, Hans van Ditmarsch, Stefan Minica:
Question-answer games. J. Appl. Non Class. Logics 21(3-4): 265-288 (2011) - [j31]Hans van Ditmarsch, Rohit Parikh, Ramaswamy Ramanujam:
Logic in India - Editorial Introduction. J. Philos. Log. 40(5): 557-561 (2011) - [j30]Hans van Ditmarsch, Rineke Verbrugge:
The rules of the game are changing: Scientific impact factors and publication strategies among logicians. J. Log. Comput. 21(2): 121-132 (2011) - [j29]Hans van Ditmarsch, Andreas Herzig, Tiago de Lima:
From Situation Calculus to Dynamic Epistemic Logic. J. Log. Comput. 21(2): 179-204 (2011) - [j28]Thomas Ågotnes, Hans van Ditmarsch:
What will they say? - Public Announcement Games. Synth. 179(Supplement-1): 57-85 (2011) - [c29]Hans van Ditmarsch, Wiebe van der Hoek, Barteld P. Kooi:
Reasoning about local properties in modal logic. AAMAS 2011: 711-718 - [c28]Hans van Ditmarsch, Tim French:
On the Interactions of Awareness and Certainty. Australasian Conference on Artificial Intelligence 2011: 727-738 - [c27]Hans van Ditmarsch, Fernando Soler-Toscano
Three Steps. CLIMA 2011: 41-57 - [c26]Hans van Ditmarsch, David Fernández-Duque
On the Definability of Simulability and Bisimilarity by Finite Epistemic Models. CLIMA 2011: 74-87 - [c25]Michael H. Albert, Andrés Cordón-Franco
Secure Communication of Local States in Interpreted Systems. DCAI 2011: 117-124 - [c24]Hans van Ditmarsch, Tim French:
Becoming Aware of Propositional Variables. ICLA 2011: 204-218 - [c23]Hans van Ditmarsch, Sujata Ghosh, Rineke Verbrugge, Yanjing Wang
Hidden protocols. TARK 2011: 65-74 - [c22]Hans van Ditmarsch, David Fernández-Duque, Valentin Goranko, Wojtek Jamroga, Manuel Ojeda-Aciego:
Preface. M4M/LAMAS 2011: 1-2 - [e3]Hans van Ditmarsch, Jérôme Lang, Shier Ju:
Logic, Rationality, and Interaction - Third International Workshop, LORI 2011, Guangzhou, China, October 10-13, 2011. Proceedings. Lecture Notes in Computer Science 6953, Springer 2011, ISBN 978-3-642-24129-1 [contents] - [e2]Hans van Ditmarsch, David Fernández-Duque, Valentin Goranko, Wojciech Jamroga, Manuel Ojeda-Aciego:
Proceedings of the 7th Workshop on Methods for Modalities, M4M 2011, and the 4th Workshop on Logical Aspects of Multi-Agent Systems, LAMAS 2011, Osuna, Spain, November 10-12, 2011. Electronic Notes in Theoretical Computer Science 278, Elsevier 2011 [contents] - [e1]Patrick Blackburn, Hans van Ditmarsch, María Manzano, Fernando Soler-Toscano:
Tools for Teaching Logic - Third International Congress, TICTTL 2011, Salamanca, Spain, June 1-4, 2011. Proceedings. Lecture Notes in Computer Science 6680, Springer 2011, ISBN 978-3-642-21349-6 [contents] - [i7]Hans van Ditmarsch:
The Ditmarsch Tale of Wonders. CoRR abs/1108.2115 (2011) - [i6]Andrés Cordón-Franco, Hans van Ditmarsch, David Fernández-Duque, Joost J. Joosten, Fernando Soler-Toscano:
A secure additive protocol for card players. CoRR abs/1111.0156 (2011) - 2010
- [j27]Hans van Ditmarsch, Jan van Eijck, William Wu:
Verifying one hundred prisoners and a lightbulb. J. Appl. Non Class. Logics 20(3): 173-191 (2010) - [j26]Thomas Ågotnes, Philippe Balbiani
Group announcement logic. J. Appl. Log. 8(1): 62-81 (2010) - [j25]Philippe Balbiani
Tableaux for Public Announcement Logic. J. Log. Comput. 20(1): 55-76 (2010) - [c21]Hans van Ditmarsch, Tim French, Sophie Pinchinat:
Future Event Logic - Axioms and Complexity. Advances in Modal Logic 2010: 77-99 - [c20]Emiliano Lorini, Hans van Ditmarsch, Tiago de Lima:
A Logical Model of Intention and Plan Dynamics. ECAI 2010: 1075-1076 - [c19]Hans van Ditmarsch, Jan van Eijck, William Wu:
One Hundred Prisoners and a Lightbulb - Logic and Computation. KR 2010 - [c18]Hans van Ditmarsch, Tiago de Lima, Emiliano Lorini:
Intention Change via Local Assignments. LADS 2010: 136-151
2000 – 2009
- 2009
- [j24]Mike D. Atkinson, Hans P. van Ditmarsch, Sigrid Roehling:
Avoiding bias in cards cryptography. Australas. J Comb. 44: 3-18 (2009) - [j23]Hans van Ditmarsch, Lawrence S. Moss:
Special Issue on the Occasion of Johan van Benthem's 60th Birthday - Editorial. J. Philos. Log. 38(6): 587-588 (2009) - [j22]Hans van Ditmarsch, Andreas Herzig, Jérôme Lang, Pierre Marquis:
Introspective forgetting. Synth. 169(2): 405-423 (2009) - [j21]Hans van Ditmarsch, Brian Hill, Ondrej Majer
Logic of change, change of logic. Synth. 171(2): 227-234 (2009) - [c17]Hans van Ditmarsch, Tim French:
Awareness and Forgetting of Facts and Agents. Web Intelligence/IAT Workshops 2009: 478-483 - [c16]Hans van Ditmarsch, Wiebe van der Hoek, Barteld P. Kooi:
Knowing More - From Global to Local Correspondence. IJCAI 2009: 955-960 - [c15]Emiliano Lorini, Mehdi Dastani, Hans van Ditmarsch, Andreas Herzig, John-Jules Ch. Meyer:
Intentions and Assignments. LORI 2009: 198-211 - [i5]Hans van Ditmarsch, Tim French:
Awareness and forgetting of facts and agents. Information processing, rational belief change and social interaction 2009 - 2008
- [j20]Hans P. van Ditmarsch, Ji Ruan, Rineke Verbrugge:
Sum and Product in Dynamic Epistemic Logic. J. Log. Comput. 18(4): 563-588 (2008) - [j19]Philippe Balbiani
'Knowable' as 'known after an announcement'. Rev. Symb. Log. 1(3): 305-334 (2008) - [c14]Tim French, Hans van Ditmarsch:
Undecidability for arbitrary public announcement logic. Advances in Modal Logic 2008: 23-42 - [c13]Thomas Ågotnes, Hans van Ditmarsch:
Coalitions and announcements. AAMAS (2) 2008: 673-680 - [c12]Hans van Ditmarsch, Andreas Herzig, Jérôme Lang, Pierre Marquis:
Introspective Forgetting. Australasian Conference on Artificial Intelligence 2008: 18-29 - [c11]Hans van Ditmarsch, Tim French:
Simulation and Information: Quantifying over Epistemic Events. KRAMAS 2008: 51-65 - [p1]Hans P. van Ditmarsch:
Logical Fragments in Ibn Khaldūn's Muqaddimah. The Unity of Science in the Arabic Tradition 2008: 281-294 - 2007
- [j18]Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton, D. J. McCaughan:
Compositions of pattern restricted sets of permutations. Australas. J Comb. 37: 43-56 (2007) - [j17]Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton, D. J. McCaughan, C. W. Monteith:
Cyclically closed pattern classes of permutations. Australas. J Comb. 38: 87-100 (2007) - [j16]Hans van Ditmarsch, María Manzano:
Editorial "Tools for Teaching Logic". Log. J. IGPL 15(4): 289-292 (2007) - [j15]Hans van Ditmarsch, Andreas Herzig:
Foreword. J. Appl. Non Class. Logics 17(2): 125-128 (2007) - [j14]Hans van Ditmarsch, Willem Adrian Labuschagne:
My beliefs about your beliefs: a case study in theory of mind and epistemic logic. Synth. 155(2): 191-209 (2007) - [j13]Hans P. van Ditmarsch:
Comments to 'logics of public communications'. Synth. 158(2): 181-187 (2007) - [c10]Hans van Ditmarsch, Andreas Herzig, Tiago de Lima:
Optimal Regression for Reasoning about Knowledge and Actions. AAAI 2007: 1070-1076 - [c9]Hans P. van Ditmarsch, Wiebe van der Hoek
Dynamic Epistemic Logic and Knowledge Puzzles. ICCS 2007: 45-58 - [c8]Philippe Balbiani
A Tableau Method for Public Announcement Logics. TABLEAUX 2007: 43-59 - [c7]Philippe Balbiani
What can we achieve by arbitrary announcements?: A dynamic take on Fitch's knowability. TARK 2007: 42-51 - [i4]Hans van Ditmarsch, Andreas Herzig, Tiago de Lima:
Optimal Regression for Reasoning about Knowledge and Actions. Formal Models of Belief Change in Rational Agents 2007 - [i3]M. D. Atkinson, Hans P. van Ditmarsch, Sigrid Roehling:
Avoiding bias in cards cryptography. CoRR abs/cs/0702097 (2007) - 2006
- [j12]Hans P. van Ditmarsch:
The Logic of Pit. Synth. 149(2): 343-374 (2006) - [j11]Hans van Ditmarsch, Barteld P. Kooi:
The Secret of My Success. Synth. 151(2): 201-232 (2006) - [j10]Hans van Ditmarsch, Barteld P. Kooi:
The Secret of My Success. Synth. 153(2): 339 (2006) - [i2]Hans P. van Ditmarsch, Barteld P. Kooi:
Semantic results for ontic and epistemic change. CoRR abs/cs/0610093 (2006) - 2005
- [j9]Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley:
Safe communication for card players by combinatorial designs for two-step protocols. Australas. J Comb. 33: 33-46 (2005) - [j8]Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Chris C. Handley, Derek A. Holton, D. J. McCaughan, Hans P. van Ditmarsch:
Sorting Classes. Electron. J. Comb. 12 (2005) - [j7]Hans P. van Ditmarsch:
The case of the hidden hand. J. Appl. Non Class. Logics 15(4): 437-452 (2005) - [j6]Hans P. van Ditmarsch:
Prolegomena to Dynamic Logic for Belief Revision. Synth. 147(2): 229-275 (2005) - [j5]Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton, D. J. McCaughan:
Permuting machines and priority queues. Theor. Comput. Sci. 349(3): 309-317 (2005) - [c6]Hans P. van Ditmarsch, Wiebe van der Hoek, Barteld P. Kooi:
Dynamic epistemic logic with assignment. AAMAS 2005: 141-148 - [c5]Hans P. van Ditmarsch, Ji Ruan, L. C. Verbrugge:
Model Checking Sum and Product. Australian Conference on Artificial Intelligence 2005: 790-795 - [c4]Hans P. van Ditmarsch, Wiebe van der Hoek
Model Checking Russian Cards. MoChArt@CONCUR/SPIN 2005: 105-123 - [i1]Hans van Ditmarsch:
Belief change and dynamic logic. Belief Change in Rational Agents 2005 - 2004
- [j4]Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton:
Restricted permutations and queue jumping. Discret. Math. 287(1-3): 129-133 (2004) - [c3]Hans van Ditmarsch, Wiebe van der Hoek, Barteld P. Kooi:
Public Announcements and Belief Expansion. Advances in Modal Logic 2004: 335-346 - [c2]Hans P. van Ditmarsch:
Some Game Theory of Pit. PRICAI 2004: 946-947 - 2003
- [j3]Michael H. Albert, Robert E. L. Aldred, Michael D. Atkinson, Hans P. van Ditmarsch, B. D. Handley, Chris C. Handley, Jaroslav Opatrny:
Longest subsequences in permutations. Australas. J Comb. 28: 225-238 (2003) - [j2]Hans van Ditmarsch:
The Russian Cards Problem. Stud Logica 75(1): 31-62 (2003) - [c1]Hans P. van Ditmarsch, Wiebe van der Hoek
Concurrent dynamic epistemic logic for MAS. AAMAS 2003: 201-208 - 2002
- [j1]Hans P. van Ditmarsch:
Descriptions of Game Actions. J. Log. Lang. Inf. 11(3): 349-365 (2002)
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:18 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: