Antti Kuusisto

Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2023

The optimal way to play the most difficult repeated two-player coordination games.

[BibT_eX]

[DOI]

Discret. Appl. Math., November, 2023

A monotone connection between model class size and description length.

[BibT_eX]

[DOI]

Miikka Vilander

CoRR, 2023

Descriptive Complexity for Distributed Computing with Circuits.

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Short Boolean Formulas as Explanations in Practice.

[BibT_eX]

[DOI]

Tomi Janhunen

Masood Feyzbakhsh Rankooh

Miikka Vilander

Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

Complexity Classifications via Algebraic Logic.

[BibT_eX]

[DOI]

Proceedings of the 31st EACSL Annual Conference on Computer Science Logic, 2023

2022

One-dimensional fragment over words and trees.

[BibT_eX]

[DOI]

J. Log. Comput., 2022

Bounded game-theoretic semantics for modal mu-calculus.

[BibT_eX]

[DOI]

Inf. Comput., 2022

First-order logic with self-reference.

[BibT_eX]

[DOI]

CoRR, 2022

On expressive rule-based logics.

[BibT_eX]

[DOI]

CoRR, 2022

Explainability via Short Formulas: the Case of Propositional Logic with Implementation.

[BibT_eX]

[DOI]

Tomi Janhunen

Masood Feyzbakhsh Rankooh

Miikka Vilander

Proceedings of the Joint Proceedings of the 1st International Workshop on HYbrid Models for Coupling Deductive and Inductive ReAsoning (HYDRA 2022) and the 29th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA 2022) co-located with the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022), 2022

2021

Game-theoretic semantics for ATL+ with applications to model checking.

[BibT_eX]

[DOI]

Inf. Comput., 2021

The Optimal Way to Play the Most Difficult Repeated Coordination Games.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 12th International Symposium on Games, 2021

Description logics as polyadic modal logics.

[BibT_eX]

[DOI]

Jonne Iso-Tuisku

CoRR, 2021

2020

Satisfiability of Modal Inclusion Logic: Lax and Strict Semantics.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2020

Rational coordination with no communication or conventions.

[BibT_eX]

[DOI]

J. Log. Comput., 2020

Bounded Game-Theoretic Semantics for Modal Mu-Calculus and Some Variants.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 11th International Symposium on Games, 2020

Algebraic classifications for fragments of first-order logic and beyond.

[BibT_eX]

[DOI]

CoRR, 2020

Optimal protocols for the most difficult repeated coordination games.

[BibT_eX]

[DOI]

CoRR, 2020

Gradual Guaranteed Coordination in Repeated Win-Lose Coordination Games.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

2019

Alternating-time temporal logic ATL with finitely bounded semantics.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Model checking and validity in propositional and modal inclusion logics.

[BibT_eX]

[DOI]

J. Log. Comput., 2019

Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics.

[BibT_eX]

[DOI]

Cristina Feier

Log. Methods Comput. Sci., 2019

On Games and Computation.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Game-Theoretic Semantics for Alternating-Time Temporal Logic.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2018

Logics for Propositional Determinacy and Independence.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2018

Weighted model counting beyond two-variable logic.

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017

Emptiness Problems for Distributed Automata.

[BibT_eX]

[DOI]

Fabian Reiter

Proceedings of the Proceedings Eighth International Symposium on Games, 2017

First-order logic with incomplete information.

[BibT_eX]

[DOI]

CoRR, 2017

CTL with Finitely Bounded Semantics.

[BibT_eX]

[DOI]

Proceedings of the 24th International Symposium on Temporal Representation and Reasoning, 2017

One-Dimensional Logic over Trees.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics (Invited Talk).

[BibT_eX]

[DOI]

Cristina Feier

Proceedings of the 20th International Conference on Database Theory, 2017

Rational Coordination in Games with Enriched Representations.

[BibT_eX]

[DOI]

Proceedings of the Multi-Agent Systems and Agreement Technologies, 2017

Game-Theoretic Semantics for ATL+ with Applications to Model Checking.

[BibT_eX]

[DOI]

Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, 2017

2016

Existential second-order logic and modal logic with quantified accessibility relations.

[BibT_eX]

[DOI]

Inf. Comput., 2016

Decidability of Predicate Logics with Team Semantics.

[BibT_eX]

[DOI]

Juha Kontinen

Jonni Virtema

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

On the Uniform One-dimensional Fragment.

[BibT_eX]

[DOI]

Proceedings of the 29th International Workshop on Description Logics, 2016

FO-Rewritability of Expressive Ontology-Mediated Queries.

[BibT_eX]

[DOI]

Cristina Feier

Proceedings of the 29th International Workshop on Description Logics, 2016

2015

A Double Team Semantics for Generalized Quantifiers.

[BibT_eX]

[DOI]

J. Log. Lang. Inf., 2015

Weak models of distributed computing, with connections to modal logic.

[BibT_eX]

[DOI]

Distributed Comput., 2015

Second-order propositional modal logic and monadic alternation hierarchies.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2015

Team Semantics and Recursive Enumerability.

[BibT_eX]

[DOI]

Proceedings of Student Research Forum Papers and Posters at SOFSEM 2015, 2015

Modal Inclusion Logic: Being Lax is Simpler than Being Strict.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Uniform One-Dimensional Fragments with One Equivalence Relation.

[BibT_eX]

[DOI]

Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014

Complexity of two-variable dependence logic and IF-logic.

[BibT_eX]

[DOI]

Inf. Comput., 2014

Infinite Networks, Halting and Local Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Fifth International Symposium on Games, 2014

Some Turing-Complete Extensions of First-Order Logic.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Fifth International Symposium on Games, 2014

Decidable Fragments of Logics Based on Team Semantics.

[BibT_eX]

[DOI]

Juha Kontinen

Jonni Virtema

CoRR, 2014

Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

One-dimensional Fragment of First-order Logic.

[BibT_eX]

[DOI]

Proceedings of the Advances in Modal Logic 10, 2014

2013

Expressivity of Imperfect Information Logics without Identity.

[BibT_eX]

[DOI]

Stud Logica, 2013

Undecidable First-Order Theories of Affine Geometries.

[BibT_eX]

[DOI]

Jeremy Meyers

Jonni Virtema

Log. Methods Comput. Sci., 2013

Modal Logic and Distributed Message Passing Automata.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2009

Monadic Sigma11 and Modal Logic with Quantified Binary Relations.

[BibT_eX]

[DOI]

Proceedings of the 6th Workshop on Methods for Modalities, 2009

2008

A modal perspective on monadic second-order alternation hierarchies.

[BibT_eX]

[DOI]