TU Wien Informatics

Overview and Contact Computer Engineering (CE) Information Systems Engineering (ISE) Logic and Computation (LC) Visual Computing and Human-Centered Technology (VC+HCT)

Logic and Computation

Over the last few decades, computers have been increasingly used for tasks that were once thought the sole preserve of human intelligence. Scientists have developed ways of formally representing knowledge and using “intelligent” methods to solve problems with the aid of computers. This field is generally described as computational intelligence.

Logic and Computation

Contact

Research Topics

  • Algorithms and Complexity
  • Computational Logic and Deduction
  • Constraints and Satisfiability
  • Problem Solving and Optimization
  • Foundations of Databases and Artificial Intelligence
  • Knowledge Representation and Reasoning Methods
  • Semantic Systems and the Web
  • Formal Methods for Security and Privacy
  • Verification and Safety of Computer Systems
  • Natural Computing and Formal Languages

About

Over the last few decades, computers have been increasingly used for tasks that were once thought the sole preserve of human intelligence. Scientists have developed ways of formally representing knowledge and using “intelligent” methods to solve problems with the aid of computers. This field is generally described as computational intelligence.

Logic and Computation focuses on logical methods and algorithms for modeling, constructing, and analyzing complex and intelligent computer systems. The research focus comprises basic research on mathematical logic, automated decision procedures, and algorithms and their complexity, as well as applications of logical methods to data and knowledge bases, semantic systems, artificial intelligence, and formal methods for building and operating computer systems. Logic serves as a unifying theme that provides the theory and tools to acquire, represent, and manipulate information in intelligent systems, and to address challenges such as the security, safety, and correctness of safety-critical and distributed systems.

Research Units

Eight of the faculty’s twenty-five research units are primarily focused on topics related to Logic and Computation. Visit their pages to learn about current projects, publications, courses, and the people involved.

Below is a small selection of recent research activities related to Logic and Computation. To learn more, visit the pages of the research units listed above.

  • Exact and meta-heuristic approaches for the production leveling problem / Vass, J., Lackner, M.-L., Mrkvicka, C., Musliu, N., & Winter, F. (2022). Exact and meta-heuristic approaches for the production leveling problem. Journal of Scheduling, 25(3), 339–370. https://doi.org/10.1007/s10951-022-00721-1
    Download: PDF (1.5 MB)
    Project: ARTIS (2017–2025)
  • Reasoning on DL-LiteR with Defeasibility in ASP / Bozzato, L., Eiter, T., & Serafini, L. (2022). Reasoning on DL-LiteR with Defeasibility in ASP. Theory and Practice of Logic Programming, 22(2), 254–304. https://doi.org/10.1017/s1471068421000132
  • Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach / Wallinger, M., Archambault, D., Auber, D., Nöllenburg, M., & Peltonen, J. (2022). Edge-Path Bundling: A Less Ambiguous Edge Bundling Approach. IEEE Transactions on Visualization and Computer Graphics, 28(1), 313–323. https://doi.org/10.1109/tvcg.2021.3114795
  • ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures / Leutgeb, L., Moser, G., & Zuleger, F. (2022). ATLAS: Automated Amortised Complexity Analysis of Self-adjusting Data Structures. In Computer Aided Verification (pp. 99–122). https://doi.org/10.1007/978-3-030-81688-9_5
  • Strong-separation Logic / Pagel, J., & Zuleger, F. (2022). Strong-separation Logic. In ESOP 2021: Programming Languages and Systems (pp. 664–692). Springer. https://doi.org/10.1007/978-3-030-72019-3_24
  • Moment-based analysis of Bayesian network properties / Stankovič, M., Bartocci, E., & Kovács, L. (2022). Moment-based analysis of Bayesian network properties. Theoretical Computer Science, 903, 113–133. https://doi.org/10.1016/j.tcs.2021.12.021
  • Induction with Recursive Definitions in Superposition / Hajdu, M., Hozzová, P., Kovács, L., & Voronkov, A. (2021). Induction with Recursive Definitions in Superposition. In Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design – FMCAD 2021 (Vol. 2, pp. 246–255). TU Wien Academic Press. https://doi.org/10.34727/2021/isbn.978-3-85448-046-4_34
    Download: PDF (350 KB)
  • When catalytic P systems with one catalyst can be computationally complete. / Freund, R., Ivanov, S., & Alhazov, A. (2021). When catalytic P systems with one catalyst can be computationally complete. Journal of Membrane Computing, 3(3), 170–181. https://doi.org/10.1007/s41965-021-00079-x
    Download: PDF (1.87 MB)
  • 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)
  • Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures / Bozatto, L., Eiter, T., & Kiesel, R. P. D. (2021). Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures. Theory and Practice of Logic Programming, 21(5), 593–609. https://doi.org/10.1017/s1471068421000284
  • Instance space analysis for a personnel scheduling problem / Kletzander, L., Musliu, N., & Smith-Miles, K. (2021). Instance space analysis for a personnel scheduling problem. Annals of Mathematics and Artificial Intelligence, 89(7), 617–637. https://doi.org/10.1007/s10472-020-09695-2
    Download: PDF (4.52 MB)
    Project: ARTIS (2017–2025)
  • P systems with limited number of objects / Freund, R., Ivanov, S., & Alhazov, A. (2021). P systems with limited number of objects. Journal of Membrane Computing, 3(1), 1–9. https://doi.org/10.1007/s41965-020-00068-6
    Download: PDF (1.38 MB)
  • Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture / Bagheri Ghavam Abadi, B., Feder, T., Fleischner, H., & Subi, C. (2021). Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette’s Conjecture. Journal of Graph Theory, 96(2), 269–288. https://doi.org/10.1002/jgt.22612
  • Financial Data Exchange with Statistical Confidentiality: A Reasoning-based Approach / Bellomarini, L., Blasi, L., Laurendi, R., & Sallinger, E. (2021). Financial Data Exchange with Statistical Confidentiality: A Reasoning-based Approach. In Y. Velegrakis, D. Zeinalipour-Yazti, P. Chrysanthis, & F. Guerra (Eds.), Proceedings of the 24th International Conference on Extending Database Technology, EDBT 2021, Nicosia, Cyprus, March 23 - 26, 2021 (pp. 558–569). OpenProceedings.org. https://doi.org/10.5441/002/edbt.2021.66
    Project: KnowledgeGraph (2020–2028)
  • Davis and Putnam Meet Henkin: Solving DQBF with Resolution / Blinkhorn, J., Peitl, T., & Slivovsky, F. (2021). Davis and Putnam Meet Henkin: Solving DQBF with Resolution. In Theory and Applications of Satisfiability Testing – SAT 2021 (pp. 30–46). LNCS / Springer. https://doi.org/10.1007/978-3-030-80223-3_4
  • Finding the Hardest Formulas for Resolution (Extended Abstract) / Peitl, T., & Szeider, S. (2021). Finding the Hardest Formulas for Resolution (Extended Abstract). In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada, Canada. https://doi.org/10.24963/ijcai.2021/657
  • Updatable Signatures and Message Authentication Codes / Cini, V., Ramacher, S., Slamanig, D., Striecks, C., & Tairi, E. (2021). Updatable Signatures and Message Authentication Codes. In Public-Key Cryptography – PKC 2021 (pp. 691–723). Springer, Cham. https://doi.org/10.1007/978-3-030-75245-3_25
  • On the Readability of Abstract Set Visualizations / Wallinger, M., Jacobsen, B., Kobourov, S. G., & Nöllenburg, M. (2021). On the Readability of Abstract Set Visualizations. IEEE Transactions on Visualization and Computer Graphics, 27(6), 2821–2832. https://doi.org/10.1109/tvcg.2021.3074615
  • MetroSets: Visualizing Sets as Metro Maps / Jacobsen, B., Wallinger, M., Kobourov, S. G., & Nöllenburg, M. (2021). MetroSets: Visualizing Sets as Metro Maps. IEEE Transactions on Visualization and Computer Graphics, 27(2), 1257–1267. https://doi.org/10.1109/tvcg.2020.3030475
  • CQELS 2.0: Towards A Unified Framework for Semantic Stream Fusion / Le-Tuan, A., Nguyen Duc, M., Chien-Quang, L., Tran, T.-K., Hauswirth, M., Eiter, T., & Le Phuoc, D. (2021). CQELS 2.0: Towards A Unified Framework for Semantic Stream Fusion. In 5th Stream Reasoning Workshop (SRW 2021). 5th Stream Reasoning Workshop (SRW 2021), Mailand, Italy. http://hdl.handle.net/20.500.12708/58752
  • Katja Hose: Distinguished Meta-Reviewer Award
    2025 / EDBT/ICDT 2025 Joint Conference / Spain / Website
  • Thomas Eiter: AIIA Fellow
    2025 / Industry Academy / China
  • Bayar Ilhan Menzat: Outstanding Paper Award
    2024 / Empirical Methods in Natural Language Processing / USA / Website
  • Katja Hose: Manfred Paul Award - Extraction of Validating Shapes from very large Knowledge Graphs (VLDB 2023)
    2024 / International Federation for Information Processing (IFIP) / Germany / Website
  • Thomas Eiter: AAIA Fellow
    2024 / Asia-Pacific Artificial Intelligence Association / China
  • Thomas Eiter: Alan Robinson 20 Years Test of Time Award
    2023 / Association for Logic Programming / UK
  • Tobias Geibinger: ASAI Master Thesis Prize
    2023 / Austrian Society for Artificial Intelligence (ASAI) / Austria
  • Katja Hose: Best Demo Award - GLENDA: Querying over RDF Archives with SPARQL
    2023 / European Semantic Web Conference (ESWC) 2023 / Greece / Website
  • Katja Hose: Best Paper Award - Automated Ontology Evaluation: Evaluating Coverage and Correctness using a Domain Corpus
    2023 / International Workshop on Natural Language Processing for Knowledge Graph Creation (NLP4KGC) 2023 / USA / Website
  • Thomas Eiter: KR 2022 Test of Time Award
    2022 / International Conference on Principles of Knowledge Representation and Reasoning / USA
  • Nysret Musliu: Best Industry and Applications Track Paper Award
    2022 / ICAPS 2022 / Singapore / Website
  • Reinhard Pichler: Best Paper Award at the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems
    2022 / ACM SIGMOD / USA / Website
  • Thomas Eiter: Full Member of the Austrian Academy of Sciences (ÖAW)
    2022 / Mitgliedschaft / Austria
  • Reinhard Pichler: 2021 Alonzo Church Award for Outstanding Contributions to Logic and Computation
    2021 / ACM SIGLOG / USA / Website
  • Thomas Eiter: ACM Fellow
    2020 / ACM Fellowship / USA
  • Nysret Musliu: Best Practices in Education Award
    2019 / Informatics Europe / Switzerland / Website
  • Thomas Eiter: Best Paper of the 3rd International Joint Conference on Rules and Reasoning (RuleML+RR 2019)
    2019 / 3rd International Joint Conference on Rules and Reasoning (RuleML+RR 2019), September 16-19, 2019, Bolzano, Italy / Germany
  • Thomas Eiter: Best Systems Paper Award of the 35th International Conference on Logic Programming (ICLP 2019)
    2019 / 35th International Conference on Logic Programming (ICLP 2019), September 22-25, 2019, Las Cruces, New Mexico, USA / UK
  • Thomas Eiter: Best Student Paper of the 15th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2019)
    2019 / 15th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2019), Jun 3-7, 2019, Philadelphia, USA / USA
  • Thomas Eiter: Best Paper Award of the 34th International Conference on Logic Programming (ICLP 2018)
    2018 / 34th International Conference on Logic Programming (ICLP 2018), July 14- 17, 2018, Oxford, UK / UK