Publications

2024

Grants4Companies: The Common Lisp PoC (with Philipp Marek and Markus Triska). In: European Lisp Symposium 2024 (pp.12-17)

Grants4Companies: Applying declarative methods for recommending and reasoning about business grants in the Austrian public administration (System description) (with Philipp Marek and Markus Triska). In: FLOPS 2024

Once Only in der Single Digital Gateway Verordnung - Neue Herangehensweisen im europäischen e-Government (with Carl-Markus Piswanger, Felix Plank and Peter Schüller). In: Proceedings of IRIS2024, JusletterIT (2024)

2023

Once Only Prinzip in der Single Digital Gateway Verordnung - Status und Erkenntnisse (with Carl-Markus Piswanger and Felix Plank). In: Proceedings of IRIS2023, JusletterIT (2023)

2022

Calculi, Countermodel Generation and Theorem Prover for Strong Logics of Counterfactual Reasoning (with Marianna Girlando, Nicola Olivetti, Stefane Pesce and Gian Luca Pozzato). Journal of Logic and Computation 32(2), pp.233-280 (2022).

2021

From Input/Output Logics to Conditional Logics via Sequents - With Provers. In: TABLEAUX 2021

Interpolation for Intermediate Logics via Nested Sequents (with Roman Kuznets). Journal of Logic and Computation 31(3), pp.791-831 (2021).

Sequent Rules for Reasoning and Conflict Resolution in Conditional Norms (with Agata Ciabattoni). In: DEON 2021.

Explainable Rule Extraction via Semantic Graphs (with Gabor Recski, Adam Kovacs, and Allan Hanbury). In: ASAIL 2021

Hypersequent calculi for non-normal modal and deontic logics: Countermodels and optimal complexity (with Tiziano Dalmonte, Nicola Olivetti and Elaine Pimentel). Journal of Logic and Computation, 31(1), pp.67-111 (2021).

2020

Mīmāmsā Deontic Reasoning using Specificity: A Proof Theoretic Approach (with Francesca Gulisano and Agata Ciabattoni). Published online in Artificial Intelligence and Law. The prototype implementation is available as deonticProver1.2.

Theorem Proving for Lewis' Logics of Counterfactual Reasoning, with Marianna Girlando, Nicola Olivetti, Stefano Pesce and Gian Luca Pozzato. In: F. Calimeri, S. Perri and E. Zumpano (eds.): Proceedings of CILC 2020. CEUR Workshop Proceedings 2020. The implementation can be found here.

Sequent Rules for Reasoning and Conflict Resolution in Conditional Norms, with Agata Ciabattoni. To appear in: Fenrong Liu, Alessandra Marra, Paul Portner, and Frederik Van De Putte (eds.). DEON2020/2021. College Publications 2021(2020).The prototype implementation can be found in deonticProver2.0.

Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics, with Tiziano Dalmonte, Nicola Olivetti and Elaine Pimentel. In: S. Artemov and A. Nerode (Eds.): LFCS 2020. LNCS, vol. 11972, pp.27-46. Springer (2020). Preliminary version.

2019

Combining monotone and normal modal logic in nested sequents -- with countermodels. In: S. Cerrito and A. Popescu (Eds.): TABLEAUX 2019. LNCS, vol.11714, pp.203-220. Springer (2019). Preliminary version. The prototype implementation of the methods from this paper is available as nnProver. This paper won the best paper award at TABLEAUX 2019.

Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents, with Rajeev Goré. In: S. Cerrito and A. Popescu (Eds.): TABLEAUX 2019. LNCS, vol.11714, pp.182-202. Springer (2019). Preliminary (extended) version.

Sequentialising nested sequents, with Elaine Pimentel and Revantha Ramanayake. In: S. Cerrito and A. Popescu (Eds.): TABLEAUX 2019. LNCS, vol.11714, pp.147-165. Springer (2019). Preliminary version.

Nested sequents for the logic of conditional belief, with Marianna Girlando and Nicola Olivetti. In: F. Calimeri et al (Eds.): JELIA 2019. LNAI, vol.11468, pp.709-725. Springer (2019) Preliminary version.

Modularisation of sequent calculi for normal and non-normal modalities, with Elaine Pimentel. ACM Transactions on Computational Logic, 20(2), article no.7 (2019). This is the extended journal version of our 2015 paper Proof Search in Nested Sequent Calculi. Some of the systems for normal and non-normal modal logics in this paper have been implemented in LNSprover. The embedding of the linear nested sequent calculi into linear logic was exploited in the prover POULE. Preliminary Version on arXiv.

2018

Deontic Reasoning: From Ancient Texts to Artificial Intelligence: Workshop Report, with Agata Ciabattoni and Kees van Berkel. SIGLOG News 5(4), pp.48-51 (2018)

Interpolation for Intermediate Logics via Hyper- and Linear Nested Sequents, with Roman Kuznets. In: G. Bezhanishvili, G. D'Agostino, G. Metcalfe, T. Studer (eds.): Advances in Modal Logic 12, pp. 473-492. College Publications (2018) Preliminary version.

Resolving Conflicting Obligations in Mīmāṃsā: A Sequent-based Approach, with Agata Ciabattoni and Francesca Gulisano. In: J. Broersen, C. Condoravdi, S. Nair, G. Pigozzi (eds.): DEON2018, pp.91-109. College Publications (2018) Preliminary version. A prototype implementation can be found in deonticProver.

2017

Hypersequent Calculi for Lewis' Conditional Logics with Uniformity and Reflexivity, with Marianna Girlando, Nicola Olivetti, and Gian Luca Pozzato. In: R. Schmidt and C. Nalon (Eds.): TABLEAUX 2017. LNCS, vol.10501, pp.131-148. Springer (2017) Preliminary version

VINTE: an Implementation of Internal Calculi for Lewis' Logics for Counterfactual Reasoning, with Marianna Girlando, Nicola Olivetti, Gian Luca Pozzato, and Quentin Vitalis. In: R. Schmidt and C. Nalon (Eds.): TABLEAUX 2017. LNCS, vol.10501, pp.149-159. Springer (2017) Preliminary version. The implementation can be found here.

A uniform framework for substructural logics with modalities, with Carlos Olarte and Elaine Pimentel. In: T. Eiter and D. Sands (Eds.): LPAR-21. EPiC Series in Computing, vol.46, pp.435-455. Easychair (2017).

From Cut-free Calculi to Automated Deduction: The Case of Bounded Contraction, with Agata Ciabattoni, Carlos Olarte, and Elaine Pimentel. Electronic Notes in Theoretical Computer Science 332:75-93 (2017).

Understanding prescriptive texts: Rules and logic as elaborated by the Mīmāṃsā school, with Agata Ciabattoni, Elisa Freschi, and Francesco Genco. In Journal of World Philosophies 2(1):47-66 (2017).

2016

Standard Sequent Calculi for Lewis’ Logics of Counterfactuals, with Marianna Girlando, Nicola Olivetti, and Gian Luca Pozzato. In: L. Michael and A. Kakas (Eds.): JELIA 2016. LNAI, vol. 10021, pp.272-287. Springer International (2016). Preliminary version.

Hypersequent Rules with Restricted Contexts for Propositional Modal Logics. Theoretical Computer Science, 656:76-105 (2016). Preprint. This is the extended journal version of the 2014 paper Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications.

Grafting Hypersequents onto Nested Sequents, with Roman Kuznets. Logic Journal of the IGPL, 24(3):375-423 (2016). Free PDF. Preliminary version on arXiv.

2015

Proof Search in Nested Sequent Calculi, with Elaine Pimentel. In: M. Davis, A. Fehnker, A. McIver, A. Voronkov (Eds.): LPAR-20. LNCS, vol. 9450, pp.558-574. Springer Berlin Heidelberg (2015). Preliminary version. The extended journal version of this paper has been published. Some of the systems for normal and non-normal modal logics in this paper have been implemented in LNSprover. The embedding of the linear nested sequent calculi into linear logic was exploited in the prover POULE.

Mīmāṃsā Deontic Logic: Proof Theory and Applications, with Agata Ciabattoni, Elisa Freschi, and Francesco Genco. In: Hans de Nivelle (Ed.): TABLEAUX 2015. LNCS, vol. 9323, pp.323-338. Springer International (2015). Preprint on arXiv.

Linear Nested Sequents, 2-sequents and Hypersequents. In: Hans de Nivelle (Ed.): TABLEAUX 2015. LNCS, vol. 9323, pp.135-150. Springer International (2015). Preliminary version.

2014

Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications. In: S. Demri, D. Kapur, and C. Weidenbach (Eds.): IJCAR 2014. LNAI, vol. 8562, pp. 307-321. Springer, Switzerland (2014) Extended version (with more details). The journal version Hypersequent Rules with Restricted Contexts for Propositional Modal Logics appeared in TCS and is available as Preprint.

2013

Sequent Calculi with Context Restrictions and Applications to Conditional Logic (PhD thesis)

Correspondence between Modal Hilbert Axioms and Sequent Rules with an Application to S5, with Dirk Pattinson In: D. Galmiche and D. Larchey-Wendling (Eds.): TABLEAUX 2013. LNCS, vol. 8123, pp. 219-233. Springer, Heidelberg (2013) Extended version (with more details)

Lellmann, J., Lellmann, B., Widmann, F., Schnörr, C.: Discrete and Continuous Models for Partition Problems. International Journal of Computer Vision 104(3), pp.241-269. Springer, 2013

Constructing Cut Free Sequent Systems With Context Restrictions Based on Classical or Intuitionistic Logic, with Dirk Pattinson In: K. Lodaya (Ed.): ICLA 2013. LNCS, vol. 7750, pp. 148-160. Springer, Heidelberg (2013) Extended Version (with proofs).

2012

Sequent Systems for Lewis' Conditional Logics, with Dirk Pattinson In: L. Fariñas del Cerro, A. Herzig and J. Mengin (Eds.): JELIA 2012. LNCS, vol. 7519, pp. 320-332. Springer, Heidelberg (2012) Extended version (with more proofs)

Graphical Construction of Cut-free Sequent Systems Suitable for Backwards Proof Search (extended abstract), with Dirk Pattinson In: R. A. Schmidt and F. Papacchini (Eds.): Proceedings of ARW 2012

2011

Cut Elimination for Shallow Modal Logics, with Dirk Pattinson In: K. Brünnler and G. Metcalfe (Eds.): TABLEAUX 2011. LNAI, vol. 6793, pp. 211 - 225. Springer, Heidelberg (2011) Extended version (with proofs).

Note on a Dichotomy for the Classes W[P](C) Defined via Symmetric Connectives In: A. V. Jones (Ed.): Proceedings of ICCSW '11

2008

Diploma thesis (in German)