| Publication | Date of Publication | Type |
|---|
Relating description complexity to entropy
Journal of Computer and System Sciences | 2025-01-27 | Paper |
| The optimal way to play the most difficult repeated coordination games | 2024-12-06 | Paper |
| Descriptive complexity for distributed computing with circuits | 2024-12-03 | Paper |
| Relating description complexity to entropy | 2024-10-08 | Paper |
| Complexity classifications via algebraic logic | 2024-09-25 | Paper |
| Short Boolean formulas as explanations in practice | 2024-05-29 | Paper |
The optimal way to play the most difficult repeated two-player coordination games
Discrete Applied Mathematics | 2023-12-11 | Paper |
| CTL with finitely bounded semantics | 2023-02-03 | Paper |
| A monotone connection between model class size and description length | 2023-01-31 | Paper |
Bounded game-theoretic semantics for modal mu-calculus
Information and Computation | 2022-12-08 | Paper |
| Relating description complexity to entropy | 2022-09-26 | Paper |
One-dimensional fragment over words and trees
Journal Of Logic And Computation | 2022-09-22 | Paper |
| First-order logic with self-reference | 2022-07-15 | Paper |
| The power of clockings | 2022-01-20 | Paper |
| scientific article; zbMATH DE number 7455742 (Why is no real title available?) | 2022-01-11 | Paper |
scientific article; zbMATH DE number 7455742 (Why is no real title available?)
(available as arXiv preprint) | 2022-01-11 | Paper |
| Emptiness problems for distributed automata | 2021-12-14 | Paper |
| Gradual guaranteed coordination in repeated win-lose coordination games | 2021-07-06 | Paper |
| Some Turing-complete extensions of first-order logic | 2021-06-24 | Paper |
Some Turing-complete extensions of first-order logic
(available as arXiv preprint) | 2021-06-24 | Paper |
| Infinite networks, halting and local algorithms | 2021-06-24 | Paper |
Infinite networks, halting and local algorithms
(available as arXiv preprint) | 2021-06-24 | Paper |
Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking
Information and Computation | 2021-02-08 | Paper |
Game-theoretic semantics for \(\mathrm{ATL}^+\) with applications to model checking
Information and Computation | 2021-02-08 | Paper |
Weighted model counting beyond two-variable logic
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Rational coordination with no communication or conventions
Journal Of Logic And Computation | 2020-12-15 | Paper |
| Game-theoretic semantics and partial specifications | 2020-10-08 | Paper |
Model checking and validity in propositional and modal inclusion logics
(available as arXiv preprint) | 2020-05-26 | Paper |
Emptiness problems for distributed automata
Information and Computation | 2020-05-26 | Paper |
| One-Dimensional Logic over Trees | 2020-05-26 | Paper |
| Algebraic classifications for fragments of first-order logic and beyond | 2020-05-03 | Paper |
| Optimal protocols for the most difficult repeated coordination games | 2020-04-15 | Paper |
Model checking and validity in propositional and modal inclusion logics
Journal Of Logic And Computation | 2020-02-03 | Paper |
Satisfiability of modal inclusion logic. Lax and strict semantics
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
Alternating-time temporal logic ATL with finitely bounded semantics
Theoretical Computer Science | 2019-11-07 | Paper |
Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
(available as arXiv preprint) | 2019-05-24 | Paper |
| Uniform One-Dimensional Fragment over Ordered Structures | 2018-12-20 | Paper |
Logics for propositional determinacy and independence
The Review of Symbolic Logic | 2018-10-25 | Paper |
Game-Theoretic Semantics for Alternating-Time Temporal Logic
ACM Transactions on Computational Logic | 2018-10-24 | Paper |
Game-Theoretic Semantics for Alternating-Time Temporal Logic
ACM Transactions on Computational Logic | 2018-10-24 | Paper |
| Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk). | 2018-07-18 | Paper |
One-dimensional fragment of first-order logic
(available as arXiv preprint) | 2018-04-23 | Paper |
Decidability of predicate logics with team semantics
(available as arXiv preprint) | 2018-03-21 | Paper |
| Rational coordination with no communication or conventions | 2017-11-22 | Paper |
| Uniform one-dimensional fragments with one equivalence relation | 2017-08-31 | Paper |
Bounded game-theoretic semantics for modal mu-calculus
(available as arXiv preprint) | 2017-06-02 | Paper |
| First-order logic with incomplete information | 2017-03-09 | Paper |
| Modal logic and distributed message passing automata | 2017-02-02 | Paper |
Logics for Propositional Determinacy and Independence
(available as arXiv preprint) | 2016-09-23 | Paper |
Monadic \(\Sigma^{1}_{1}\) and modal logic with quantified binary relations
Electronic Notes in Theoretical Computer Science | 2016-08-05 | Paper |
A double team semantics for generalized quantifiers
Journal of Logic, Language and Information | 2016-07-05 | Paper |
| On the uniform one-dimensional fragment | 2016-04-06 | Paper |
Existential second-order logic and modal logic with quantified accessibility relations
Information and Computation | 2016-03-10 | Paper |
Modal inclusion logic: being lax is simpler than being strict
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Weak models of distributed computing, with connections to modal logic
Distributed Computing | 2015-03-25 | Paper |
Weak models of distributed computing, with connections to modal logic
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Weak models of distributed computing, with connections to modal logic
Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
Complexity of two-variable dependence logic and IF-logic
Information and Computation | 2014-11-28 | Paper |
Second-order propositional modal logic and monadic alternation hierarchies
Annals of Pure and Applied Logic | 2014-10-27 | Paper |
Complexity and expressivity of uniform one-dimensional fragment with equality
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
| Team Semantics and Recursive Enumerability | 2014-08-18 | Paper |
Undecidable first-order theories of affine geometries
Logical Methods in Computer Science | 2014-01-08 | Paper |
Expressivity of imperfect information logics without identity
Studia Logica | 2013-06-13 | Paper |
Undecidable First-Order Theories of Affine Geometries
(available as arXiv preprint) | 2012-11-22 | Paper |
| A modal perspective on monadic second-order alternation hierarchies | 2011-03-30 | Paper |
