Publications

In Journals

This is a pre-print of an article published in Annals of Mathematics and Artificial Intelligence. The final authenticated version is available online at: https://doi.org/10.1007/s10472-018-9593-y

First Steps Towards Probabilistic Justification Logic

(with Petar Maksimović, Zoran Ognjanović and Thomas Studer)

Logic Journal of the IGPL, 23(4):662-687, 2015

This is a pre-print of an article published in Logic Journal of the IGPL. The final authenticated version is available online at: https://doi.org/10.1093/jigpal/jzv025

In Conference Proceedings & Edited Volumes

The Dynamic Complexity of Acyclic Hypergraph Homomorphisms

(with Nils Vortmeier)

in the proceedings of International Workshop on Graph-Theoretic Concepts in Computer Science

Justification Logics with Probability Operators

(with Nenad Savić and Thomas Studer)

in Z. Ognjanovic, editor, Probabilistic Extensions of Various Logical Systems. Springer, 2020.

Dynamic Complexity Meets Parametrised Algorithms

(with Jonas Schmidt, Thomas Schwentick, Nils Vortmeier and Thomas Zeume)

CSL 2020: 36:1-36:17

Reachability of Five Gossip Protocols

(with Hans van Ditmarsch, Malvin Gattinger and Louwe B. Kuijer)

in Filiot E., Jungers R., Potapov I. (eds) Reachability Problems. RP 2019. Lecture Notes in Computer Science, vol 11674. Springer, Cham

The final publication is available at Springer via https://link.springer.com/chapter/10.1007%2F978-3-030-30806-3_17

The Expected Duration of Sequential Gossiping

(with Hans van Ditmarsch)

in Multi-Agent Systems and Agreement Technologies (pp. 131-146). Springer, Cham.

The final publication is available at Springer via https://link.springer.com/chapter/10.1007/978-3-030-01713-2_10

The Complexity of Probabilistic Justification Logic

in the Proceedings of the 11th Panhellenic Logic Symposium, July 12-16, 2017, Delphi, Greece, pages 196-201

Reachability and Expectation in Gossiping

(with Hans van Ditmarsch and Anders Stockmarr)

in B. An, Ana L. C. Bazzan, J. Leite, S. Villata and L. W. N. van der Torre, editors, Principles and Practice of Multi-Agent Systems: pages: 93-109. Springer, 2017

The final publication is available at Springer via https://doi.org/10.1007/978-3-319-69131-2_6

The Complexity of Non-Iterated Probabilistic Justification Logic

in G. Simari and M. Gyssens, editors, Symposium on Foundations of Information and Knowledge Systems 2016: pages 292-310. Springer, 2016.

The final publication is available at Springer via https://dx.doi.org/10.1007/978-3-319-30024-5_16

Probabilistic Justification Logic

(with Zoran Ognjanović and Thomas Studer)

in S. Artemov and A. Nerode, editors, Symposium on Logical Foundations in Computer Science 2016: pages 174–186. Springer, 2016.

The final publication is available at Springer via https://doi.org/10.1007/978-3-319-27683-0_13

Cyclic Proofs for Linear Temporal Logic

(with Thomas Studer)

in D. Probst, P. Schuster, editors, Concepts of Proof in Mathematics, Philosophy, and Computer Science, volume 6 of Ontos Mathematical Logic: pages 171-192. De Gruyter (2016)

Software

Implementation for Reachability and Expectation in Gossiping (this program produced integer sequences A318154 and A307085)

Theses

Uncertain Reasoning in Justification Logic

PhD Thesis, University of Bern, June 2016

Supervisor: Thomas Studer

[text] [slides] [summary]

Annotated Sequent Systems for Linear Temporal Logic

Master's Thesis, National and Kapodistrian University of Athens, April 2015

Supervisor: Stathis Zachos

[slides] [text] [abstract] [errata]

Typing and Termination in Lambda Calculus

Diploma Thesis, National Technical University of Athens, November 2010

Supervisor: George Koletsos

[slides] [abstract]

in Greek: [text] [abstract]