| Publication | Date of Publication | Type |
|---|
| Uncertainty-based semantics for multi-agent knowing how logics | 2024-11-24 | Paper |
| First steps in updating knowing how | 2024-06-05 | Paper |
| How easy it is to know how: an upper bound for the satisfiability problem | 2024-05-29 | Paper |
| Data graphs with incomplete information (and a way to complete them) | 2024-05-29 | Paper |
| \textbf{DefTab}: a tableaux system for sceptical consequence in default modal logics | 2024-05-17 | Paper |
Algebraic tools for default modal systems
Journal Of Logic And Computation | 2024-02-08 | Paper |
Modal logics and local quantifiers: a zoo in the elementary hierarchy
Lecture Notes in Computer Science | 2024-01-23 | Paper |
Non-monotonic reasoning via dynamic consequence
Logic, Language, Information, and Computation | 2023-06-02 | Paper |
On Composing Finite Forests with Modal Logics
ACM Transactions on Computational Logic | 2023-04-05 | Paper |
| Deontic action logics via algebra | 2023-02-21 | Paper |
BISIMULATIONS FOR KNOWING HOW LOGICS
The Review of Symbolic Logic | 2022-05-25 | Paper |
Copy and remove as dynamic operators
Journal of Applied Non-Classical Logics | 2022-03-03 | Paper |
| scientific article; zbMATH DE number 7450023 (Why is no real title available?) | 2021-12-20 | Paper |
scientific article; zbMATH DE number 7450023 (Why is no real title available?)
(available as arXiv preprint) | 2021-12-20 | Paper |
| Relation-changing logics as fragments of hybrid logics | 2021-12-07 | Paper |
Relation-changing logics as fragments of hybrid logics
(available as arXiv preprint) | 2021-12-07 | Paper |
| Default modal systems as algebraic updates | 2021-12-01 | Paper |
scientific article; zbMATH DE number 7407777 (Why is no real title available?)
(available as arXiv preprint) | 2021-10-08 | Paper |
| scientific article; zbMATH DE number 7407777 (Why is no real title available?) | 2021-10-08 | Paper |
Internal proof calculi for modal logics with separating conjunction
Journal Of Logic And Computation | 2021-09-22 | Paper |
Verification of dynamic bisimulation theorems in Coq
Journal of Logical and Algebraic Methods in Programming | 2021-06-25 | Paper |
Modal logics with composition on finite forests: expressivity and complexity
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
| Mechanizing bisimulation theorems for relation-changing logics in Coq | 2020-07-08 | Paper |
| A tableaux calculus for default intuitionistic logic | 2020-03-10 | Paper |
| Axiomatising logics with separating conjunction and modalities | 2020-02-18 | Paper |
| Interpolation and Beth definability in default logics | 2020-02-18 | Paper |
The power of modal separation logics
Journal Of Logic And Computation | 2020-02-17 | Paper |
Introspection as an action in relational models
Journal of Logical and Algebraic Methods in Programming | 2019-11-28 | Paper |
| On the complexity of modal separation logics | 2019-07-24 | Paper |
Satisfiability for relation-changing logics
Journal Of Logic And Computation | 2019-01-31 | Paper |
Relation-changing modal operators
Logic Journal of the IGPL | 2019-01-08 | Paper |
| Undecidability of relation-changing modal logics | 2018-04-12 | Paper |
| Dynamic epistemic logics of introspection | 2018-04-12 | Paper |
Axiomatizations for downward XPath on data trees
Journal of Computer and System Sciences | 2017-09-07 | Paper |
The modal logic of copy and remove
Information and Computation | 2017-09-04 | Paper |
Hilbert-style axiomatization for hybrid XPath with data
Logics in Artificial Intelligence | 2016-11-30 | Paper |
Swap logic
Logic Journal of the IGPL | 2015-02-27 | Paper |
Logics with Copy and Remove
Logic, Language, Information, and Computation | 2015-01-13 | Paper |
The impact of including model update operators in modal logics
Pristine Perspectives on Logic, Language, and Computation | 2014-07-24 | Paper |
Tableaux for relation-changing modal logics
Frontiers of Combining Systems | 2013-09-20 | Paper |
Moving Arrows and Four Model Checking Results
Logic, Language, Information and Computation | 2012-09-21 | Paper |
