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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

Ciabattoni, A., & Vetterlein, T. (2009). On the (fuzzy) logical content of CADIAG-2. Fuzzy Sets and Systems, 161(14), 1941–1958. http://hdl.handle.net/20.500.12708/166461 ( reposiTUm)

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 ( reposiTUm)

Ciabattoni, A., & Metcalfe, G. (2008). Density elimination. Theoretical Computer Science, 403(2–3), 328–346. https://doi.org/10.1016/j.tcs.2008.05.019 ( reposiTUm)

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 ( reposiTUm)

Ciabattoni, A., & Metcalfe, G. (2007). Density elimination and rational completeness for first-order logics. Lecture Notes in Computer Science, 4514, 132–146. http://hdl.handle.net/20.500.12708/168723 ( reposiTUm)

Ciabattoni, A., & Terui, K. (2006). Towards a semantic characterization of cut-elimination. Studia Logica, 82, 95–119. http://hdl.handle.net/20.500.12708/172100 ( reposiTUm)

Ciabattoni, A. (2005). A proof-theoretical investigation of global intuitionistic (fuzzy) logic. Archive for Mathematical Logic, 44, 435–457. http://hdl.handle.net/20.500.12708/171974 ( reposiTUm)

Ciabattoni, A., & Tesi, M. (2024). Sequents vs Hypersequents for Aqvist Systems. In C. Benzmüller, M. Heule, & R. Schmidt (Eds.), Automated Reasoning: 12th International Joint Conference, IJCAR 2024, Nancy, France, July 3-6, 2024, Proceedings, Part II (pp. 176–195). Springer. https://doi.org/10.1007/978-3-031-63501-4_10 ( reposiTUm)

Rozplokhas, D. (2024). LEGO-like Small Model Constructions for Åqvist’s Logics. In A. Ciabattoni, D. Gabelaia, & I. Sedlár (Eds.), Advances in Modal Logic (pp. 631–651). College Publications. http://hdl.handle.net/20.500.12708/202365 ( reposiTUm)

Ciabattoni, A., Eisenhofer, C., & Rozplokhas, D. (2024). Strongly Analytic Calculi for KLM Logics with SMT-Based Prover. In Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning (pp. 284–294). https://doi.org/10.24963/kr.2024/27 ( reposiTUm)

Neufeld, E., Ciabattoni, A., & Tulcan, R. F. (2024). Norm Compliance in Reinforcement Learning Agents via Restraining Bolts. In J. Savelka, J. Harasta, T. Novotna, & J. Misek (Eds.), Legal Knowledge and Information Systems (pp. 119–130). https://doi.org/10.3233/FAIA241239 ( reposiTUm)

Ciabattoni, A., & Rozplokhas, D. (2024). Streamlining Input/Output Logics with Sequent Calculi (Extended Abstract). In K. Larson (Ed.), Proceedings of the Thirty-ThirdInternational Joint Conference on Artificial Intelligence (pp. 8389–8393). https://doi.org/10.24963/ijcai.2024/928 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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). ( reposiTUm)

Ciabattoni, A., Dik, J. F., & Freschi Elisa. (2023). Disambiguating Permissions: A Contribution from Mimamsa. In J. Maranha’o, C. Peterson, C. Strasser, & L. van der Torre (Eds.), Deontic Logic and Normative Systems - 16th International Conference, DEON 2023 (pp. 99–118). College Publications. http://hdl.handle.net/20.500.12708/190020 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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. http://hdl.handle.net/20.500.12708/137005 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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, France. http://hdl.handle.net/20.500.12708/56799 ( reposiTUm)

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 ( reposiTUm)

Lellmann, B., Ciabattoni, A., Freschi, E., & Genco, F. (2015). Mīmāṃsā Deontic Logic: Proof Theory and Applications. In H. De Nivelle (Ed.), Automated Reasoning with Analytic Tableaux and Related Methods 24th International Conference, TABLEAUX 2015, Wroclaw, Poland, September 21-24, 2015, Proceedings (pp. 323–338). Springer LNCS. https://doi.org/10.1007/978-3-319-24312-2_22 ( reposiTUm)

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. https://doi.org/10.1109/ismvl.2015.20 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

Ciabattoni, A., & Ramanayake, R. (2013). Structural extensions of display calculi: A general recipe. In Logic, Language, Information, and Computation. 20th International Workshop on Logic, Language, Information and Computation WoLLIC 2013, Darmstadt, Germany. Springer Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-39992-3_10 ( reposiTUm)

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 ( reposiTUm)

Ciabattoni, A., Lahav, O., & Zamansky, A. (2011). Basic constructive connectives, determinism and matrix-based semantics. In Automated Reasoning with Analytic Tableaux and Related Methods. Springer Verlag. https://doi.org/10.1007/978-3-642-22119-4_11 ( reposiTUm)

Ciabattoni, A., & Rusnok, P. (2010). On the Classical Content of Monadic G with Involutive Negation and its Application to a Fuzzy Medical Expert Systems. In F. Lin, U. Sattler, & M. Truszczynski (Eds.), Principles of Knowledge Representation and Reasoning: Proceedins of the 12th International Conference, KR2010 (pp. 373–381). AAAI Press. http://hdl.handle.net/20.500.12708/51479 ( reposiTUm)

Adlassnig, K.-P., Ciabattoni, A., & Vetterlein, T. (2009). A Formal Logical Framework for Cadiag-2. In K.-P. Adlassnig, B. Blobel, J. Mantas, & I. Masic (Eds.), Medical Informatics in a United and Healthy Europe - Proceedings of MIE 2009 - The XXIInd International Congress of the European Federation for Medical Informatics (pp. 648–652). IOS Press. http://hdl.handle.net/20.500.12708/40859 ( reposiTUm)

Baaz, M., Ciabattoni, A., & Preining, N. (2009). SAT in monadic Gödel logics: a borderline between decidability and undecidability. In Logic, Language, Information and Computation. Springer Verlag. https://doi.org/10.1007/978-3-642-02261-6_10 ( reposiTUm)

Ciabattoni, A., Straßburger, L., & Terui, K. (2009). Expanding the realm of systematic proof theory. In Computer Science Logic. Springer Verlag. https://doi.org/10.1007/978-3-642-04027-6_14 ( reposiTUm)

Avron, A., Ciabattoni, A., & Zamansky, A. (2009). Canonical calculi: invertibility, axiom, expansion and (non)-determinism. In Computer Science - Theory and Applications. Springer Verlag. https://doi.org/10.1007/978-3-642-03351-3_5 ( reposiTUm)

Ciabattoni, A., Galatos, N., & Terui, K. (2008). From Axioms to Analytic Rules in Nonclassical Logics. In 2008 23rd Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society. https://doi.org/10.1109/lics.2008.39 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

Ciabattoni, A., & Terui, K. (2006). Modular cut-elimination: finding proofs or counterexamples. In M. Hermann & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (LNCS 4246) (pp. 135–149). Springer. http://hdl.handle.net/20.500.12708/40652 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

Algebraic and Proof-theoretic Aspects of Non-classical Logics. (2007). In S. Aguzzoli, A. Ciabattoni, B. Gerla, & C. Manara (Eds.), Lecture Notes in Computer Science. Springer. https://doi.org/10.1007/978-3-540-75939-3 ( reposiTUm)

Ciabattoni, A., Gabelaia, D., & Sedlar, I. (Eds.). (2024). Advances in Modal Logic (Vol. 15). College publications. ( reposiTUm)

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 ( reposiTUm)

Ciabattoni, A. (2024, September). Proof surgeries in non-classical logics [Conference Presentation]. NCL’24: Non-Classical Logics: Theory and Applications 2024, Lodz, Poland. ( reposiTUm)

Ciabattoni, A. (2024, June 24). Normative Reasoning: from Sanskrit philosophy to AI [Conference Presentation]. Logic Colloquium 2024, Göteburg, Sweden. ( reposiTUm)

Ciabattoni, A. (2024, July 4). Acquiring and explaining norms for AI systems [Conference Presentation]. Workshop on Computational Law for Autonomous Cars (CLAC), Florenz, Italy. ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

Ciabattoni, A., Genco, F., & Aschieri, F. (2019). Intermediate Logic Proofs as Concurrent Programs. Conference: Syntax meets Semantics (SYSMICS) 2019, Amsterdam, Netherlands (the). http://hdl.handle.net/20.500.12708/86612 ( reposiTUm)

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 ( reposiTUm)

Ciabattoni, A. (2018). Analytic Calculi for substructural logics: Theory and applications. Logic Colloquium 2018, Udine, Italy. http://hdl.handle.net/20.500.12708/86718 ( reposiTUm)

Ciabattoni, A. (2018). Deontic Reasoning: From Ancient Texts to Artificial Intelligence. TICAMORE Meeting/Workshop 3, Nancy, France. http://hdl.handle.net/20.500.12708/86706 ( reposiTUm)

Ciabattoni, A. (2018). Intermediate logics: from hypersequents to parallel computation. British Colloquium for Theoretical Computer Science 2018, London, United Kingdom of Great Britain and Northern Ireland (the). http://hdl.handle.net/20.500.12708/86696 ( reposiTUm)

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 ( reposiTUm)

Ciabattoni, A. (2017). Proof-Theory for Non-Classical Logics: Sequent calculi and beyond. International Summer School for Proof Theory, Funchal, Portugal. http://hdl.handle.net/20.500.12708/86646 ( reposiTUm)

Ciabattoni, A. (2017). From hypersequents to parallel computation for intermediate logics. Workshop TICAMORE, Marseille, France. http://hdl.handle.net/20.500.12708/86645 ( reposiTUm)

Ciabattoni, A. (2017). How to Reach Heaven: Different career paths. 2nd Logic Mentoring Workshop, Reykjavik, Iceland. http://hdl.handle.net/20.500.12708/86642 ( reposiTUm)

Ciabattoni, A. (2017). From hypersequent calculi to parallel computation. International Workshop on Proofs, Paris, France. http://hdl.handle.net/20.500.12708/86641 ( reposiTUm)

Ciabattoni, A. (2017). Goedel Logic: from Hypersequents to Parallel Computation. ISRALOG 2017, Haifa, Israel. http://hdl.handle.net/20.500.12708/86644 ( reposiTUm)

Ciabattoni, A., & Genco, F. (2016). Hypersequents and Systems of Rules: An Embedding. Syntax Meets Semantics 2016, Barcelona, Spain. http://hdl.handle.net/20.500.12708/86317 ( reposiTUm)

Ciabattoni, A. (2016). Systematic proof theory for substructural logics and applications. Mathematics for Computation, Niederaltaich, Germany. http://hdl.handle.net/20.500.12708/86280 ( reposiTUm)

Ciabattoni, A. (2015). Proof Search and Co-NP Completeness for Many-Valued Logics. Konferenz zu Coherence & Truth-In memoriam Franco Montagna, Pontignano, Italy. http://hdl.handle.net/20.500.12708/86114 ( reposiTUm)

Ciabattoni, A. (2015). Algebraic proof theory for substructural logics and applications. Topology, Algebra, and Categories in Logic 2015 (TACL 2015), Ischia, Italy. http://hdl.handle.net/20.500.12708/86113 ( reposiTUm)

Ciabattoni, A. (2015). (Algebraic) Proof Theory for Substructural Logics. Algebra and Coalgebra meet Proof Theory VI, 2015, Delft, Netherlands (the). http://hdl.handle.net/20.500.12708/86111 ( reposiTUm)

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, United States of America (the). http://hdl.handle.net/20.500.12708/86112 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

Ciabattoni, A. (2014). Tools for the investigation of substructural and paraconsistent logics. XXV incontro dell’Associazione Italiana di Logica e sue Applicazioni, Pisa, Italy. http://hdl.handle.net/20.500.12708/85913 ( reposiTUm)

Ciabattoni, A. (2014). A proof theoretic approach to Standard completeness. Konference: Beyond True and False: Logic, Algebra and Topology, Florenz, Italy. http://hdl.handle.net/20.500.12708/85912 ( reposiTUm)

Ciabattoni, A. (2014). Non classical proofs: Theory, applications and tools. Prague Seminar on Substructural Logics, Prag, Czechia. http://hdl.handle.net/20.500.12708/85785 ( reposiTUm)

Ciabattoni, A. (2013). Analytic calculi for non-classical logics: The Baha’i Method. UniLog 2013, Rio de Janeiro, Brazil. http://hdl.handle.net/20.500.12708/85639 ( reposiTUm)

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. http://hdl.handle.net/20.500.12708/85638 ( reposiTUm)

Ciabattoni, A. (2013). Power andl limits of structural rules. LIX Colloquium 2013: Theory and Application of Formal Proofs, Paris, France. http://hdl.handle.net/20.500.12708/85640 ( reposiTUm)

Ciabattoni, A. (2012). Nonclassical proofs: theory, applications, and tools. Logical Models of Reasoning and Computation (LMRC12), Moskau, Russian Federation (the). http://hdl.handle.net/20.500.12708/85381 ( reposiTUm)

Baaz, M., & Ciabattoni, A. (2012). Proof theory for non-classical logics: negative results. Logic, Algebra and Truth Degrees 2012, JAIST, Ishikawa, Japan. http://hdl.handle.net/20.500.12708/120071 ( reposiTUm)

Ciabattoni, A., & Baaz, M. (2012). Proof theory for non-classical logics: a negative result. Pisa Summer Workshop on Proof Theory, Pisa, Italy. http://hdl.handle.net/20.500.12708/85380 ( reposiTUm)

Ciabattoni, A. (2012). Systematic proof theory for Many-valued logics. ManyVal´12 (In honor of Antonio Di Nola´s 65th birthday), Salerno, Italy. http://hdl.handle.net/20.500.12708/85379 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

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 ( reposiTUm)

Baaz, M., Ciabattoni, A., & Preining, N. (2009). SAT in monadic Gödel logics: a borderline between decidability and undecidability. 16th Workshop on Logic, Language, Information and Computation, Tokio, Japan, Non-EU. http://hdl.handle.net/20.500.12708/119026 ( reposiTUm)

Baaz, M., & Ciabattoni, A. (2009). On the limits of analiticity. Eighth Tbilisi Symposium on Language, Logic and Computation, Bakuriani, Georgia, Non-EU. http://hdl.handle.net/20.500.12708/119068 ( reposiTUm)

Ciabattoni, A. (2008). From axioms to analytic rules in nonclassical logics. Non-classical Logics: from Foundations to Applications, Pisa, EU. http://hdl.handle.net/20.500.12708/118569 ( reposiTUm)

Ciabattoni, A. (2007). Uniform standard completeness proofs. Collegium Logicum 2007, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/118564 ( reposiTUm)

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 ( reposiTUm)

Ciabattoni, A. (2007). Density elimination. Moscow-Vienna Workshop on Logic and Computation 2007, TU Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/118577 ( reposiTUm)

Ciabattoni, A. (2006). Automata generation of analytic calculi for logics with linearity. National Institut of Informatics, Tokyo, Japan, Non-EU. http://hdl.handle.net/20.500.12708/118160 ( reposiTUm)

Ciabattoni, A. (2006). Towards a semantic characterzation of cut-elemination. Seminar house, Kusatsu Onsen, Japan, Non-EU. http://hdl.handle.net/20.500.12708/118161 ( reposiTUm)

Ciabattoni, A. (2006). Proof theory of fuzzy logics based on t-norms - an overview. 2nd Insternational Workshop on Analytic Proof Systems (im Rahmen von LPAR2006), Phnom Penh, Cambodia, Non-EU. http://hdl.handle.net/20.500.12708/118163 ( reposiTUm)

Ciabattoni, A. (2006). Semantic characterization of cut-elimination. International Conference Logic, Model and Computer Science, Camerino, Italy, EU. http://hdl.handle.net/20.500.12708/118162 ( reposiTUm)

Ciabattoni, A. (2006). Modular cut-elemination: finding proofs or counterexamples. 13th International Conference on Logic for Programming ,Artificial Intellegence and Reasoning (LPAR), Phnom Penh, Cambodia, Non-EU. http://hdl.handle.net/20.500.12708/118164 ( reposiTUm)

Ciabattoni, A. (2005). Automated generation of analytic calculi for logics with linearity. Italian Logic Meeting AILA05, Pisa, Italy, EU. http://hdl.handle.net/20.500.12708/117730 ( reposiTUm)

Ciabattoni, A. (2005). A proof-theoretical investigation of global intuitionistic (fuzzy) logic. Logic Meetings at Kusatsu Seminar House and Japan Advanced Institute of Science and Technology, Japan, Non-EU. http://hdl.handle.net/20.500.12708/117731 ( reposiTUm)

Ciabattoni, A. (2005). Towards a semantic characterization of cut-elimination. 5th Workshop on Structural Proof Theory, Bern, Switzerland, Non-EU. http://hdl.handle.net/20.500.12708/117733 ( reposiTUm)

Ciabattoni, A. (2005). Automated generation of analytic calculi for logics with linearity. Collegium Logicum 2005 on Cut-Elimination, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/117732 ( reposiTUm)

Ciabattoni, A. (2005). Towards a semantic characterization of cut elimination. Second Florence - Vienna Workshop on Logic and Computation, Florenz, Italy, EU. http://hdl.handle.net/20.500.12708/117735 ( reposiTUm)

Ciabattoni, A. (2005). Towards a semantic characterization of cut-elimination. Workshop on Logic and Computation, Kanazawa, Japan. http://hdl.handle.net/20.500.12708/117734 ( reposiTUm)

Ciabattoni, A. (2004). Analytic calculi for monoidal t-norm based logic. 1st Florence-Vienna Workshop on Logic and Computation, Florence, Italy, Austria. http://hdl.handle.net/20.500.12708/117366 ( reposiTUm)

Ciabattoni, A. (2004). Automated generation of analytic calculi for logics with linearity. Vienna-Paris Wokshop on Proofs and Complexity, Paris, Frankreich, Austria. http://hdl.handle.net/20.500.12708/117360 ( reposiTUm)

Ciabattoni, A. (2003). Hypersequent calculi for non-classical logics. TABLEAUX 2003, Roma, Italy, Austria. http://hdl.handle.net/20.500.12708/116634 ( reposiTUm)

Ciabattoni, A. (2002). Hypersequent calculi for Gödel logics - a survey. 2nd Moscow-Vienna Workshop on Logic and Computation, Moscow, Russia, Austria. http://hdl.handle.net/20.500.12708/115996 ( reposiTUm)

Ciabattoni, A. (2002). A Schütte-Tait style cut-elimination proof for first-order Gödel logic. Meeting of the Bilateral Project Austria - Spain, Barcelona, Spain, Austria. http://hdl.handle.net/20.500.12708/115997 ( reposiTUm)

Ciabattoni, A., Olivetti, N., & Parent, X. (2024). Dyadic obligations: proofs and countermodels via hypersequents. arXiv. https://doi.org/10.48550/arXiv.2406.09088 ( reposiTUm)

Aschieri, F., Ciabattoni, A., & Genco, F. (2018). Disjunctive Axioms and Concurrent lambda-Calculi: a Curry-Howard Approach. http://hdl.handle.net/20.500.12708/154516 ( reposiTUm)

Ciabattoni, A. (2007). Generating analytic calculi for non-classical logics [Professorial Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/178609 ( reposiTUm)