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](/assets/w18/1.8.10/images/pixel-770x550.png)
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
Seven of the faculty’s twenty-three 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
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
-
Combining Computer Algebra with SAT for Word-Level Reasoning
2024 – 2027 / Austrian Science Fund (FWF) -
Alternating Symmetry-Breaking Combinatorial Search with SAT
2024 – 2027 / Austrian Science Fund (FWF) -
Logical methods for Deontic Explanations
2024 – 2026 / Austrian Science Fund (FWF)
Publications: 193684 / 193611 / 193531 / 195506 -
Explainable Artificial Intelligence in Healthcare
2023 – 2027 / AXA -
Abenteuer Informatik für Volksschulen
2023 – 2024 / BUNDESMINISTERIN FÜR FRAUEN, FAMILIE, INTEGRATION UND MEDIEN
Publication: 189688 -
Fixing the Broken Bridge Between Mobile Apps and the Web
2023 – 2027 / Vienna Science and Technology Fund (WWTF)
Publications: 191166 / 191151 -
A Composable Rational Framework for Blockchain Systems
2022 – 2025 / Austrian Science Fund (FWF)
Publications: 150285 / 191199 / 190025 / 190616 / 190619 / 191168 -
Axiomatizing conditional normative reasoning
2021 – 2024 / Austrian Science Fund (FWF)
Publications: 135863 / 136986 / 189829 / 190615 / 190605 / 191181 / 191117 / 191127 / 191821 / 136177 / 137030 / 136992 -
Cooperative Optimization (Extension)
2021 – 2022 / Honda Research Institute Europe Gmb -
Mosaic -- modal logics
2021 – 2025 / European Commission
Publications: 190990 / 191061 / 190605 -
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 / 19886 / 101800 -
FOREST: First-Order Reasoning for Ensuring System Security
2021 – 2022 / Amazon Research Awards -
Blockchain Technologies for the Internet of Things
2020 – 2025 / Christian Doppler Research Association (CDG)
Publications: 139862 / 139860 / 153863 / 158286 / 152968 / 152969 / 175654 / 154428 / 158188 / 171624 / 177467 / 190648 / 189835 / 190192 / 189792 / 189878 / 190025 / 192610 / 190685 / 192166 -
IoTIO: Analyzing and Understanding the Internet of Insecure Things
2020 – 2025 / Vienna Science and Technology Fund (WWTF)
Publications: 150264 / 175968 / 176906 / 190633 / 190031 / 193214 / 190032 / 194425 / 191166 / 78069 / 58517 / 80253 -
Security and Privacy Foundations of Blockchain Technologies
2020 – 2024 / SBA Research gemeinnützige GmbH
Publications: 190633 / 190031 / 190032 / 194425 / 192610 / 192677 / 192585 -
Cryptographic Foundations of Privacy in Distributed Ledgers
2020 – 2027 / Vienna Science and Technology Fund (WWTF)
Publications: 142523 / 139748 / 142534 / 150318 / 153193 -
Vienna Cybersecurity and Privacy Research Center
2019 – 2023 / Vienna Business Agency (WAW)
Publications: 139862 / 139860 / 153863 / 158286 / 152968 / 152969 / 152950 / 152954 / 175654 / 150285 / 150314 / 191199 / 177467 / 191198 / 190648 / 189835 / 190192 / 189792 / 189878 / 192610 / 191151 / 190685 -
Cryptographic Foundations for Future-proof Internet Security
2019 – 2023 / Austrian Science Fund (FWF)
Publications: 139862 / 139860 / 153863 / 158286 / 152968 / 152969 / 152950 / 152954 / 175654 / 154428 / 153177 / 177467 / 190648 / 189835 / 190192 / 189792 / 189878 / 192610 / 193565 / 193570 / 190685 / 190687 -
Foundations and Tools for Client-Side Web Security
2018 – 2024 / European Research Council (ERC)
Publications: 139862 / 139860 / 153863 / 158286 / 152968 / 152969 / 152950 / 152954 / 175654 / 154428 / 150314 / 153177 / 177467 / 191198 / 190648 / 189835 / 190192 / 189792 / 189878 / 190025 / 192610 / 191151 / 190685 -
Bit-level Accurate Reasoning and Interpolation
2016 – 2020 / Microsoft Research Limited
Publications: 56283 / 57273
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–2024) - 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
- 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
- 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
- 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–2024) -
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
- Bounded Model Checking of Speculative Non-Interference / Pescosta, E., Weissenbacher, G., & Zuleger, F. (2021). Bounded Model Checking of Speculative Non-Interference. In 2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD). 2021 IEEE/ACM International Conference On Computer Aided Design (ICCAD), München, Germany. IEEE. https://doi.org/10.1109/iccad51958.2021.9643462
- Can I Take Your Subdomain? Exploring Same-Site Attacks in the Modern Web / Squarcina, M., Tempesta, M., Veronese, L., Calzavara, S., & Maffei, M. (2021). Can I Take Your Subdomain? Exploring Same-Site Attacks in the Modern Web. In 30th USENIX Security Symposium (pp. 2917–2934). 30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021. http://hdl.handle.net/20.500.12708/58469
- On (Coalitional) Exchange-Stable Matching / Chen, J., Chmurovic, A., Jogl, F., & Sorge, M. (2021). On (Coalitional) Exchange-Stable Matching. In Algorithmic Game Theory (pp. 205–220). LNCS / Springer. https://doi.org/10.1007/978-3-030-85947-3_14
- Stable Visual Summaries for Trajectory Collections / Wulms, J., Buchmüller, J., Meulemans, W., Verbeek, K., & Speckmann, B. (2021). Stable Visual Summaries for Trajectory Collections. In 2021 IEEE 14th Pacific Visualization Symposium (PacificVis). 2021 IEEE 14th Pacific Visualization Symposium (PacificVis), Tianjin, China. 2021 IEEE 14th Pacific Visualization Symposium (PacificVis). https://doi.org/10.1109/pacificvis52677.2021.00016
- Synthesizing Best-effort Strategies under Multiple Environment Specifications / Aminof, B., De Giacomo, G., Lomuscio, A., Murano, A., & Rubin, S. (2021). Synthesizing Best-effort Strategies under Multiple Environment Specifications. In Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning. KR 2021 - 18th International Conference on Principles of Knowledge Representation and Reasoning, virtual event, Unknown. https://doi.org/10.24963/kr.2021/5
- Computational Complexity of Strong Admissibility for Abstract Dialectical Frameworks / Keshavarzi Zafarghandi, A., Dvorak, W., Verbrugge, R., & Verheij, B. (2021). Computational Complexity of Strong Admissibility for Abstract Dialectical Frameworks. NMR 2021 - 19th International Workshop on Non-Monotonic Reasoning, Hanoi, Vietnam, Viet Nam. http://hdl.handle.net/20.500.12708/87226
-
Minimizing Cumulative Batch Processing Time for an Industrial Oven Scheduling Problem
/
Lackner, M.-L., Mrkvicka, C., Musliu, N., Walkiewicz, D., & Winter, F. (2021). Minimizing Cumulative Batch Processing Time for an Industrial Oven Scheduling Problem. In 27th International Conference on Principles and Practice of Constraint Programming, {CP} 2021, Montpellier, France (Virtual Conference), October 25-29, 2021} (pp. 37:1-37:18). https://doi.org/10.4230/LIPIcs.CP.2021.37
Project: ARTIS (2017–2024)
Recent Theses
-
Automated Analysis of Probabilistic Loops
/
Moosbrugger, M. (2024). Automated Analysis of Probabilistic Loops [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.123240
Download: PDF (3.18 MB) -
Towards Automating Induction for Software Verification - Guiding Inductive Reasoning in Superposition-based Theorem Proving
/
Georgiou, P. (2024). Towards Automating Induction for Software Verification - Guiding Inductive Reasoning in Superposition-based Theorem Proving [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.123801
Download: PDF (1.4 MB) -
Foundations of Adaptor Signatures for Distributed Ledger Protocols
/
Tairi, E. (2024). Foundations of Adaptor Signatures for Distributed Ledger Protocols [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.123264
Download: PDF (2.67 MB) -
Optimizing Constraint Programming for Real World Scheduling of Test Laboratories
/
Danzinger, P. (2024). Optimizing Constraint Programming for Real World Scheduling of Test Laboratories [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.110696
Download: PDF (788 KB) -
Detecting Depression and Anxiety on Social Media Using Selective Masking
/
Mullatahiri, P. (2024). Detecting Depression and Anxiety on Social Media Using Selective Masking [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.107269
Download: PDF (1.96 MB) -
Geometry-based Railway Track Extraction from OpenStreetMap Data
/
Eder, M. (2024). Geometry-based Railway Track Extraction from OpenStreetMap Data [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.106607
Download: PDF (1.73 MB) -
Detecting Bot Wallets on the Ethereum Blockchain
/
Niedermayer, T. (2024). Detecting Bot Wallets on the Ethereum Blockchain [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.106562
Download: PDF (3.26 MB) -
Formalization of Bitcoin off-chain protocols in F*
/
Zikulnig, A. M. (2024). Formalization of Bitcoin off-chain protocols in F* [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.113647
Download: PDF (1.38 MB) -
Bridging Realms: Analyzing App-to-Web Interactions in IABs
/
Beer, P. (2024). Bridging Realms: Analyzing App-to-Web Interactions in IABs [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.118621
Download: PDF (1.23 MB) -
Synthesis of Provable Recursive Functions
/
Wagner, E. M. (2024). Synthesis of Provable Recursive Functions [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.120500
Download: PDF (1.18 MB) -
Supporting Register Pairs in CompCert
/
Loitzl, A. (2024). Supporting Register Pairs in CompCert [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.120444
Download: PDF (746 KB) -
WebAPISpec: an Extensible, Machine Checked Model of Secure Browser Specifications
/
Lee, A. (2024). WebAPISpec: an Extensible, Machine Checked Model of Secure Browser Specifications [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.119447
Download: PDF (660 KB) -
Algorithms for Schematic Representations
/
Terziadis, S. (2024). Algorithms for Schematic Representations [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.120711
Download: PDF (8.37 MB) -
Comparison of RDF Triplestores in a Kubernetes Environment
/
Bretterbauer, M. (2024). Comparison of RDF Triplestores in a Kubernetes Environment [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.87104
Download: PDF (1.68 MB) -
Foundations of Bitcoin-Compatible Scalability Protocols
/
Aumayr, L. (2024). Foundations of Bitcoin-Compatible Scalability Protocols [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.122127
Download: PDF (5.09 MB) -
Certified circuit reconstruction for QBF
/
Weng, M.-A. (2024). Certified circuit reconstruction for QBF [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.121008
Download: PDF (661 KB) -
Join Operators for Bi-Abductive Analysis of Low-level Code
/
Rysavy, L. (2024). Join Operators for Bi-Abductive Analysis of Low-level Code [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.119373
Download: PDF (1.3 MB) -
Turning FPT Decision Methods into Enumeration Algorithms with FPT-Delay
/
Unterberger, D. (2024). Turning FPT Decision Methods into Enumeration Algorithms with FPT-Delay [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.119942
Download: PDF (847 KB) -
Identifying Frameworks in Android Applications using Binary Code Function Similarity
/
Zeier, Y. (2024). Identifying Frameworks in Android Applications using Binary Code Function Similarity [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.117246
Download: PDF (1.07 MB) -
SAT-based Local Improvement for the Closest String Problem
/
Voboril, F. (2024). SAT-based Local Improvement for the Closest String Problem [Diploma Thesis, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2024.119021
Download: PDF (1.79 MB)
Recent Awards
-
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 -
Stefan Woltran:
EurAI Fellows programme
2018 / EurAI Fellow / Website -
Thomas Eiter:
Best Paper Award of the 14th Extended Semantic Web Conference (ESWC 2017)
2017 / 14th Extended Semantic Web Conference (ESWC 2017), May 28 - June 1, 2017, Portoroz, Slovenia / Germany -
Ewa Vesely:
Vereinbarkeit vom Beruf/Forschung und Pflege von Angehörigen
2016 / HR Inside Summit Award 2016, BRONZE / Austria / Website -
Thomas Eiter:
Member of Academia Europea (London)
2016 / Academia Europea (London) Membership / UK -
Ewa Vesely:
Unterstützungsmaßnahmen für pflegende Angehörige
2016 / Austria / Website