Agata Ciabattoni

Contact

Technische Universität Wien
Inst. of Logic & Computation
Theory and Logic Group E192-05

Address:
Favoritenstrasse 9-11
A-1040 Wien, Austria

E-mail: agata@logic.at
Phone: +43 1 58801-18545
Fax: +43 1 58801-18597

Profile Research Publications Team Personal

Books

• Logica a informatica, McGraw-Hill, 1997 (with A. Asperti). In Italian.
  (The book is used for these logic courses)

Special Issues Edited

• Advances in Modal Logic, AiML 2024, Prague, Czech Republic, August 19-23, 2024. College Publications 2024, ISBN 978-1-84890-467-5 (with D. Gabelaia and I. Sedlar)
• External and Internal Calculi for Non-Classical Logics. Journal of Logic and Computation , 31(3), (2021). (with D. Galmiche, N. Olivetti and R. Ramanayake).
• Concepts and Meaning - Papers in honour of Alexander Leitsch on the occasion of his 60th birthday. Journal of Logic and Computation 27(2), (2017) (with M. Baaz, Dov M. Gabbay, S. Hetzl and D. Weller)
• MFCS and CSL 2010 Satellite Workshops: Selected Papers. Fundamenta Informaticae 123(1), IOS Press, 2013 (with R. Freivalds, A. Kucera, I. Potapov and S. Szeider)
• Algebraic and Proof-theoretic Aspects of Non-classical Logics - Papers in honour of Daniele Mundici on the occasion of his 60th birthday, LNCS 4460, Springer, 2007 (with S. Aguzzoli, B. Gerla, C. Manara and V. Marra).
• Proceedings of COS04 and Ercim (Volume I), Logic Journal of IGPL 13(4), July 2005 (with M. Baaz, D.M. Gabbay, and P. Hájek).
• Proceedings of COS04 and Ercim (Volume II), Logic Journal of IGPL 13(5), September 2005 (with M. Baaz, D.M. Gabbay, and P. Hájek).

International Journals

• Mimamsa on better not permissions. J. of Philosophical Logic. 2025. PDF (with J. Dik, and E. Freschi)
• Deontic paradoxes in Mimamsa logics: there and back again. J. of Logic, Language and Information. 32(1): 19-62. 2023. PDF (with K. van Berkel. E. Freschi, F. Gulisano and M. Olszewski)
• Bounded sequent calculi and restricted embeddings: hypersequent logics. J. of Symbolic Logic , 86(2): 635-668 (2021)
  PDF (with T. Lang and R. Ramanayake).
• Enforcing Ethical Goals over Reinforcement Learning Policies. J. of Ethics and Information Technology . 2021.
  PDF (with E. Neufeld, E. Bartocci and G. Governatori).
• Display to Labeled Proofs and Back Again for Tense Logics. ACM TOCL . 22(3): 20:1-20:31. 2021
  (with T. Lyon, R. Ramanayake and A. Tiu). PDF
• Mimamsa Deontic Reasoning using Specificity: A Proof Theoretic Approach. Artificial Intelligence and Law , 29(3): 351-394. 2021. (with F. Gulisano and B. Lellmann). PDF
• On the Concurrent Computational Content of Intermediate Logics. Theoretical Computer science , 813: pp. 375--409, 2020. (with F. Aschieri and F. Genco). PDF
• Hypersequents and Systems of Rules: Embeddings and Applications. ACM TOCL 19(2): 1-27, 2018.
  (with F. Genco). PDF
• Algebraic proof theory: hypersequents and hypercompletions, Annals of Pure and Applied Logic, 168(3): 693-737, 2017
  (with N. Galatos and K. Terui). PDF
• From cut-free calculi to automated deduction: the case of bounded contraction, ENTCS, 332: 75-93, 2017
  (with B, Lellmann, C. Olarte and E. Pimentel). PDF
• Understanding Prescriptive Texts: Rules and Logic as elaborated by the Mimamsa school. Confluence: Online Journal of World Philosophies , 2(1), pp.47-66, 2017. (with E. Freschi, F. Genco and B. Lellmann). PDF
• Power and limits of structural display rules. ACM TOCL 17(3), 2016 (with R. Ramanayake). PDF
• Proof Search and Co-NP Completeness for Many-Valued Logics. Fuzzy Sets and Systems 292: 130-149 (2016)
  (with M. Bongini and F. Montagna). PDF
• Proof theory of witnessed Goedel logic: a negative result. Journal of Logic and Computation 26(1): 51-64 (2016)
  (with M. Baaz) PDF
• Uniform proofs of standard completeness for extensions of first-order MTL. Theoretical Computer Science vol. 603: 43-57 (2015) (with P. Baldi)
• Taming Paraconsistent (and Other) Logics: An Algorithmic Approach. TOCL 16(1): 5 (2014)
  (with O. Lahav, L. Spendier and A. Zamansky) PDF | Software
• Hypersequent and display calculi -- a unified perspective. Studia Logica 102(6): 1245-1294 (2014)
  (with R. Ramanayake and H. Wansing) PDF
• Proof theory for locally finite many-valued logics: semi-projective logics. Theoretical Computer Science 480: 26-42, 2013
  (with F. Montagna). PDF
• Formal approaches to rule-based systems in medicine: the case of CADIAG2, Journal of Approximate Reasoning 54(1): 132-148, 2013 (with D. Picado, T. Vetterlein and M. El-Zekey). PDF
• Theorem proving for prenex Gödel logic with Delta: checking validity and unsatisfiability, Logical Methods for Computer Science 8(1), 2012 (with M. Baaz and C.G. Fermüller). PDF
• Algebraic proof theory for substructural logics: cut-elimination and completions, Annals of Pure and Applied Logic, 163(3): 266-290, 2012
  (with N. Galatos and K. Terui). PDF
• First-order satisfiability in Gödel logics: an NP-complete fragment, Theoretical Computer Science, 412: 6612-6623, 2011
  (with M. Baaz and N. Preining). PDF
• MacNeille Completions of FL-algebras, Algebra Universalis 66(4): 405-420, 2011
  (with N. Galatos and K. Terui). PDF
• On the (fuzzy) logical content of CADIAG-2, Fuzzy Sets and Systems, 161(14): 1941-1958, 2010
  (with T. Vetterlein). PDF
• Algebraic and proof-theoretic characterizations of truth stressers for MTL and its extensions, Fuzzy Sets and Systems, 161(3): 369-389, 2010
  (with G. Metcalfe and F. Montagna). PDF
• Density Elimination, Theoretical Computer Science 403(2-3): 328-346, 2008
  (with G. Metcalfe). PDF
• Towards an Algorithmic Construction of Cut-Elimination Procedures, Mathematical Structures in Computer Science 18(1): 81-105, 2008
  (with A. Leitsch). PDF
• Towards a semantic characterization of cut-elimination, Studia logica 82(1): 95-119, 2006
  (with K. Terui). PDF (Addenda)
• A Proof-theoretical Investigation of Global Intuitionistic (Fuzzy) Logic, Archive of Mathematical Logic 44: 435-457, 2005. PDF
• Analytic Calculi for Monoidal T-norm Based Logic, Fundamenta Informaticae, Vol. 59, N. 4, 315-332, 2004,
  (with M. Baaz and F. Montagna). PS
• Hypersequent Calculi for Gödel Logics - a Survey, Journal of Logic and Computation 13: 835-861, 2003
  (with M. Baaz and C.G. Fermüller). PDF
• T-norm based logics with n-contraction, Neural Network World 12(5): 441-452, 2002
  (with F. Esteva and L. Godo). PS
• Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models, Journal of Logic and Computation 11(2): 283-294, 2001
  (with M. Ferrari). PDF (Corrigenda)
• Finiteness of infinite-valued Lukasiewicz logic, Journal of Logic, Language and Information 9: 5-29, 2000
  (with S. Aguzzoli). PS
• Sequent calculi for finite-valued Lukasiewicz logics via boolean decompositions, Journal of Logic and Computation 10(2): 213-222, 2000
  (with S. Aguzzoli and A. Di Nola).
• Cut free proof systems for logics of weak excluded middle, Soft Computing 2(4): 147-156, 1998
  (with D.M. Gabbay and N. Olivetti).
• A Sufficient Condition for Completability of Partial Combinatory Algebras, Journal of Symbolic Logic 62(4): 1209-1214, 1997
  (with A. Asperti).

International Conferences

• A Bayesian View of the Result Model. DIGHUM-25. (with Y.Morello)
• GL-based calculi for PCL and its deontic cousin. JELIA 2025 (with D.Rozplokhas and M. Tesi) PDF
• From Legal Texts to Defeasible Deontic Logic via LLMs: A Study in Automated Semantic Analysis. ASAIL 2025 (with E. Horner, C. Mateis and G. Governatori)
• Analytic Proofs for Tense Logic. TABLEAUX 2025 (with T. Lang and R.Ramanayake) PDF
• Combining MORL with Restraining Bolts to Learn Normative Behaviour. IJCAI 2025 (with E. Neufeld and R. Tulcan) PDF
• Deontic Explanations in Aqvist's Systems. DEON 2025 (with B. Istenic Urh and X. Parent) PDF
• Support + Belief = Decision Trust . SIROCCO 2025 (with A. Aldini, D. Pichler and Mirko Tagliaferri) PDF
• Tackling Temporal Deontic Challenges with Equilibrium Logic. AAMAS 2025 (with D Solda, P. Cabalar and E. Neufeld) PDF
• Norm Compliance in Reinforcement Learning Agents via Restraining Bolts. JURIX 2024 (with E. Neufeld, and R. Tulcan) PDF
• Strongly Analytic Calculi for KLM Logics with SMT-Based Prover. KR 2024 (with C. Eisenhofer, and D. Rozplokhas) PDF
• Streamlining Input/Output Logics with Sequent Calculi (Extended Abstract). IJCAI 2024 Sister Conferences Best Paper Track. (with D. Rozplokhas)
• Sequents vs hypersequents for Aqvist systems IJCAR 2024 (with M. Tesi) PDF
• Deontic Equilibrium Logic with eXplicit negation. JELIA 2023 (with P. Cabalar, and L. van der Torre) PDF
• Streamlining Input/Output Logics with Sequent Calculi. KR 2023 Best paper award (with D. Rozplokhas) PDF
• Cut-restrictions: from cuts to analytic cuts, LICS 2023 , (with T. Lang and R. Ramanayake) PDF
• Permissions in a Kelsenian perspective. Proc. of the 36th International Conference on Legal Knowledge Representation and Information Systems JURIX 2023 , IOS Press. (with X. Parent and G. Sartor) PDF
• Disambiguating permissions: A contribution from Mimamsa, DEON 2023 , (with J. Dik and E. Freschi) PDF
• Analytic proof theory for Aqvist system F, DEON 2023 (with N. Olivetti, X. Parent, R. Ramanayake and D. Rozplokhas), PDF
• Deontic Paradoxes in ASP with Weak Constraints. Technical Communication at ICLP 2023 . Electronic Proceedings in Theoretical Computer Science 08/2023; 385:367-380. (with C. Hatschka and T. Eiter) PDF
• On Normative Reinforcement Learning via Safe Reinforcement Learning. PRIMA 2022. PDF (with E. Neufeld and E. Bartocci).
  
• Dyadic Obligations: Proofs and Countermodels via Hypersequents. PRIMA 2022. PDF (with N.Olivetti and X. Parent)
• Taming Bounded Depth with Nested Sequents. AIML 2022. PDF (with L. Strassburger and M. Tesi)
• A Kelsenian deontic logic. 34th International Conference on Legal Knowledge Representation and Information Systems (JURIX 2021), IOS Press. PDF (with X. Parent and G. Sartor)
• The Gentle Murder Paradox in Sanskrit Philosophy. DEON 2020/2021. PDF (with K. van Berkel. E. Freschi, F. Gulisano and M. Olszewski)
• A Normative Supervisor for Reinforcement Learning Agents. CADE 2021. PDF (with E. Neufeld, E. Bartocci and G. Governatori).
• Bilattice CADIAG-II: Theory and Experimental Results. Proceedings of the International Conference on Artificial Intelligence and Computational Intelligence (AICI 2021) , Springer. (with. P. Baldi and K-P. Adlassnig)
• Sequent Rules for Reasoning and Conflict Resolution in Conditional Norms, Proceedings of DEON 2020/2021 , PDF (with B. Lellmann)
• A typed parallel lambda calculus via 1-depth intermediate proofs, Proceedings of LPAR 2020 , (with F. Aschieri and F. Genco) PDF
• Evaluating Networks of Arguments: A Case Study in Mimamsa Dialectics, Proceedings of LORI 2019 , (with K. van Berkel, E. Freschi and S. Modgil) PDF
• Bounded sequent calculi for non-classical logics via hypersequents , Proceedings of TABLEAUX 2019 , (with T. Lang and R. Ramanayake) PDF
• Classical Proofs as parallel programs. Proceedings of Gandalf 2018, Electronic Proceedings in Theoretical Computer Science 277, pp. 43-57 (with F. Aschieri and F. Genco). PDF
• Resolving conflicting obligations in Mimamsa: a sequent-based approach. Proceedings of DEON 2018, (with F. Gulisano and B. Lellmann) PDF
• From Display to Labelled Proofs for Tense Logics. Proceedings of LFCS 2018, (with T. Lyon and R. Ramanayake). PDF
• Goedel Logic: From Natural Deduction to Parallel Computation. Proceedings of LICS 2017, (with F. Aschieri and F. Genco). PDF
• Bunched Hypersequent Calculi for Distributive Substructural Logics. Proceedings of LPAR 2017, (with R. Ramanayake). PDF
• Standard completeness for extensions of IMTL. Proceedings of FUZZ-IEEE 2017: International Conference on Fuzzy Systems, (with P. Baldi and F. Gulisano) PDF
• Embedding formalisms: hypersequents and two-level systems of rules. Proceedings of AIML 2016 , (with F. Genco) PDF
• Mimamsa Deontic Logic: Proof Theory and Applications. Proceedings of TABLEAUX 2015, (with E. Freschi, F. Genco and B. Lellmann) PDF
• Standard completeness for uninorm-based logics. Proceedings of the IEEE International Symposium on Multiple-Valued Logic (ISMVL 2015), Waterloo (Canada), (with P. Baldi) PDF.
• Tools for the investigation of substructural and paraconsistent logics. Proceedings of JELIA 2014 , (with L. Spendier) PDF | Software
• Hypersequent and Labelled Calculi for Intermediate Logics, Proceedings of TABLEAUX 2013 , (with P. Maffezioli and L. Spendier) PDF
• Structural extensions of display calculi: a general recipe, Proceedings of WOLLIC 2013 , (with R. Ramanayake). PDF
• Automated Support for the Investigation of Paraconsistent and Other Logics, Proceedings of the Symposium on Logical Foundations in Computer Science 2013, LFCS 2013, S. Artemov and A. Nerode (Eds.), LNCS (with O. Lahav, L. Spendier and A. Zamansky). PDF | Software
• Standard completeness for extensions of MTL: an automated approach, Proceedings of the Workshop on Logic, Language, Information and Computation, WOLLIC 2012, L. Ong and R. de Queiroz (Eds.), LNCS 7456, 154-167, Springer, Heidelberg, 2012 (with P. Baldi and L. Spendier). PDF
• Basic Constructive Connectives, Determinism and Matrix-based Semantics, Proceedings of Automated Reasoning with Analytic Tableaux and Related Methods, LNCS 6793, 119-133, Tableaux 2011 (with O. Lahav and A. Zamansky). PDF
• On the classical content of Gödel logic with strong negation and its application to a fuzzy medical expert system, Proceedings of Knowledge Representation and Reasoning KR2010, IEEE (with P. Rusnok). PDF
• Expanding the realm of systematic proof theory, Proceedings of Computer Science Logic, CSL 2009, LNCS (with L. Strassburger and K. Terui). PDF
• SAT in Monadic Gödel Logics: a borderline between decidability and undecidability, Proceedings of Workshop on Logic, Language, Information and Computation, WOLLIC 2009, LNAI (with M. Baaz and N. Preining). PDF
• A formal logical framework for CADIAG-2, Proceedings of Medical Informatics Europe, MIE 2009, Sarajevo, Studies in Health Technology and Informatics series, IOS Press (with T. Vetterlein and K-P. Adlassnig)
• Canonical Calculi: Invertibility, Axiom-Expansion and (Non)-determinism, Proceedings of Computer Science Symposium in Russia (CSR2009), LNCS (with A. Avron and A. Zamansky). PDF
• Cut elimination for first order Gödel logic by hyperclause resolution, Proceedings of Logic for Programming and Automated Reasoning (LPAR 2008), LNCS 5330, 451-466 (with M. Baaz and C.G. Fermüller). PDF
• From axioms to analytic rules in nonclassical logics, Proceedings of the IEEE Symposium on Logic in Computer Science (LICS 2008), IEEE, 229-240, 2008 (with N. Galatos and K. Terui). PDF | Software
• Monadic Fragments of Gödel Logics: Decidability and Undecidability Results, Proceedings of Logic for Programming and Automated Reasoning (LPAR 2007), LNAI 4790, 77-91, 2007 (with M. Baaz and C.G. Fermüller). PDF
• Density Elimination and Rational Completeness for First-Order Logics, Proceedings of the Symposium on Logical Foundations of Computer Science (LFCS 2007), LNCS 4514, 132-146, 2007 (with G. Metcalfe). PDF
• Modular Cut-Elimination: Finding Proofs or Counterexamples, Proceedings of Logic for Programming and Automated Reasoning (LPAR 2006), LNAI 4246, 135-149, 2006 (with K. Terui). PDF
• Uniform Rules and Dialogue Games for Fuzzy Logics, Proceedings of Logic for Programming and Automated Reasoning (LPAR 2005), LNAI 3452, 496-510, 2004 (with C. Fermüller and G. Metcalfe). PDF
• Automated Generation of Analytic Calculi for Logics with Linearity, Proceedings of Computer Science Logic (CSL 2004), LNCS 3210, 505-517. PDF
• Bounded Lukasiewicz Logics, Proceedings of Automated Reasoning with Analytic Tableaux and Related Methods (Tableaux 2003), LNAI 2796, 32-47, 2003 (with G. Metcalfe). PS
• From Intuitionistic Logic to Gödel-Dummett Logic via Parallel Dialogue Games, Proceedings of IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), Tokyo, (Japan), May 2003, 188-193 (with C.G. Fermüller). PDF
• A Schütte-Tait style cut-elimination proof for first-order Gödel logic, Proceedings of Automated Reasoning with Analytic Tableaux and Related Methods (Tableaux 2002), Copenhagen (Denmark), August 2002, LNAI 2381, 24-38 (with M. Baaz). PDF
• Herbrand's Theorem for Prenex Gödel Logic and its Consequences for Theorem Proving, Proceedings of Logic for Programming and Automated Reasoning (LPAR 2001), Cuba, December 2001, LNAI 2250, 201-216 (with M. Baaz and C.G. Fermüller). PDF
• Hypersequents as a uniform framework for Urquhart's C, MTL and related logics, Proceedings of IEEE International Symposium on Multiple-Valued Logic (ISMVL 2001), Warsaw (Poland), May 2001, IEEE Computer Society Press, 227-232 (with C.G. Fermüller).
• Cut-Elimination in a Sequents-of-Relations Calculus for Gödel Logic, Proceedings of the IEEE International Symposium on Multiple-Valued Logic (ISMVL 2001), Warsaw (Poland), May 2001, IEEE Computer Society Press, 181-186 (with M. Baaz and C.G. Fermüller).PDF
• Quantified Propositional Gödel Logic, Proceedings of Logic for Programming and Automated Reasoning (LPAR 2000), Reunion Island, November 2000, LNAI 1955, 240-257, (with M. Baaz and R. Zach). PS
• Hypertableau and Path-Hypertableau Calculi for some families of intermediate logics, Proceedings of Automated Reasoning with Analytic Tableaux and Related Methods (Tableaux 2000), St. Andrews (Scotland), July 2000, LNAI 1847, 160-175 (with M. Ferrari). PDF
• On Urquhart's C logic, Proceedings of the IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000), Portland (USA), May 2000, IEEE Computer Society Press, 113-118. PS
• On the Undecidability of Some Sub-classical First-Order Logics, Proceedings of Foundations of Software Technology and Theoretical Computer Science (FST&TCS 1999), Chennai, December 1999, LNCS 1738, 258-268 (with M. Baaz , C.G. Fermüller and H. Veith). PS
• Bounded contraction in systems with linearity, Proceedings of Automated Reasoning with Analytic Tableaux and Related Methods (Tableaux 1999), Saratoga (NY), June 1999, LNAI 1617, 113-128.
• Proof Theory of Fuzzy Logics: Urquhart's C and related logics, Proceedings of Mathematical Foundations of Computer Science (MFCS'98), Brno, August 1998, LNCS 1450, 203-212 (with M. Baaz, C.G. Fermüller and H. Veith).
• Two connections between Linear Logic and Lukasiewicz Logic, Proceedings of Computational Logic and Proof Theory - Kurt Gödel Colloquium (KGC 1997), Vienna, August 1997, LNCS 1289, 128-139 (with D. Luchi).
• Effective Applicative Structures, Proceedings of Category Theory in Computer Science (CTCS 1995) Cambridge (UK), August 1995, LNCS 953, 81-95, (with A. Asperti). PDF

National Conferences

• On Completability of Partial Combinatory Algebras, Fifth Italian Conference on Theoretical Computer Science (ICTCS 1995), Ravello, Italy. November 1995. A. De Santis ed., World Scientific, 162-175 (with A. Asperti). PDF

Book Chapters

• Towards an interpretation of the medical expert system CADIAG2. Fuzziness and Medicine: Philosophical Reflections and Application Systems in Health Care , Studies in Fuzziness and Soft Computing, R. Seising and M. Tabacchi eds. Volume 302, 2013, pp 323-338 (with D. Picado and T. Vetterlein).
• Sequent of Relations Calculi: a Framework for Analytic Deduction in Many-Valued Logics, Beyond two: Theory and applications of Multiple-Valued Logics, M. Fitting and E. Orlowska eds., Physica-Verlag, 157-180, 2003 (with M. Baaz and C.G. Fermüller). PDF
• A Natural Deduction System for Intuitionistic Fuzzy Logic, Lectures on Soft Computing and Fuzzy Logic, A. Di Nola, G. Gerla eds., Physica-Verlag, 1-18, 2000 (with M. Baaz and C.G. Fermüller). PS

International Workshops

• Service QoS Composition at the Level of Part Names, Proceedings of WS-FM 2006, LNCS 4184, 24-37, 2006 (with M. Aiello, F. Rosenberg, C. Platzer and S. Dunstdar).
• A Guide to Quantified Propositional Gödel Logic, Proceedings of the IJCAR Workshop on Theory and Applications of Quantified Boolean Formulas (QBF 2001), Siena (Italy), June 2001 (with M. Baaz , N. Preining and H. Veith).