| 28th EACSL Annual Conference on Computer Science Logic (CSL 2020) V Cortier, A Dawar, A Jeż, D Kesner, E Bonelli, A Viso, I Tzameret, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2020 | | 2020 |
| A decidable multi-agent logic for reasoning about actions, instruments, and norms K van Berkel, T Lyon, F Olivieri International conference on logic and argumentation, 219-241, 2020 | 3 | 2020 |
| A Framework for Intuitionistic Grammar Logics TS Lyon International Conference on Logic and Argumentation, 495-503, 2021 | 1 | 2021 |
| A logical analysis of instrumentality judgments: means-end relations in the context of experience and expectations K van Berkel, TS Lyon, M Pascucci Journal of Philosophical Logic 52 (5), 1475-1516, 2023 | | 2023 |
| A neutral temporal deontic stit logic K van Berkel, T Lyon International Workshop on Logic, Rationality and Interaction, 340-354, 2019 | 4 | 2019 |
| Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for (deontic) STIT Logics K van Berkel, T Lyon | | |
| Automating agential reasoning: Proof-calculi and syntactic decidability for stit logics T Lyon, K van Berkel International conference on principles and practice of multi-agent systems …, 2019 | 18 | 2019 |
| Automating reasoning with standpoint logic via nested sequents TS Lyon, LG Álvarez arXiv preprint arXiv:2205.02749, 2022 | 8 | 2022 |
| Connecting proof theory and knowledge representation: Sequent calculi and the chase with existential rules TS Lyon, P Ostropolski-Nalewaja arXiv preprint arXiv:2306.02521, 2023 | 2 | 2023 |
| Constructive Interpolation and Concept-Based Beth Definability for Description Logics via Sequents TS Lyon, J Karge arXiv preprint arXiv:2404.15840, 2024 | | 2024 |
| Cut-free calculi and relational semantics for temporal stit logics K van Berkel, T Lyon European Conference on Logics in Artificial Intelligence, 803-819, 2019 | 11 | 2019 |
| Cut-free Calculi and Relational Semantics for Temporal STIT Logics T Lyon, K van Berkel | | 2019 |
| Decidability of Quasi-Dense Modal Logics T Lyon, P Ostropolski-Nalewaja Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer …, 2024 | | 2024 |
| Decidability of Quasi-Dense Modal Logics P Ostropolski-Nalewaja, TS Lyon arXiv preprint arXiv:2405.10094, 2024 | | 2024 |
| Decidability of querying first-order theories via countermodels of finite width T Feller, TS Lyon, P Ostropolski-Nalewaja, S Rudolph arXiv preprint arXiv:2304.06348, 2023 | 1 | 2023 |
| Derivation-Graph-Based Characterizations of Decidable Existential Rule Sets TS Lyon, S Rudolph European Conference on Logics in Artificial Intelligence, 369-384, 2023 | | 2023 |
| Display to labeled proofs and back again for tense logics A Ciabattoni, TS Lyon, R Ramanayake, A Tiu ACM Transactions on Computational Logic (TOCL) 22 (3), 1-31, 2021 | 12 | 2021 |
| Effective Translations between Display and Labelled Proofs for Tense Logics T Lyon | | 2018 |
| Effective Translations between Nested and Labelled Proofs for Tense Logics T Lyon | | 2018 |
| Finite-cliquewidth sets of existential rules: Toward a general criterion for decidable yet highly expressive querying T Feller, TS Lyon, P Ostropolski-Nalewaja, S Rudolph arXiv preprint arXiv:2209.02464, 2022 | 5 | 2022 |
Kees van BerkelAssistant Professor, TU WienVerified email at logic.at