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.
Contact
- Laura Kovacs, Coordinator
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-six 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.
-
Algorithms and Complexity
E192-01 / Head: Stefan Szeider -
Databases and Artificial Intelligence
E192-02 / Head: Stefan Woltran -
Knowledge-Based Systems
E192-03 / Head: Thomas Eiter -
Formal Methods in Systems Engineering
E192-04 / Head: Laura Kovacs -
Theory and Logic
E192-05 / Head: Agata Ciabattoni -
Security and Privacy
E192-06 / Head: Matteo Maffei -
Artificial Intelligence Techniques
E192-07 / Head: Thomas Lukasiewicz -
Privacy Enhancing Technologies
E192-08 / Head: Dominique Schröder
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.
Recent Projects
-
FINGO: Finite Graph Operating Automata Meet Dynamic Logics
2026 – 2029 / Austrian Science Fund (FWF) -
Optimal Cross-Chain and Cross-Layer Protocols (CROSS)
2026 – 2030 / Vienna Science and Technology Fund (WWTF) -
Cross-Domain Privacy-Preserving Protocols and Symmetric Cryptography
2026 – 2029 / Vienna Science and Technology Fund (WWTF) -
Structural Analysis in Combinatorial Reconfiguration
2025 – 2028 / Austrian Science Fund (FWF) -
Data Engineering and Artificial Intelligence
2025 – 2031 / European Commission -
A Logical Framework for Graded Deontic Reasoning
2025 – 2027 / Austrian Science Fund (FWF)
Publication: 221601 -
CGC - Changing Gendered Cultures
2024 – 2026 / WWTF Wiener Wissenschafts-, Forschu und Technologiefonds -
Building Robust and Explainable AI-based Defenses for Computer Security
2024 – 2030 / Vienna Science and Technology Fund (WWTF)
Publications: 223656 / 222934 / 222191 -
Combining Computer Algebra with SAT for Word-Level Reasoning
2024 – 2027 / Austrian Science Fund (FWF)
Publications: 209724 / 222933 / 222932 / 222930 / 222940 / 222828 / 228560 -
Health virtual twins for the personalised management of stroke related to atrial fibrillation
2024 – 2028 / European Commission
Publications: 210251 / 210250 / 210252 / 216532 / 219450 / 221540 / 227282 -
Logical methods for Deontic Explanations
2024 – 2028 / Austrian Science Fund (FWF)
Publications: 193684 / 193611 / 193531 / 195506 / 199778 / 199737 / 199833 / 199690 / 200681 / 200686 / 200696 / 202365 / 204587 / 204297 / 205612 / 207868 / 209718 / 207952 / 208013 / 207954 / 210204 / 210202 / 209500 / 221601 / 221679 -
Alternating Symmetry-Breaking Combinatorial Search with SAT
2024 – 2027 / Austrian Science Fund (FWF)
Publication: 208555 -
Explainable Artificial Intelligence in Healthcare
2023 – 2027 / AXA -
Abenteuer Informatik für Volksschulen
2023 – 2025 / BUNDESMINISTERIN FÜR FRAUEN, FAMILIE, INTEGRATION UND MEDIEN
Publications: 189688 / 220874 -
Fixing the Broken Bridge Between Mobile Apps and the Web
2023 – 2027 / Vienna Science and Technology Fund (WWTF)
Publications: 191166 / 191151 / 203681 / 203809 / 204362 / 222619 / 223688 / 223690 / 226229 -
A Composable Rational Framework for Blockchain Systems
2022 – 2025 / Austrian Science Fund (FWF)
Publications: 150285 / 191199 / 190025 / 190616 / 190619 / 191168 / 200038 / 204344 / 204483 / 204345 / 209770 / 223687 / 224027 -
Axiomatizing conditional normative reasoning
2021 – 2024 / Austrian Science Fund (FWF)
Publications: 135863 / 136986 / 189829 / 190615 / 190605 / 191181 / 191117 / 191127 / 191821 / 199163 / 208075 / 208693 / 136177 / 137030 / 136992 -
Cooperative Optimization (Extension)
2021 – 2022 / Honda Research Institute Europe Gmb -
Mosaic -- modal logics
2021 – 2026 / European Commission
Publications: 190990 / 191061 / 190605 / 208571 / 209776 -
Automated Reasoning with Theories and Induction for Software Technologies
2021 – 2026 / European Commission
Publications: 152197 / 177097 / 154343 / 139734 / 152387 / 144346 / 150329 / 153774 / 150352 / 142174 / 153940 / 153941 / 154268 / 153819 / 153259 / 154161 / 153840 / 153839 / 153838 / 153837 / 153258 / 153836 / 153834 / 146113 / 193882 / 175984 / 177657 / 188020 / 188037 / 187706 / 18556 / 18557 / 18558 / 190634 / 190028 / 191945 / 192519 / 191930 / 193254 / 192768 / 193203 / 192933 / 193131 / 192842 / 192672 / 193926 / 192673 / 192946 / 193074 / 195542 / 199514 / 203670 / 203666 / 208567 / 209724 / 209712 / 209749 / 209750 / 209924 / 212559 / 210457 / 211021 / 19886 / 220908 / 221536 / 222118 / 222596 / 223659 / 222121 / 222933 / 225296 / 225668 / 226091 / 226881 / 226882 / 227059 / 101800
Recent Publications
-
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
- A Voting-Based Blockchain Interoperability Oracle / Scaffino, G., Schulte, S., Sober, M., & Spanring, C. (2022). A Voting-Based Blockchain Interoperability Oracle. In 2021 IEEE International Conference on Blockchain (Blockchain). IEEE International Conference on Blockchain (Blockchain 2021), Melbourne, Australia. IEEE. https://doi.org/10.1109/blockchain53845.2021.00030
- 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 (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) -
IoTCrawler: Challenges and Solutions for Searching the Internet of Things
/
Iggena, T., Ilyas, E. B., Fischer, M., Tönjes, R., Elsaleh, T., Rezvani, R., Pourshahrokhi, N., Bischof, S., Fernbach, A., Parreira, J. X., Schneider, P., Smirnov, P., Strohbach, M., Truong, H., González-Vidal, A., Skarmeta, A. F., Singh, P., Beliatis, M. J., Presser, M., & Martinez, J. A. (2021). IoTCrawler: Challenges and Solutions for Searching the Internet of Things. Sensors, 21(5), Article 1559. https://doi.org/10.3390/s21051559
Downloads: PDF (2.32 MB) / XML without embedded media (205 KB) / EPUB (8.26 MB) -
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
- Rely-guarantee bound analysis of parameterized concurrent shared-memory programs : With an application to proving that non-blocking algorithms are bounded lock-free / Pani, T., Weissenbacher, G., & Zuleger, F. (2021). Rely-guarantee bound analysis of parameterized concurrent shared-memory programs : With an application to proving that non-blocking algorithms are bounded lock-free. Formal Methods in System Design, 57(2), 270–302. https://doi.org/10.1007/s10703-021-00370-8
- Ein Ansatz zur Wiederherstellung ausgefallener Hardwarekomponenten in Fail-Operational Architekturen : Eine Erweiterung von FDIRO / Kain, T., Mehlhorn, M. A., Horeis, T. F., Heinrich, J., & Tompits, H. (2021). Ein Ansatz zur Wiederherstellung ausgefallener Hardwarekomponenten in Fail-Operational Architekturen : Eine Erweiterung von FDIRO. In VDI Wissensforum GmbH (Ed.), Technische Zuverlässigkeit 2021 (pp. 297–308). VDI Verlag. http://hdl.handle.net/20.500.12708/58693
-
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings
/
Fischl, W., Gottlob, G., Longo, D. M., & Pichler, R. (2021). HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings. ACM Journal on Experimental Algorithmics, 26, 1–40. https://doi.org/10.1145/3440015
Project: HyperTrac (2018–2022) - 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
- Not All Bugs Are Created Equal, But Robust Reachability Can Tell the Difference / Girol, G., Farinier, B., & Bardin, S. (2021). Not All Bugs Are Created Equal, But Robust Reachability Can Tell the Difference. In Computer Aided Verification (pp. 669–693). Springer LNCS. https://doi.org/10.1007/978-3-030-81685-8_32
Recent Theses
-
Mining and Verification of Mobile App Store Privacy Labels: A Comparative Study of Huawei AppGallery and Google Play Store
/
Wagner, P. (2026). Mining and Verification of Mobile App Store Privacy Labels: A Comparative Study of Huawei AppGallery and Google Play Store [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.136544
Download: PDF (2.1 MB) -
Android OAT Library Detection
/
Gewald, P. J. (2026). Android OAT Library Detection [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.128602
Download: PDF (1.36 MB) -
Reconfiguration of Resource Allocation
/
Eyjólfsson, L. (2026). Reconfiguration of Resource Allocation [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.129205
Download: PDF (798 KB) -
An UPgrade for HCP: Solving the Hamiltonian Cycle Problem via User Propagators
/
Funder, F. (2026). An UPgrade for HCP: Solving the Hamiltonian Cycle Problem via User Propagators [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.139586
Download: PDF (3.38 MB) - Automatic pipe routing approach for HVAC systems in complex building architectures / Oberbacher, M. (2026). Automatic pipe routing approach for HVAC systems in complex building architectures [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.138840
-
From Translations to Boxes: Convexifying Knowledge Graph Embedding Approaches, TransE and BoxE
/
Morgan, H. H. A. A. (2026). From Translations to Boxes: Convexifying Knowledge Graph Embedding Approaches, TransE and BoxE [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.139285
Download: PDF (1.23 MB) -
The Silent Bridge: How Web-to-App Mechanisms Enable User Tracking
/
Ploner, A. (2026). The Silent Bridge: How Web-to-App Mechanisms Enable User Tracking [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.139283
Download: PDF (1.19 MB) -
User Behavior Simulation with Large Language Models for Security Evaluation
/
Moser, L. (2026). User Behavior Simulation with Large Language Models for Security Evaluation [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.132647
Download: PDF (6.22 MB) -
Explainable RL Agents for Conflict Resolution in Air Traffic Control
/
Hamm, S. (2026). Explainable RL Agents for Conflict Resolution in Air Traffic Control [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.137226
Download: PDF (8.83 MB) -
An implementation of Shor's algorithm for elliptic curve cryptography
/
Luxbacher, B. (2026). An implementation of Shor’s algorithm for elliptic curve cryptography [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.132746
Download: PDF (1.02 MB) -
Vampires can Lean into trust: checking proofs for soundness
/
Bodingbauer, J. (2026). Vampires can Lean into trust: checking proofs for soundness [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.139594
Download: PDF (58.7 MB) -
Thiele Methods for Comment Selection under Trichotomous Preferences
/
Forster, S. (2026). Thiele Methods for Comment Selection under Trichotomous Preferences [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.142862
Download: PDF (1.7 MB) -
Entropy-Steering: A Lookahead Approach to High-Capacity Generative Linguistic Steganography
/
Johnston, E. (2026). Entropy-Steering: A Lookahead Approach to High-Capacity Generative Linguistic Steganography [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.133201
Download: PDF (1.1 MB) -
Using Graph Neural Networks to Capture SHACL Constraints in Graph Data
/
Miarasadollahnejad, A. H. (2026). Using Graph Neural Networks to Capture SHACL Constraints in Graph Data [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.131965
Download: PDF (873 KB) -
Computational Methods for Analyzing Decentralized Finance Ecosystems
/
Kitzler, S. (2026). Computational Methods for Analyzing Decentralized Finance Ecosystems [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.139200
Download: PDF (3.42 MB) -
Enumerating Graphs with respect to their Choosability
/
Seka, D. (2026). Enumerating Graphs with respect to their Choosability [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.142822
Download: PDF (747 KB) -
An Inquiry into the Nature of Predictive Model Classes and the Forecasting of Corporate Insolvency
/
Sakka, M. A. (2026). An Inquiry into the Nature of Predictive Model Classes and the Forecasting of Corporate Insolvency [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.137286
Download: PDF (2.23 MB) -
Improving Onion Routing in Tor
/
Pillwax, W. (2026). Improving Onion Routing in Tor [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.129611
Download: PDF (1.07 MB) -
Built to Behave: Constraining Reinforcement Learning Agents with Restraining Bolts
/
Tulcan, R. F. (2026). Built to Behave: Constraining Reinforcement Learning Agents with Restraining Bolts [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.130021
Download: PDF (1.8 MB) -
Non-monotonic Description Logics Based on Predicate Minimization
/
Di Stefano, F. (2026). Non-monotonic Description Logics Based on Predicate Minimization [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2026.140693
Download: PDF (3.33 MB)
Recent Awards
-
Katja Hose:
Best Paper Award
2025 / European Conference on Advances in Databases and Information Systems (ADBIS) 2025 / Finland / Website -
Katja Hose:
Distinguished Associate Editor Award
2025 / PVLDB/VLDB 2025 / UK / Website -
Katja Hose:
ACM Senior Membership
2025 / ACM / USA / Website -
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