People
Researchers
Lauri Hella
- Professor Emerita/Emeritus
- Faculty of Information Technology and Communication Sciences
- Tampere University
- lauri.hella@tuni.fi
About me
I am an emeritus professor of mathematics. My research areas are mathematical logic and logic in computer science.
Before retiring I was leading the Tampere Logic Group.
Research topics
Definability theory of generalized quantifiers
Ehrenfeucht-Fraisse games and formula size games, and their applications
Descriptive complexity theory: logical characterizations of complexity classes
Modal and first-order dependence logics and team semantics
Research fields
Mathematics, theoretical computer science
L. Hella: Definability hierarchies of generalized quantiers. Annals of Pure and Applied Logic 43 (1989): 235-271.
L. Hella: Logical hierarchies in PTIME. Information and Computation 129 (1996): 1-19.
L. Hella, L. Libkin, J. Nurmonen, and L. Wong: Logics with aggregate operators. Journal of the ACM 48 (2001): 880-907.
P. Galliani and L. Hella: Inclusion logic and fixed point logic. Proc. 22th Annual Conference the EACSL (CSL), 2013, pages 281-295.
L. Hella, M. Järvisalo, A. Kuusisto, J. Laurinharju, T. Lempiäinen, K. Luosto, J. Suomela, and J. Virtema: Weak models of distributed computing, with connections to modal logic. Distributed Computing 28(1) (2015): 31-53.
L. Hella and A. Kuusisto: Existential second-order logic and modal logic with quantified accessibility relations. Information and Computation 247 (2016): 217-234.
Dimension in team semantics
Hella, L., Luosto, K. & Väänänen, J., 2024, (E-pub ahead of print) julkaisussa: MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE.Tutkimustuotos: Artikkeli › Tieteellinen › vertaisarvioitu
Game characterizations for the number of quantifiers
Hella, L. & Luosto, K., 2024, (E-pub ahead of print) julkaisussa: MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE.Tutkimustuotos: Artikkeli › Tieteellinen › vertaisarvioitu
Quantifiers Closed Under Partial Polymorphisms
Dawar, A. & Hella, L., helmik. 2024, 32nd EACSL Annual Conference on Computer Science Logic, CSL 2024. Murano, A. & Silva, A. (toim.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 23. (Leibniz International Proceedings in Informatics, LIPIcs; Vuosikerta 288).Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu
A Completeness Proof for a Regular Predicate Logic with Undefined Truth Value
Valmari, A. & Hella, L., 2023, julkaisussa: NOTRE DAME JOURNAL OF FORMAL LOGIC. 64, 1, s. 61-93 33 SivumääräTutkimustuotos: Artikkeli › Tieteellinen › vertaisarvioitu
Descriptive Complexity for Distributed Computing with Circuits
Ahvonen, V., Heiman, D., Hella, L. & Kuusisto, A., elok. 2023, 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023. Leroux, J., Lombardy, S. & Peleg, D. (toim.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 9. (Leibniz International Proceedings in Informatics, LIPIcs; Vuosikerta 272).Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu
The Expressive Power of CSP-Quantifiers
Hella, L., 1 helmik. 2023, 31st EACSL Annual Conference on Computer Science Logic, CSL 2023. Klin, B. & Pimentel, E. (toim.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 25. (Leibniz International Proceedings in Informatics; Vuosikerta 252).Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu
Bounded game-theoretic semantics for modal mu-calculus
Hella, L., Kuusisto, A. & Rönnholm, R., 2022, julkaisussa: Information and Computation. 289, B, 19 Sivumäärä, 104882.Tutkimustuotos: Artikkeli › Tieteellinen › vertaisarvioitu
Complexity thresholds in inclusion logic
Hannula, M. & Hella, L., 2022, julkaisussa: Information and Computation. 287, 104759.Tutkimustuotos: Artikkeli › Tieteellinen › vertaisarvioitu
Defining Long Words Succinctly in FO and MSO
Hella, L. & Vilander, M., 2022, Revolutions and Revelations in Computability: 18th Conference on Computability in Europe, CiE 2022, Swansea, UK, July 11–15, 2022, Proceedings. Berger, U., Franklin, J. N. Y., Manea, F. & Pauly, A. (toim.). Springer, s. 125-138 14 Sivumäärä (Lecture Notes in Computer Science; Vuosikerta 13359).Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu
Independence-friendly logic without Henkin quantification
Barbero, F., Hella, L. & Rönnholm, R., 16 kesäk. 2021, julkaisussa: Archive for Mathematical Logic.Tutkimustuotos: Artikkeli › Tieteellinen › vertaisarvioitu
Tomi Janhunen
- Professor
- Computer Science
- Faculty of Information Technology and Communication Sciences
- Tampere University
- +358503182250
- tomi.janhunen@tuni.fi
Field of expertise
Artificial Intelligence, Knowledge Representation and Reasoning, Logic Programming, Answer Set Programming and Optimization, Theoretical Computer Science
Finnish Association of Computer Science, Member of the Board 2019-2021, Vice Chair 2021
Finnish Artificial Intelligence Society (FAIS), Member of the Board 2020-2023, Vice Chair 2020-2021, Chair 2022-2023
Automating Cybersecurity Compliance in DevSecOps with Open Information Model for Security as Code
Haverinen, H., Janhunen, T., Päivärinta, T., Lempinen, S., Kaartinen, S. & Merilä, S., 22 lokak. 2024, Proceedings of 4th Eclipse Security, AI, Architecture and Modelling Conference on Data Spaces, eSAAM 2024. ACM, s. 93-102 10 SivumääräTutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu
Improved Encodings of Acyclicity for Translating Answer Set Programming into Integer Programming
Rankooh, M. F. & Janhunen, T., 2024, Proceedings of the 33rd International Joint Conference on Artificial Intelligence, IJCAI 2024. Larson, K. (toim.). International Joint Conferences on Artificial Intelligence, s. 3369-3376 8 Sivumäärä (IJCAI International Joint Conference on Artificial Intelligence).Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu
Integrating Competencies into Preventive Maintenance Scheduling with Answer Set Optimization
Yli-Jyrä, A., Ikävalko, H. & Janhunen, T., 2024, Foundations of Information and Knowledge Systems: 13th International Symposium, FoIKS 2024, Sheffield, UK, April 8–11, 2024, Proceedings. Meier, A. & Ortiz, M. (toim.). Cham, Switzerland: Springer, s. 381-400 20 Sivumäärä (Lecture Notes in Computer Science; Vuosikerta 14589 LNCS).Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu
Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs
Feyzbakhsh Rankooh, M. & Janhunen, T., 2023, julkaisussa: THEORY AND PRACTICE OF LOGIC PROGRAMMING. 23, 4, s. 782-796Tutkimustuotos: Artikkeli › Tieteellinen › vertaisarvioitu
Generalizing Level Ranking Constraints for Monotone and Convex Aggregates
Janhunen, T., syysk. 2023, Proceedings 39th International Conference on Logic Programming: EPTCS 385. Costantini, S., Pontelli, E., Russo, A., Toni, F., Calegari, R., D'Avila Garcez, A., Dodaro, C., Fabiano, F., Gaggl, S. & Mileo, A. (toim.). Open Publishing Association, s. 101-115 15 Sivumäärä 12. (Electronic Proceedings in Theoretical Computer Science; Vuosikerta 385).Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu
Pruning Redundancy in Answer Set Optimization Applied to Preventive Maintenance Scheduling
Yli-Jyrä, A., Feyzbakhsh Rankooh, M. & Janhunen, T., 2023, Practical Aspects of Declarative Languages - 25th International Symposium, PADL 2023, Proceedings. Hanus, M. & Inclezan, D. (toim.). Springer, s. 279-294 16 Sivumäärä (Lecture Notes in Computer Science; Vuosikerta 13880).Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu
Short Boolean Formulas as Explanations in Practice
Jaakkola, R., Janhunen, T., Kuusisto, A., Feyzbakhsh Rankooh, M. & Vilander, M., 24 syysk. 2023, Logics in Artificial Intelligence. Gaggl, S., Martinez, M. V. & Ortiz, M. (toim.). Springer, Vuosikerta 14281. s. 90-105 16 Sivumäärä 7. (Lecture Notes in Computer Science; Vuosikerta 14281).Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu
Applying Answer Set Optimization to Preventive Maintenance Scheduling for Rotating Machinery
Yli-Jyrä, A. & Janhunen, T., 14 jouluk. 2022, Rules and Reasoning: 6th International Joint Conference on Rules and Reasoning, RuleML+RR 2022. Berlin, Germany, September 26–28, 2022. Proceedings. Governatori, G. & Turhan, A.-Y. (toim.). Springer, s. 3-19 17 Sivumäärä (Lecture Notes in Computer Science; Vuosikerta 13752).Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu
Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination.
Rankooh, M. F. & Janhunen, T., 2022, LPNMR 2022: Logic Programming and Nonmonotonic Reasoning. s. 203-216 (Lecture Notes in Computer Science; Vuosikerta 13416).Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu
Explainability via Short Formulas: the Case of Propositional Logic with Implementation
Jaakkola, R., Janhunen, T., Kuusisto, A., Feyzbakhsh Rankooh, M. & Vilander, M., 5 syysk. 2022, Joint Proceedings of the 1st International Workshop on HYbrid Models for Coupling Deductive and Inductive ReAsoning HYDRA} 2022 and the 29th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion RCRA 2022 co-located with the 16th International Conference on Logic Programming and Non-monotonic Reasoning LPNMR 2022, Genova Nervi, Italy, September 5, 2022. CEUR Workshop Proceedings, Vuosikerta 3281. s. 64-77 13 Sivumäärä ( CEUR workshop proceedings).Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu
Antti Kuusisto
- Senior Research Fellow
- Mathematics, ITC and Tampere Institute for Advanced Study
- Faculty of Information Technology and Communication Sciences
- Tampere University
- antti.kuusisto@tuni.fi
About me
Senior Research Fellow, a joint position in the Faculty of Information Science and Faculty of Information Technology and Communication Sciences and Tampere Institute for Advanced Study. I was an Academy Research Fellow of the Academy of Finland from September 2019 to August 2024.
Responsibilities
I am currently the Head of Consortium and PI of the project “Explaining AI via Logic”. I am also the PI of the Academy of Finland project “Theory of Computational Logics”.
Field of expertise
Mathematical logic and theoretical computer science.
Miikka Vilander
- Postdoctoral Research Fellow
- Faculty of Information Technology and Communication Sciences
- Tampere University
- miikka.vilander@tuni.fi
Kerkko Luosto
- University Lecturer
- alana matematiikka
- Faculty of Information Technology and Communication Sciences
- Tampere University
- +358503185908
- kerkko.luosto@tuni.fi
Veeti Ahvonen
- Student, Doctoral Research
- Faculty of Information Technology and Communication Sciences
- Tampere University
- veeti.ahvonen@tuni.fi
-
Available by email.
- https://orcid.org/0009-0007-4819-0199
About me
I am a PhD student and supervised by Antti Kuusisto and Lauri Hella. I graduated with a Master's degree in mathematics from Tampere University 2022. I sometimes work as a teaching assistant for mathematics courses.
Field of expertise
- Mathematical logic
- Descriptive complexity
Research topics
Mathematical logic
Descriptive complexity
Finite model theory
Study descriptive complexity of modern models of computing e.g. distributed computing and neural networks.
Descriptive Complexity for Neural Networks via Boolean Networks
Ahvonen, V., Heiman, D. & Kuusisto, A., 27 helmik. 2024, 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024). Murano, A. & Silva, A. (toim.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Vuosikerta 288. s. 9:1-9:22 22 Sivumäärä (Leibniz International Proceedings in Informatics (LIPIcs); Vuosikerta 288).Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu
Descriptive Complexity for Distributed Computing with Circuits
Ahvonen, V., Heiman, D., Hella, L. & Kuusisto, A., elok. 2023, 48th International Symposium on Mathematical Foundations of Computer Science, MFCS 2023. Leroux, J., Lombardy, S. & Peleg, D. (toim.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 9. (Leibniz International Proceedings in Informatics, LIPIcs; Vuosikerta 272).Tutkimustuotos: Konferenssiartikkeli › Tieteellinen › vertaisarvioitu
Damian Heiman
- Grant Holder, Doctoral Research
- Faculty of Information Technology and Communication Sciences
- Tampere University
- damian.heiman@tuni.fi
Reijo Jaakkola
- Doctoral Researcher
- Faculty of Information Technology and Communication Sciences
- Tampere University
- reijo.jaakkola@tuni.fi
Masood Feyzbakhsh Rankooh
- Postdoctoral Research Fellow
- Faculty of Information Technology and Communication Sciences
- Tampere University
- masood.feyzbakhshrankooh@tuni.fi
About me
I am a Postdoctoral Research Fellow at Tampere University, specializing in Answer Set Programming (ASP), Automated Reasoning, and Constraint Programming. My research primarily focuses on advancing ASP techniques to enhance AI problem-solving, particularly in optimization and knowledge representation. With a strong background from Aalto University and Sharif University of Technology, I am also involved in projects related to Explainable AI, where I strive to make AI systems more transparent and interpretable.
Responsibilities
As a Postdoctoral Research Fellow, I develop cutting-edge algorithms for Answer Set Programming (ASP) and its applications in AI planning and optimization. I also mentor graduate students, involve in research collaborations, and actively participate in publishing and presenting research findings at major AI conferences.
Field of expertise
My expertise centers on Answer Set Programming (ASP), with additional strengths in Automated Reasoning, SAT-based Planning, Constraint Programming, and Knowledge Representation. I have developed innovative ASP-based techniques that are crucial for solving complex AI problems, including applications in Explainable AI.
Research unit
Mathematics unit (MATH), Faculty of Information Technology and Communication Sciences, Tampere University.
Research fields
- Answer Set Programming (ASP)
- Satisfiability (SAT)
- Constraint Programming
- AI Planning and Heuristic Search
- Knowledge Representation and Reasoning
- Explainable AI
Research career
My academic career includes a Postdoctoral Fellowship at Tampere University, a Postdoctoral Researcher position at Aalto University, and extensive experience in AI research at Sharif University of Technology. My work, especially in Answer Set Programming (ASP) and Explainable AI, has been published in leading AI conferences and journals. I am dedicated to advancing AI through innovative ASP research and making AI systems more interpretable and practical.
Best Paper Award at the 39th International Conference on Logic Programming (ICLP 2023) for work on ASP.
Development of efficient translations of ASP into SAT and Integer Programming.
Significant contributions to Explainable AI, recognized through multiple publications.
My research aims to push the boundaries of Answer Set Programming (ASP) and its integration into broader AI systems. I also focus on employing ASP particularly in the context of Explainable AI, where making AI systems more interpretable and transparent is crucial.
Program Committee Member: European Conference on Artificial Intelligence (ECAI), AAAI Conference on Artificial Intelligence, and International Conference on Automated Planning and Scheduling (ICAPS)
- Jussi Rintanen and Masood Feyzbakhsh Rankooh. Symmetry-Breaking Constraints for Directed Graphs. 26th European Conference on Artificial Intelligence (ECAI 2024).
- Masood Feyzbakhsh Rankooh and Tomi Janhunen. Improved Encodings of Acyclicity for Translating Answer Set Programming into Integer Programming. Thirty-Third International Joint Conference on Artificial Intelligence (IJCAI 2024).
- Masood Feyzbakhsh Rankooh and Tomi Janhunen. Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs (Extended Abstract). Thirty-Third International Joint Conference on Artificial Intelligence (IJCAI 2024).
- Masood Feyzbakhsh Rankooh and Tomi Janhunen. Capturing (Optimal) Relaxed Plans with Stable and Supported Models of Logic Programs. Theory and Practice of Logic Programming 23(4), pp. 782-796, 2023. Best Paper Award at the 39th International Conference on Logic Programming (ICLP 2023).
- Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, and Miikka Vilander. Short Boolean Formulas as Explanations in Practice. Logics in Artificial Intelligence - 18th European Conference (JELIA 2023).
- Anssi Yli-Jyrä, Masood Feyzbakhsh Rankooh, and Tomi Janhunen. Pruning Redundancy in Answer Set Optimization Applied to Preventive Maintenance Scheduling. Practical Aspects of Declarative Languages - 25th International Symposium (PADL 2023).
- Reijo Jaakkola, Tomi Janhunen, Antti Kuusisto, Masood Feyzbakhsh Rankooh, and Miikka Vilander. Explainability via Short Formulas: the Case of Propositional Logic with Implementation. Joint Proceedings of the 1st International Workshop on HYbrid Models for Coupling Deductive and Inductive ReAsoning (HYDRA 2022) and the 29th RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA 2022) co-located with the 16th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2022).
- Masood Feyzbakhsh Rankooh and Tomi Janhunen. Efficient Computation of Answer Sets via SAT Modulo Acyclicity and Vertex Elimination. Logic Programming and Nonmonotonic Reasoning - 16th International Conference (LPNMR 2022).
- Masood Feyzbakhsh Rankooh and Jussi Rintanen. Efficient Computation and Informative Estimation of h+ by Integer and Linear Programming. Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling (ICAPS 2022).
- Masood Feyzbakhsh Rankooh and Jussi Rintanen. Efficient Encoding of Cost Optimal Delete-Free Planning as SAT. 36th AAAI Conference on Artificial Intelligence (AAAI 2022).
- Masood Feyzbakhsh Rankooh and Jussi Rintanen. Propositional Encodings of Acyclicity and Reachability by Using Vertex Elimination. 36th AAAI Conference on Artificial Intelligence (AAAI 2022).
- Masood Feyzbakhsh Rankooh and Gholamreza Ghassem-Sani. ITSAT: An Efficient SAT-Based Temporal Planner. Journal of Artificial Intelligence Research (JAIR), Vol. 53, 2015, pp. 541-632.
- Masood Feyzbakhsh Rankooh and Gholamreza Ghassem-Sani. New Encoding Methods for SAT-based Temporal Planning. Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013).
- Masood Feyzbakhsh Rankooh, Ali Mahjoob, and Gholamreza Ghassem-Sani. Using Satisfiability for Non-optimal Temporal Planning. 13th European Conference on Logics in Artificial Intelligence (JELIA 2012).
- Masood Feyzbakhsh Rankooh and Gholamreza Ghassem-Sani. A Complete State-Space Based Temporal Planner. Proceedings of the 23rd IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2011).
Jonne Iso-Tuisku
- Doctoral student
- Department of Mathematics and Statistics
- University of Helsinki