2023W

• Bachelor Thesis for Informatics and Business Informatics / 185.A26 / PR
• Introduction to Logical Methods in Computer Science / 184.766 / VO
• Logic and Computability / 185.A45 / VU
• Project in Computer Science 1 / 192.021 / PR
• Project in Computer Science 2 / 192.022 / PR
• Research Seminar for Master and PhD students / 185.A39 / SE
• Research Seminar LogiCS / 184.767 / SE
• Scientific Research and Writing / 193.052 / SE
• Seminar for Master Students in Logic and Computation / 180.773 / SE

2024S

• Bachelor Thesis for Informatics and Business Informatics / 185.A26 / PR
• Deontic Logic for Normative Reasoning / 192.130 / VU
• Introduction to Logical Methods in Computer Science / 184.766 / VO
• Logic and Reasoning in Computer Science / 192.033 / VU
• Project in Computer Science 1 / 192.021 / PR
• Project in Computer Science 2 / 192.022 / PR
• ProWriting -- Effective Research Project Proposal Writing for Public Funding / 195.109 / VU
• Research Seminar for Master and PhD students / 185.A39 / SE
• Research Seminar LogiCS / 184.767 / SE
• Seminar for Master Students in Logic and Computation / 180.773 / SE
• Seminar in Logic / 185.316 / SE

• Logical methods for Deontic Explanations
  2024 – 2026 / Austrian Science Fund (FWF)
  Publications: 193684 / 193611 / 193531 / 195506
• Training and Guiding AI Agents with Ethical Rules
  2023 – 2027 / Vienna Science and Technology Fund (WWTF)
  Publications: 177540 / 193925 / 191154 / 190260 / 190235 / 190656
• Mosaic -- modal logics
  2021 – 2025 / European Commission
  Publications: 190990 / 191061 / 190605
• Norm-based reasoning: from legal and moral traditions to AI systems
  2019 – 2020 / Norms
• Reasoning Tools for Deontic Logic and Applications to Indian Sacred Texts
  2017 – 2022 / Vienna Science and Technology Fund (WWTF)
  Publications: 136993 / 153871 / 190020 / 190740 / 188942 / 135875 / 101894 / 135848
• TICAMORE: Translating and discovering calculi for modal and related logics
  2017 – 2022 / Austrian Science Fund (FWF)
  Publications: 135857 / 137005
• Syntax meet Semantics: Methods, Interactions, and Connections in Substructural logics
  2016 – 2019 / European Commission
• Proof-theoretic Analysis of Modal Logics
  2015 – 2017 / European Commission
• Generalizing Truth-Functionality
  2013 – 2017 / European Commission
• A novel decision support system for training and diagnosis in dermatology
  2013 – 2015 / Austrian Research Promotion Agency (FFG)
• Nonclassical Proofs: Theory, Applications and Tools
  2011 – 2019 / Austrian Science Fund (FWF)
• Automated Analysis of Mathematical Proofs
  2005 – 2007 / Austrian Science Fund (FWF)
• Decision Procedures and Model Building for Fuzzy Logics
  2003 – 2005 / FWF, Der Wissenschaftsfonds

2023

• Streamlining Input/Output Logics with Sequent Calculi / Ciabattoni, A., & Rozplokhas, D. (2023). Streamlining Input/Output Logics with Sequent Calculi. In P. Marquis, T. C. Son, & G. Kern-Isberner (Eds.), Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning (pp. 146–155). IJCAI Organization. https://doi.org/10.24963/kr.2023/15
  Project: TAIGER (2023–2027)
• Analytic Proof Theory for Aqvist's System F / Ciabattoni, A., Olivetti, N., Parent, X., Ramanayake, D. R. S., & Rozplokhas, D. (2023). Analytic Proof Theory for Aqvist’s System F. In J. Maranhão, C. Peterson, C. Straßer, & L. van der Torre (Eds.), Deontic Logic and Normative Systems - 16th International Conference, DEON 2023 (pp. 79–98). College Publications. http://hdl.handle.net/20.500.12708/190605
  Projects: Lisa Meitner grant (2021–2024) / Mosaic (2021–2025)
• Normative reasoning: From Sanskrit philosophy to AI / Ciabattoni, A. (2023, May 16). Normative reasoning: From Sanskrit philosophy to AI [Conference Presentation]. Workshop on Reasoning about Responsible Agency in AI, Amsterdam, Netherlands (the). http://hdl.handle.net/20.500.12708/177540
  Project: TAIGER (2023–2027)
• Deontic Paradoxes in Mīmāṃsā Logics: There and Back Again / van Berkel, K., Ciabattoni, A., Freschi, E., Gulisano, F., & Olszewski, M. (2023). Deontic Paradoxes in Mīmāṃsā Logics: There and Back Again. Journal of Logic, Language and Information, 32, 19–62. https://doi.org/10.1007/s10849-022-09375-w
  Download: PDF (712 KB)
  Project: RTD-Indian (2017–2022)
• Cut-Restriction: From Cuts to Analytic Cuts / Ciabattoni, A., Lang, T. A., & Ramanayake, D. R. S. (2023). Cut-Restriction: From Cuts to Analytic Cuts. In 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (pp. 1–13). IEEE. https://doi.org/10.1109/LICS56636.2023.10175785
• Deontic Paradoxes in ASP with Weak Constraints / Ciabattoni, A., Eiter, T., & Hatschka, C. (2023). Deontic Paradoxes in ASP with Weak Constraints. In Proceedings 39th International Conference on Logic Programming (pp. 367–380).
  Project: TAIGER (2023–2027)
• Deontic Equilibrium Logic with eXplicit Negation / Cabalar, P., Ciabattoni, A., & van der Torre, L. (2023). Deontic Equilibrium Logic with eXplicit Negation. In S. A. Gaggl, M. V. Martinez, & M. Ortiz (Eds.), Logics in Artificial Intelligence - 18th European Conference, JELIA 2023, Dresden, Germany, September 20-22, 2023, Proceedings (pp. 498–514). Springer. https://doi.org/10.1007/978-3-031-43619-2_34
  Project: TAIGER (2023–2027)

2022

• Representing Normative Reasoning in Answer Set Programming Using Weak Constraints / Hatschka, C., Ciabattoni, A., & Eiter, T. (2022, November 28). Representing Normative Reasoning in Answer Set Programming Using Weak Constraints [Conference Presentation]. TAASP - Workshop on Trends and Applications of Answer Set Programming, Wien, Austria. http://hdl.handle.net/20.500.12708/154091
• Dyadic Obligations: Proofs and Countermodels via Hypersequents / Ciabattoni, A., Olivetti, N., & Parent, X. (2022). Dyadic Obligations: Proofs and Countermodels via Hypersequents. In PRIMA 2022: Principles and Practice of Multi-Agent Systems.  24th International Conference, Valencia, Spain, November 16–18, 2022, Proceedings (pp. 54–71). Springer. https://doi.org/10.1007/978-3-031-21203-1_4
  Project: Lisa Meitner grant (2021–2024)
• Enforcing ethical goals over reinforcement-learning policies / Neufeld, E. A., Bartocci, E., Ciabattoni, A., & Governatori, G. (2022). Enforcing ethical goals over reinforcement-learning policies. Ethics and Information Technology, 24(4), Article 43. https://doi.org/10.1007/s10676-022-09665-8
  Download: PDF (1.62 MB)
  Project: RTD-Indian (2017–2022)
• Taming Bounded Depth with Nested Sequents / Ciabattoni, A., Straßburger, L., & Tesi, M. (2022). Taming Bounded Depth with Nested Sequents. In David Fernández-Duque, A. PALMIGIANO, & S. Pinchinat (Eds.), Advances in Model Logic (pp. 199–217). College Publications.
  Project: TICAMORE (2017–2022)
• Logic, Language, Information, and Computation / Ciabattoni, A., Pimentel, E., & de Queiroz, R. J. G. B. (Eds.). (2022). Logic, Language, Information, and Computation (Vol. 13468). Springer. https://doi.org/10.1007/978-3-031-15298-6
• On Normative Reinforcement Learning via Safe Reinforcement Learning / Neufeld, E. A., Bartocci, E., & Ciabattoni, A. (2022). On Normative Reinforcement Learning via Safe Reinforcement Learning. In PRIMA 2022: Principles and Practice of Multi-Agent Systems - Proceedings (pp. 72–89). https://doi.org/10.1007/978-3-031-21203-1_5
  Project: RTD-Indian (2017–2022)

2021

• Mīmāṃsā deontic reasoning using specificity: a proof theoretic approach / Lellmann, B., Gulisano, F., & Ciabattoni, A. (2021). Mīmāṃsā deontic reasoning using specificity: a proof theoretic approach. Artificial Intelligence and Law, 29(3), 351–394. https://doi.org/10.1007/s10506-020-09278-w
  Download: PDF (1.84 MB)
• A Normative Supervisor for Reinforcement Learning Agents / Neufeld, E., Bartocci, E., Ciabattoni, A., & Governatori, G. (2021). A Normative Supervisor for Reinforcement Learning Agents. In Automated Deduction – CADE 28 (pp. 565–576). https://doi.org/10.1007/978-3-030-79876-5_32
• Normative reasoning in Mīmāṃsā: A deontic logic approach / Ciabattoni, A. (2021). Normative reasoning in Mīmāṃsā: A deontic logic approach. ICLA 2021 9th Indian Conference on Logic and its Applications, online, Unknown. http://hdl.handle.net/20.500.12708/87237
• A Kelsenian Deontic Logic / Ciabattoni, A., & Parent, X. (2021). A Kelsenian Deontic Logic. In Frontiers in Artificial Intelligence and Applications. Jurix 2021, 34th International Conference on Legal Knowledge and Information Systems, Vilnius, Litauen, Lithuania. https://doi.org/10.3233/faia210330
• The Gentle Murder Paradox in Sanskrit Philosophy / Ciabattoni, A., van Berkel, K., Freschi, E., Gulisano, F., & Olszewski, M. (2021). The Gentle Murder Paradox in Sanskrit Philosophy. In Proceedings of DEON2020/21 (pp. 17–35). http://hdl.handle.net/20.500.12708/55623
• Display to Labeled Proofs and Back Again for Tense Logics / Ciabattoni, A., Lyon, T., Ramanayake, R., & Tiu, A. (2021). Display to Labeled Proofs and Back Again for Tense Logics. ACM Transactions on Computational Logic, 22(3), 1–31. https://doi.org/10.1145/3460492
• Bounded-analytic sequent calculi and embeddings for hypersequent logics. / CIABATTONI, A., LANG, T., & RAMANAYAKE, R. (2021). Bounded-analytic sequent calculi and embeddings for hypersequent logics. Journal of Symbolic Logic, 86(2), 635–668. https://doi.org/10.1017/jsl.2021.42
• Sequent Rules for Reasoning and Conflict Resolution in Conditional Norms / Ciabattoni, A., & Lellmann, B. (2021). Sequent Rules for Reasoning and Conflict Resolution in Conditional Norms. In Proceedings of DEON2020/21 (pp. 94–113). College Publications. http://hdl.handle.net/20.500.12708/55610

2020

• On the concurrent computational content of intermediate logics / Aschieri, F., Ciabattoni, A., & Genco, F. A. (2020). On the concurrent computational content of intermediate logics. Theoretical Computer Science, 813, 375–409. https://doi.org/10.1016/j.tcs.2020.01.022
• A typed parallel lambda-calculus via 1-depth intermediate proofs / Aschieri, F., Ciabattoni, A., & Genco, F. A. (2020). A typed parallel lambda-calculus via 1-depth intermediate proofs. In L. Kovacs (Ed.), EPiC Series in Computing. EasyChair EPiC Series in Computing. https://doi.org/10.29007/g15z
• Sequent Rules for Reasoning and Conflict Resolution in Conditional Norms / Lellmann, B., & Ciabattoni, A. (2020). Sequent Rules for Reasoning and Conflict Resolution in Conditional Norms. In DEOn 2020/2021 (pp. 1–18). College Publications. http://hdl.handle.net/20.500.12708/58273

2019

• Intermediate Logic Proofs as Concurrent Programs / Ciabattoni, A., Genco, F., & Aschieri, F. (2019). Intermediate Logic Proofs as Concurrent Programs. Conference: Syntax meets Semantics (SYSMICS) 2019, Amsterdam, EU. http://hdl.handle.net/20.500.12708/86612
• Evaluating Networks of Arguments: A Case Study in Mīmāṃsā Dialectics. / van Berkel, K., & Ciabattoni, A. (2019). Evaluating Networks of Arguments: A Case Study in Mīmāṃsā Dialectics. In Logic, Rationality, and Interaction. LORI 2019. Lecture Notes in Computer Science (pp. 355–369). http://hdl.handle.net/20.500.12708/57935
• Bounded sequent calculi for non-classical logics via hypersequents / Ciabattoni, A., Ramanayake, R., & Lang, T. (2019). Bounded sequent calculi for non-classical logics via hypersequents. In Automated Reasoning with Analytic Tableaux and Related Methods. 28th International Conference, TABLEAUX 2019, London, UK, September 3-5, 2019, Proceedings (pp. 94–110). Springer. http://hdl.handle.net/20.500.12708/57959

2018

• From Display to Labelled Calculi for Tense Logics / Lyon, T., Ramanayake, R., & Ciabattoni, A. (2018). From Display to Labelled Calculi for Tense Logics. In Logical Foundations of Computer Science (pp. 120–139). https://doi.org/10.1007/978-3-319-72056-2_8
• Resolving Conflicting Obligations in Mīmāṃsā: A Sequent-based Approach / Ciabattoni, A., Gulisano, F., & Lellmann, B. (2018). Resolving Conflicting Obligations in Mīmāṃsā: A Sequent-based Approach. In J. Broersen, C. Condoravdi, S. Nair, & G. Pigozzi (Eds.), Deontic Logic and Normative Systems DEON 2018 (pp. 91–110). College Publications. http://hdl.handle.net/20.500.12708/57498
• Logic-Based Concurrent Calculi / Aschieri, F., Ciabattoni, A., & Genco, F. (2018). Logic-Based Concurrent Calculi. Substructural logics: semantics, proof theory, and applications, SYSMICS 2018, Wien, Austria. http://hdl.handle.net/20.500.12708/122706
• Classical Proofs as Parallel Programs / Aschieri, F., Genco, F., & Ciabattoni, A. (2018). Classical Proofs as Parallel Programs. In Electronic Proceedings in Theoretical Computer Science (pp. 43–57). https://doi.org/10.4204/eptcs.277.4
• Hypersequents and Systems of Rules: Embeddings and Applications. / Ciabattoni, A., & Genco, F. A. (2018). Hypersequents and Systems of Rules: Embeddings and Applications. ACM Transactions on Computational Logic, 19(2), 1–27. https://doi.org/10.1145/3180075
• Substructural logics: semantics, proof theory, and applications. Report on the second SYSMICS workshop / Ciabattoni, A., Genco, F. A., & Ramanayake, R. (2018). Substructural logics: semantics, proof theory, and applications. Report on the second SYSMICS workshop. ACM SIGLOG News, 5(2), 58–60. https://doi.org/10.1145/3212019.3212027
• Disjunctive Axioms and Concurrent lambda-Calculi: a Curry-Howard Approach / Aschieri, F., Ciabattoni, A., & Genco, F. (2018). Disjunctive Axioms and Concurrent lambda-Calculi: a Curry-Howard Approach. CoRR - Computing Research Repository. http://hdl.handle.net/20.500.12708/154516
• Deontic Reasoning: From Ancient Texts to Artificial Intelligence. Workshop report / Ciabattoni, A., Lellmann, B., & van Berkel, K. (2018). Deontic Reasoning: From Ancient Texts to Artificial Intelligence. Workshop report. ACM SIGLOG News, 5(4), 48–51. https://doi.org/10.1145/3292048.3292054
• Analytic Calculi for substructural logics: Theory and applications / Ciabattoni, A. (2018). Analytic Calculi for substructural logics: Theory and applications. Logic Colloquium 2018, Udine, EU. http://hdl.handle.net/20.500.12708/86718
• Deontic Reasoning: From Ancient Texts to Artificial Intelligence / Ciabattoni, A. (2018). Deontic Reasoning: From Ancient Texts to Artificial Intelligence. TICAMORE Meeting/Workshop 3, Nancy, EU. http://hdl.handle.net/20.500.12708/86706
• Intermediate logics: from hypersequents to parallel computation / Ciabattoni, A. (2018). Intermediate logics: from hypersequents to parallel computation. British Colloquium for Theoretical Computer Science 2018, London, EU. http://hdl.handle.net/20.500.12708/86696

2017

• Preface / Baaz, M., Ciabattoni, A., Gabbay, D. M., Hetzl, S., & Weller, D. (2017). Preface. Journal of Logic and Computation, 27(2), 415–415. https://doi.org/10.1093/logcom/exu076
• From Cut-free Calculi to Automated Deduction: The Case of Bounded Contraction / Lellmann, B., Ciabattoni, A., Olarte, C., & Pimentel, E. (2017). From Cut-free Calculi to Automated Deduction: The Case of Bounded Contraction. Electronic Notes in Theoretical Computer Science, 332, 75–93. https://doi.org/10.1016/j.entcs.2017.04.006
• Algebraic proof theory: Hypersequents and hypercompletions / Ciabattoni, A., Galatos, N., & Terui, K. (2017). Algebraic proof theory: Hypersequents and hypercompletions. Annals of Pure and Applied Logic, 168(3), 693–737. https://doi.org/10.1016/j.apal.2016.10.012
• Gödel Logic: From Natural Deduction to Parallel Computation / Ciabattoni, A., & Genco, F. (2017). Gödel Logic: From Natural Deduction to Parallel Computation. In Proceedings of 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland (pp. 1–12). http://hdl.handle.net/20.500.12708/56981
• Understanding prescriptive texts: rules and logic elaborated by Mīmāṃsā school / Ciabattoni, A., Genco, F., & Freschi, E. (2017). Understanding prescriptive texts: rules and logic elaborated by Mīmāṃsā school. Online Journal of World Philosophies, 2(1), 19. http://hdl.handle.net/20.500.12708/146793
• Proof-Theory for Non-Classical Logics: Sequent calculi and beyond / Ciabattoni, A. (2017). Proof-Theory for Non-Classical Logics: Sequent calculi and beyond. International Summer School for Proof Theory, Funchal, EU. http://hdl.handle.net/20.500.12708/86646
• Goedel Logic: from Hypersequents to Parallel Computation / Ciabattoni, A. (2017). Goedel Logic: from Hypersequents to Parallel Computation. ISRALOG 2017, Haifa, Israel, Non-EU. http://hdl.handle.net/20.500.12708/86644
• From hypersequents to parallel computation for intermediate logics / Ciabattoni, A. (2017). From hypersequents to parallel computation for intermediate logics. Workshop TICAMORE, Marseille, EU. http://hdl.handle.net/20.500.12708/86645
• Logic-based process calculi: Gödel logic and beyond / Ciabattoni, A. (2017). Logic-based process calculi: Gödel logic and beyond. Workshop Open Problems in Concurrency Theory II, Klosterneuburg, Austria. http://hdl.handle.net/20.500.12708/86643
• How to Reach Heaven: Different career paths / Ciabattoni, A. (2017). How to Reach Heaven: Different career paths. 2nd Logic Mentoring Workshop, Reykjavik, EU. http://hdl.handle.net/20.500.12708/86642
• From hypersequent calculi to parallel computation / Ciabattoni, A. (2017). From hypersequent calculi to parallel computation. International Workshop on Proofs, Paris, EU. http://hdl.handle.net/20.500.12708/86641
• Standard Completeness for extensions of IMTL / Baldi, P., & Ciabattoni, A. (2017). Standard Completeness for extensions of IMTL. In G. Acampora (Ed.), Proceedings of : 2017 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2017, (p. 1). IEEE Computer Society Press. http://hdl.handle.net/20.500.12708/57207
• Bunched Hypersequent Calculi for Distributive Substructural Logics / Ramanayake, R., & Ciabattoni, A. (2017). Bunched Hypersequent Calculi for Distributive Substructural Logics. In T. Eiter (Ed.), LNCS 7180, 21st International Proceedings of 21st Int. Conference on Logic for Programming, Artificial Intelligence and Reasoning (pp. 417–434). Springer LNCS. http://hdl.handle.net/20.500.12708/57070

2016

• Power and Limits of Structural Display Rules / Ciabattoni, A., & Ramanayake, D. R. S. (2016). Power and Limits of Structural Display Rules. ACM Transactions on Computational Logic, 17(3), Article 17. https://doi.org/10.1145/2874775
• Proof search and Co-NP completeness for many-valued logics / Bongini, M., Ciabattoni, A., & Montagna, F. (2016). Proof search and Co-NP completeness for many-valued logics. Fuzzy Sets and Systems, 292, 130–149. https://doi.org/10.1016/j.fss.2015.02.016
• Proof theory of witnessed Gödel logic: A negative result / Baaz, M., & Ciabattoni, A. (2016). Proof theory of witnessed Gödel logic: A negative result. Journal of Logic and Computation, 26(1), 51–64. https://doi.org/10.1093/logcom/ext018
• Hypersequents and Systems of Rules: An Embedding / Ciabattoni, A., & Genco, F. (2016). Hypersequents and Systems of Rules: An Embedding. Syntax Meets Semantics 2016, Barcelona, EU. http://hdl.handle.net/20.500.12708/86317
• Embedding formalisms: hypersequents and two-level systems of rules / Ciabattoni, A., & Genco, F. (2016). Embedding formalisms: hypersequents and two-level systems of rules. In Advances in Modal Logic (AIML 2016) (pp. 197–216). http://hdl.handle.net/20.500.12708/56823
• Systematic proof theory for substructural logics and applications / Ciabattoni, A. (2016). Systematic proof theory for substructural logics and applications. Mathematics for Computation, Niederaltaich, EU. http://hdl.handle.net/20.500.12708/86280
• Analytic Calculi for Non-Classical Logics: Theory and Applications / Ciabattoni, A. (2016). Analytic Calculi for Non-Classical Logics: Theory and Applications. In 25th EACSL Annual Conference on Computer Science Logic (CSL 2016). 25th EACSL Annual Conference on Computer Science Logic, CSL 2016, Marseille, EU. http://hdl.handle.net/20.500.12708/56799

2015

• Mīmāṃsā Deontic Logic: Proof Theory and Applications / Lellmann, B., Ciabattoni, A., Freschi, E., & Genco, F. (2015). Mīmāṃsā Deontic Logic: Proof Theory and Applications. In H. De Nivelle (Ed.), Lecture Notes in Computer Science (pp. 323–338). Springer LNCS. https://doi.org/10.1007/978-3-319-24312-2_22
• Uniform proofs of standard completeness for extensions of first-order MTL / Baldi, P., & Ciabattoni, A. (2015). Uniform proofs of standard completeness for extensions of first-order MTL. Theoretical Computer Science, 603, 43–57. https://doi.org/10.1016/j.tcs.2015.07.014
• Proof Search and Co-NP Completeness for Many-Valued Logics / Ciabattoni, A. (2015). Proof Search and Co-NP Completeness for Many-Valued Logics. Konferenz zu Coherence & Truth-In memoriam Franco Montagna, Pontignano, EU. http://hdl.handle.net/20.500.12708/86114
• Algebraic proof theory for substructural logics and applications / Ciabattoni, A. (2015). Algebraic proof theory for substructural logics and applications. Topology, Algebra, and Categories in Logic 2015 (TACL 2015), Ischia, EU. http://hdl.handle.net/20.500.12708/86113
• Proof theory meets semantics: the case of substructural logics / Ciabattoni, A. (2015). Proof theory meets semantics: the case of substructural logics. Boolean Algebras, Lattices, Algebraic & Quantum Logic, Universal Algebra, Set Theory, and Set-theoretic and Point-free Topology (BLAST 2015), Denton, Texas, Non-EU. http://hdl.handle.net/20.500.12708/86112
• (Algebraic) Proof Theory for Substructural Logics / Ciabattoni, A. (2015). (Algebraic) Proof Theory for Substructural Logics. Algebra and Coalgebra meet Proof Theory VI, 2015, Delft, EU. http://hdl.handle.net/20.500.12708/86111
• Standard Completeness for Uninorm-Based Logics / Baldi, P., & Ciabattoni, A. (2015). Standard Completeness for Uninorm-Based Logics. In 2015 IEEE International Symposium on Multiple-Valued Logic. 2015 IEEE International Symposium on Multiple-Valued Logic (ISMVL 2015), Waterloo, Canada, Non-EU. https://doi.org/10.1109/ismvl.2015.20

2014

• Taming Paraconsistent (and Other) Logics : An Algorithmic Approach / Ciabattoni, A., Lahav, O., Spendier, L. K., & Zamansky, A. (2014). Taming Paraconsistent (and Other) Logics : An Algorithmic Approach. ACM Transactions on Computational Logic, 16(1), 1–23. https://doi.org/10.1145/2661636
• Hypersequent and Display Calculi - a Unified Perspective / Ciabattoni, A., Ramanayake, R., & Wansing, H. (2014). Hypersequent and Display Calculi - a Unified Perspective. Studia Logica, 102(6), 1245–1294. https://doi.org/10.1007/s11225-014-9566-z
• Tools for the investigation of substructural and paraconsistent logics / Ciabattoni, A. (2014). Tools for the investigation of substructural and paraconsistent logics. XXV incontro dell’Associazione Italiana di Logica e sue Applicazioni, Pisa, EU. http://hdl.handle.net/20.500.12708/85913
• (Algebraic) Proof Theory for Substructural Logics and Applications / Ciabattoni, A. (2014). (Algebraic) Proof Theory for Substructural Logics and Applications. 87. Arbeitstagung Allgemeine Algebra (AAA87), Linz, Austria. http://hdl.handle.net/20.500.12708/85914
• A proof theoretic approach to Standard completeness / Ciabattoni, A. (2014). A proof theoretic approach to Standard completeness. Konference: Beyond True and False: Logic, Algebra and Topology, Florenz, EU. http://hdl.handle.net/20.500.12708/85912
• Standard completeness: proof-theoretical and algebraic approaches / Baldi, P., Ciabattoni, A., & Terui, K. (2014). Standard completeness: proof-theoretical and algebraic approaches. 35th Linz Seminar of Fuzzy Set Theory, Linz, Austria. http://hdl.handle.net/20.500.12708/85866
• Non classical proofs: Theory, applications and tools / Ciabattoni, A. (2014). Non classical proofs: Theory, applications and tools. Prague Seminar on Substructural Logics, Prag, Czech Republic, EU. http://hdl.handle.net/20.500.12708/85785
• Tools for the Investigation of Substructural and Paraconsistent Logics / Ciabattoni, A., & Spendier, L. (2014). Tools for the Investigation of Substructural and Paraconsistent Logics. In Logics in Artificial Intelligence (pp. 18–32). LNCS/Springer. https://doi.org/10.1007/978-3-319-11558-0_2

2013

• Formal approaches to rule-based systems in medicine: The case of CADIAG-2 / Ciabattoni, A., Picado Muino, D., Vetterlein, T., & El Zekey, M. (2013). Formal approaches to rule-based systems in medicine: The case of CADIAG-2. International Journal of Approximate Reasoning: Uncertainty in Intelligent Systems, 54(1), 132–148. https://doi.org/10.1016/j.ijar.2012.09.002
• Hypersequent and Labelled Calculi for Intermediate Logics / Ciabattoni, A., Maffezioli, P., & Spendier, L. (2013). Hypersequent and Labelled Calculi for Intermediate Logics. In D. Galmiche & D. Larchey-Wendling (Eds.), Tableaux 2013 (pp. 81–96). http://hdl.handle.net/20.500.12708/54661
• Proof theory for locally finite many-valued logics: Semi-projective logics / Ciabattoni, A., & Montagna, F. (2013). Proof theory for locally finite many-valued logics: Semi-projective logics. Theoretical Computer Science, 480, 26–42. http://hdl.handle.net/20.500.12708/155501
• Power andl limits of structural rules / Ciabattoni, A. (2013). Power andl limits of structural rules. LIX Colloquium 2013: Theory and Application of Formal Proofs, Paris, France, EU. http://hdl.handle.net/20.500.12708/85640
• Analytic calculi for non-classical logics: The Baha'i Method / Ciabattoni, A. (2013). Analytic calculi for non-classical logics: The Baha’i Method. UniLog 2013, Rio de Janeiro, Non-EU. http://hdl.handle.net/20.500.12708/85639
• Analytic calculi for non-classical logics: The Baha'i Method / Ciabattoni, A. (2013). Analytic calculi for non-classical logics: The Baha’i Method. Tenth International Tbilisi Symposium on Language, Logic and Computation, TbiLLC 2013, Tbilisi, Georgia, Non-EU. http://hdl.handle.net/20.500.12708/85638
• Structural extensions of display calculi: A general recipe / Ciabattoni, A., & Ramanayake, R. (2013). Structural extensions of display calculi: A general recipe. In Lecture Notes in Computer Science. 20th International Workshop on Logic, Language, Information and Computation WoLLIC 2013, Darmstadt. Germany, EU. Springer Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-39992-3
• Automated Support for the Investigation of Paraconsistent and Other Logics / Ciabattoni, A., Lahav, O., Spendier, L., & Zamansky, A. (2013). Automated Support for the Investigation of Paraconsistent and Other Logics. In S. Artemov & A. Nerode (Eds.), Proceedings of the Symposium on Logical Foundations in Computer Science (LFCS 2013) (pp. 119–133). http://hdl.handle.net/20.500.12708/54662
• MFCS & CSL 2010 Satellite Workshops: Selected Papers, Fundamenta Informaticae 123 / MFCS & CSL 2010 Satellite Workshops: Selected Papers, Fundamenta Informaticae 123. (2013). In A. Kucera, I. Potapov, A. Ciabattoni, S. Szeider, & R. Freivalds (Eds.), Fundamenta Informaticae. IOS Press. http://hdl.handle.net/20.500.12708/23747
  Project: Complex Reason (2010–2014)

2012

• Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability / Baaz, M., Ciabattoni, A., & Fermüller, C. (2012). Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability. Logical Methods in Computer Science, 8(1). https://doi.org/10.2168/lmcs-8(1:20)2012
• Algebraic proof theory for substructural logics: Cut elimination and completions / Ciabattoni, A., Galatos, N., & Terui, K. (2012). Algebraic proof theory for substructural logics: Cut elimination and completions. Annals of Pure and Applied Logic, 163(3), 266–290. https://doi.org/10.1016/j.apal.2011.09.003
• Proof theory for non-classical logics: negative results / Baaz, M., & Ciabattoni, A. (2012). Proof theory for non-classical logics: negative results. Logic, Algebra and Truth Degrees 2012, JAIST, Ishikawa, Japan, Non-EU. http://hdl.handle.net/20.500.12708/120071
• Nonclassical proofs: theory, applications, and tools / Ciabattoni, A. (2012). Nonclassical proofs: theory, applications, and tools. Logical Models of Reasoning and Computation (LMRC12), Moskau, Russia, Non-EU. http://hdl.handle.net/20.500.12708/85381
• Proof theory for non-classical logics: a negative result / Ciabattoni, A., & Baaz, M. (2012). Proof theory for non-classical logics: a negative result. Pisa Summer Workshop on Proof Theory, Pisa, Italy, EU. http://hdl.handle.net/20.500.12708/85380
• Systematic proof theory for Many-valued logics / Ciabattoni, A. (2012). Systematic proof theory for Many-valued logics. ManyVal´12 (In honor of Antonio Di Nola´s 65th birthday), Salerno, Italy, EU. http://hdl.handle.net/20.500.12708/85379
• Standard Completeness for Extensions of MTL: An Automated Approach / Baldi, P., Ciabattoni, A., & Spendier, L. (2012). Standard Completeness for Extensions of MTL: An Automated Approach. In Logic, Language, Information and Computation (pp. 154–167). Springer. https://doi.org/10.1007/978-3-642-32621-9_12

2011

• First-order satisfiability in Gödel logics: an NP-complete fragment / Baaz, M., Ciabattoni, A., & Preining, N. (2011). First-order satisfiability in Gödel logics: an NP-complete fragment. Theoretical Computer Science, 412(47), 6612–6623. https://doi.org/10.1016/j.tcs.2011.07.015
• MacNeille Comletions of FL-algebras / Ciabattoni, A., Galatos, N., & Terui, K. (2011). MacNeille Comletions of FL-algebras. Algebra Universalis, 66(4), 405–420. https://doi.org/10.1007/s00012-011-0160-1
• Basic contructive connectives, determinism and matric-based semanticst / Ciabattoni, A., & Zamansky, A. (2011). Basic contructive connectives, determinism and matric-based semanticst. TABLEAUX 2011, Bern, Switzerland, Non-EU. http://hdl.handle.net/20.500.12708/119732
• Nonclassical Proofs: theory, applications, and tools / Ciabattoni, A. (2011). Nonclassical Proofs: theory, applications, and tools. 2nd Workshop of the Joint Project “Structural and Computational Proof Theory,” Innsbruck, Austria. http://hdl.handle.net/20.500.12708/85292
• Systematic (and algebraic) proof theory for substructural logics / Ciabattoni, A. (2011). Systematic (and algebraic) proof theory for substructural logics. Truth, Proof and Consequence. Perspectives on Logic, Pisa, Italien, EU. http://hdl.handle.net/20.500.12708/85290
• Power and Limits of Analytic Calculi: Towards a Systematic Proof Theory for Nonclassical Logics / Ciabattoni, A. (2011). Power and Limits of Analytic Calculi: Towards a Systematic Proof Theory for Nonclassical Logics. Workshop on Logic and Computation, Kanazawa, Japan, Non-EU. http://hdl.handle.net/20.500.12708/85263
• Basic constructive connectives, determinism and matrix-based semantics / Ciabattoni, A., Lahav, O., & Zamansky, A. (2011). Basic constructive connectives, determinism and matrix-based semantics. In Lecture Notes in Computer Science. Springer Verlag. https://doi.org/10.1007/978-3-642-22119-4

2010

• Algebaic and proof-theoretic characterizations of truth stressers for MTL and its extensions / Ciabattoni, A., Metcalfe, G., & Montagna, F. (2010). Algebaic and proof-theoretic characterizations of truth stressers for MTL and its extensions. Fuzzy Sets and Systems, 161 (3), 369–389. http://hdl.handle.net/20.500.12708/168054
• Systematic (and algebraic) proof theory for substructural logics / Ciabattoni, A. (2010). Systematic (and algebraic) proof theory for substructural logics. International Workshop PCC-Proof, Computation, Complexity, Bern, Non-EU. http://hdl.handle.net/20.500.12708/85074

2008

• Cut elimination for first order Gödel logic by hyperclause resolution / Baaz, M., Ciabattoni, A., & Fermüller, C. (2008). Cut elimination for first order Gödel logic by hyperclause resolution. In I. Cervesato, H. Veith, & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (LNAI 5330) (pp. 451–466). Springer. http://hdl.handle.net/20.500.12708/40803
• Towards an algorithmic construction of cut-elimination procedures / CIABATTONI, A., & LEITSCH, A. (2008). Towards an algorithmic construction of cut-elimination procedures. Mathematical Structures in Computer Science, 18(1), 81–105. https://doi.org/10.1017/s0960129507006573

2007

• Monadic fragments of Gödel logics: decidability and undecidability / Baaz, M., Ciabattoni, A., & Fermüller, C. (2007). Monadic fragments of Gödel logics: decidability and undecidability. Lecture Notes in Computer Science, 4790, 77–91. http://hdl.handle.net/20.500.12708/168724
• Monadic Fragments of Gödel Logics: Decidability and Undecidability Results / Baaz, M., Ciabattoni, A., & Fermüller, C. (2007). Monadic Fragments of Gödel Logics: Decidability and Undecidability Results. In N. Dershowitz & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (LNAI 4790) (pp. 77–91). Springer. https://doi.org/10.1007/978-3-540-75560-9_8
• Monadic fragments of Gödel logics: decidability and undecability results / Baaz, M., Ciabattoni, A., & Fermüller, C. (2007). Monadic fragments of Gödel logics: decidability and undecability results. 14th International Conference on Logic for Programming Artificial Intelligence and Reasoning 2007, Erivan, Armenia, Non-EU. http://hdl.handle.net/20.500.12708/118584

2006

• Service QoS composition at the level of part names / Aiello, M., Rosenberg, F., Platzer, C., Ciabattoni, A., & Dustdar, S. (2006). Service QoS composition at the level of part names. In Web Services and Formal Methods, Third International Workshop, WS-FM 2006 (LNCS 4184) (pp. 24–37). Springer. http://hdl.handle.net/20.500.12708/40653

2005

• Uniform Rules and Dialogue Games for Fuzzy Logics / Ciabattoni, A., Fermüller, C., & Metcalfe, G. (2005). Uniform Rules and Dialogue Games for Fuzzy Logics. In F. Baader & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (pp. 496–510). Springer. http://hdl.handle.net/20.500.12708/50977

• Normative Compliance in Lexicographic Multi-Objective Reinforcement Learning Agents / Schiehl, B. (2023). Normative Compliance in Lexicographic Multi-Objective Reinforcement Learning Agents [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.113064
  Download: PDF (943 KB)
• A logical analysis of normative reasoning: Agency, action, and argumentation / Van Berkel, C. L. J. (2023). A logical analysis of normative reasoning: Agency, action, and argumentation [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.111854
  Download: PDF (3.93 MB)
• Norm compliance for reinforcement learning agents / Neufeld, E. A. (2023). Norm compliance for reinforcement learning agents [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.112881
  Download: PDF (2.42 MB)
• Analytic proof theory for deontic Mīmāṃsā logic / Mahler, S. (2023). Analytic proof theory for deontic Mīmāṃsā logic [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2023.111021
  Download: PDF (649 KB)
• Extensionality for obligations in Åqvist’s system F / Pichler, D. (2022). Extensionality for obligations in Åqvist’s system F [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.95067
  Download: PDF (645 KB)
• Representing normative reasoning in answer set programming using weak constraints / Hatschka, C. (2022). Representing normative reasoning in answer set programming using weak constraints [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2022.99420
  Download: PDF (925 KB)
• Refining labelled systems for modal and constructive logics with applications / Lyon, T. (2021). Refining labelled systems for modal and constructive logics with applications [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.97064
  Download: PDF (2.45 MB)
• A comprehensive Survey of the actual causality literature / Kueffner, K. R. (2021). A comprehensive Survey of the actual causality literature [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2021.90003
  Download: PDF (3.29 MB)
• Automated generation of analytic calculi for involutive logics / Ymeri, A. (2019). Automated generation of analytic calculi for involutive logics [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.43924
  Download: PDF (727 KB)
• Intermediate logics and concurrent λ-calculi: a proof-theoretical approach / Genco, F. A. (2019). Intermediate logics and concurrent λ-calculi: a proof-theoretical approach [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2019.66600
  Download: PDF (2.14 MB)
• Proof theory for modal logics : embedding between hypersequent calculi and systems of rules / Pavlovi, S. (2018). Proof theory for modal logics : embedding between hypersequent calculi and systems of rules [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2018.58584
  Download: PDF (699 KB)
• Standard completeness : proof-theoretic and algebraic methods / Baldi, P. (2015). Standard completeness : proof-theoretic and algebraic methods [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2015.25980
  Download: PDF (861 KB)
• Realizing negative introspection into justification logic : proof-theoretic approach / Borg, A. (2015). Realizing negative introspection into justification logic : proof-theoretic approach [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2015.29804
  Download: PDF (564 KB)
• Tools for the investigation of sustructural, intermediate and paraconsistent logics / Spendier, L. K. (2015). Tools for the investigation of sustructural, intermediate and paraconsistent logics [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2015.21874
  Download: PDF (2.96 MB)
• Systematic proof theory for non-classical logics : advances and implementation / Spendier, L. K. (2011). Systematic proof theory for non-classical logics : advances and implementation [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:1-42976
  Download: PDF (1.02 MB)

• Nichtklassische Beweise: Theorie, Automatisierung, Anwendung
  2011 / START-Programm / Austria

Soon, this page will include additional information such as reference projects, activities as journal reviewer and editor, memberships in councils and committees, and other research activities.

Until then, please visit Agata Ciabattoni’s research profile in TISS .