TU Wien Informatics

Overview Professors Scientific Staff Administrative Staff Student Staff External Lecturers By Responsibilities By Committee By Name
Related
Guest Professors Honoraries Alumni (LinkedIn) #5qw

Wolfgang Dvorak

Senior Lecturer Dipl.-Ing. Dipl.-Ing. Dr.techn.

Research Focus

  • Logic and Computation: 100%

Research Areas

  • Computational complexity, Argumentation, Logic Programming, Nonmonotonic Reasoning, Theoretical Compurter Science, Parameterized Complexity, Algorithms and Data Structures, Complexity in Artificial Intelligence and logic programming
Wolfgang Dvorak

About

My research interests lie in theoretical computer science. Find below a list of topics I'm interested in.

  • (Analysis of) Algorithms
  • Approximation Algorithms
  • Complexity Theory and Complexity Analysis
  • Conditional Lower Bounds
  • Parameterized Complexity
  • Knowledge Representation and Reasoning
  • (Abstract) Argumentation
  • Graphs and Graph Parameters
  • Answer Set Programming

Role

Contact

2022W

2023S

 

Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once the migration is complete, everything will be up to date again.

2022

2021

  • Joint Attacks and Accrual in Argumentation Frameworks / Bikakis, A., Cohen, A., Dvorak, W., Flouris, G., & Parsons, S. (2021). Joint Attacks and Accrual in Argumentation Frameworks. Journal of Applied Logics - IfCoLog Journal (FLAP) - College Publications, 8(6), 1437–1502. http://hdl.handle.net/20.500.12708/138043
  • Algorithms and conditional lower bounds for planning problems / Chatterjee, K., Dvořák, W., Henzinger, M., & Svozil, A. (2021). Algorithms and conditional lower bounds for planning problems. Artificial Intelligence, 297(103499), 103499. https://doi.org/10.1016/j.artint.2021.103499
  • ASPARTIX-V - A Solver for Argumentation Tasks Using ASP / Dvorak, W., König, M., Rapberger, A., Wallner, J. P., & Woltran, S. (2021). ASPARTIX-V - A Solver for Argumentation Tasks Using ASP. ASPOCP 2021 - 14th Workshop on Answer Set Programming and Other Computing Paradigms, Porto, EU. http://hdl.handle.net/20.500.12708/87227
  • 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, International. http://hdl.handle.net/20.500.12708/87226
  • A Reduct-Driven Study of Argumentation Frameworks With Collective Attacks / Dvorak, W., König, M., Ulbricht, M., & Woltran, S. (2021). A Reduct-Driven Study of Argumentation Frameworks With Collective Attacks. NMR 2021 - 19th International Workshop on Non-Monotonic Reasoning, Hanoi, Vietnam, International. http://hdl.handle.net/20.500.12708/87225 / Projects: HYPAR, START
  • Graph-Classes of Argumentation Frameworks with Collective Attacks / Dvořák, W., König, M., & Woltran, S. (2021). Graph-Classes of Argumentation Frameworks with Collective Attacks. In Logics in Artificial Intelligence (pp. 3–17). https://doi.org/10.1007/978-3-030-75775-5_1 / Projects: HYPAR, START
  • On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length / Dvořák, W., König, M., & Woltran, S. (2021). On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length. 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, International. https://doi.org/10.24963/kr.2021/67 / Projects: HYPAR, START
  • Symbolic Time and Space Tradeoffs for Probabilistic Verification / Chatterjee, K., Dvorak, W., Henzinger, M., & Svozil, A. (2021). Symbolic Time and Space Tradeoffs for Probabilistic Verification. In 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). LICS 2021 - Symposium on Logic in Computer Science, Rom, EU. https://doi.org/10.1109/lics52264.2021.9470739
  • Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility / Dvořák, W., Ulbricht, M., & Woltran, S. (2021). Recursion in Abstract Argumentation is Hard  ---  On the Complexity of Semantics Based on Weak Admissibility. In Journal of Artificial Intelligence Research (pp. 1403–1447). https://doi.org/10.1613/jair.1.13603 / Project: START
  • The Complexity Landscape of Claim-Augmented Argumentation Frameworks / Dvorak, W., Greßler, A., Rapberger, A., & Woltran, S. (2021). The Complexity Landscape of Claim-Augmented Argumentation Frameworks. In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021 (pp. 6296–6303). http://hdl.handle.net/20.500.12708/58525

2020

  • ASPARTIX-V19 - An Answer-set Programming based System for Abstract Argumentation / Dvorak, W., Rapberger, A., Wallner, J., & Woltran, S. (2020). ASPARTIX-V19 - An Answer-set Programming based System for Abstract Argumentation. In Foundations of Information and Knowledge Systems. FoIKS 2020 (pp. 79–89). Springer. https://doi.org/10.34726/1821 / Project: GRAPPA
  • On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs / Dvořák, W., Rapberger, A., & Woltran, S. (2020). On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs. Journal of Logic and Computation, 30(5), 1063–1107. https://doi.org/10.1093/logcom/exaa033
  • Complexity of abstract argumentation under a claim-centric view / Dvořák, W., & Woltran, S. (2020). Complexity of abstract argumentation under a claim-centric view. Artificial Intelligence, 285(103290), 103290. https://doi.org/10.1016/j.artint.2020.103290 / Projects: GRAPPA, START
  • Weak Admissibility is PSPACE-complete / Dvorak, W., Ulbricht, M., & Woltran, S. (2020). Weak Admissibility is PSPACE-complete. In 18th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING (pp. 100–109). http://hdl.handle.net/20.500.12708/58277
  • Argumentation Semantics under a Claim-centric View: Properties, Expressiveness and Relation to SETAFs / Dvořák, W., Rapberger, A., & Woltran, S. (2020). Argumentation Semantics under a Claim-centric View: Properties, Expressiveness and Relation to SETAFs. In Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning. KR 2020 - 17th International Conference on Principles of Knowledge Representation and Reasoning, Rhodos, Griechenland, EU. https://doi.org/10.24963/kr.2020/35
  • Strong Equivalence for Argumentation Frameworks with Collective Attacks / Dvořák, W., Rapberger, A., & Woltran, S. (2020). Strong Equivalence for Argumentation Frameworks with Collective Attacks. In KI 2019: Advances in Artificial Intelligence (pp. 131–145). https://doi.org/10.1007/978-3-030-30179-8_11
  • Ranking-Based Semantics from the Perspective of Claims / Bistarelli, S., Dvorak, W., Taticchi, C., & Woltran, S. (2020). Ranking-Based Semantics from the Perspective of Claims. In Computational Models of Argument - Proceedings of {COMMA} 2020, Perugia, Italy, September 4-11, 2020 (pp. 111–122). http://hdl.handle.net/20.500.12708/58261
  • Labelling-based Algorithms for SETAFs / Dvorak, W., Rapberger, A., & Wallner, J. P. (2020). Labelling-based Algorithms for SETAFs. In S. A. Gaggl, M. Thimm, & M. Vallati (Eds.), Proceedings SAFA 2020 (pp. 34–46). CEUR-WS.org. http://hdl.handle.net/20.500.12708/58209
  • Computing Strongly Admissible Sets / Dvorak, W., & Wallner, J. P. (2020). Computing Strongly Admissible Sets. In H. Prakken, S. Bistarelli, F. Santini, & C. Taticchi (Eds.), Proceedings COMMA (pp. 179–190). IOs Press. http://hdl.handle.net/20.500.12708/58171
  • Expressiveness of SETAFs and Support-Free ADFs Under 3-Valued Semantics / Dvorak, W., Keshavarzi Zafarghandi, A., & Woltran, S. (2020). Expressiveness of SETAFs and Support-Free ADFs Under 3-Valued Semantics. In Computational Models of Argument - Proceedings of {COMMA} 2020, Perugia, Italy, September 4-11, 2020 (pp. 191–202). http://hdl.handle.net/20.500.12708/55557 / Project: GRAPPA
  • The ASPARTIX system suite / Dvorak, W., Gaggl, S. A., Rapberger, A., Wallner, J. P., & Woltran, S. (2020). The ASPARTIX system suite. In H. Prakken, S. Bistarelli, F. Santini, & C. Taticchi (Eds.), Proceedings COMMA (pp. 461–462). IOS Press. http://hdl.handle.net/20.500.12708/55544

2019

2018

  • Lower bounds for symbolic computation on graphs / Dvorak, W. (2018). Lower bounds for symbolic computation on graphs. Helmuth Veith Memorial Workshop, Salzburg, Austria. http://hdl.handle.net/20.500.12708/86782
  • Expressive Power of Collective Attacks / Dvorak, W., Chatterjee, K., Henzinger, M., & Loitzenbauer, V. (2018). Expressive Power of Collective Attacks. Highlights of Algorithms 2018, HALG 2018, Amsterdam, EU. http://hdl.handle.net/20.500.12708/86748
  • Quasipolynomial Set-Based Symbolic Algorithms for Parity Games / Svozil, A., Dvorak, W., Chatterjee, K., & Henzinger, M. (2018). Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. In LPAR 2018 : International Conference on Logic for Programming, Artificial Intelligence and Reasoning (pp. 233–253). EasyChair Publications, in the EPiC Series in Computing. http://hdl.handle.net/20.500.12708/57576
  • Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter / Dvorak, W., Chatterjee, K., Henzinger, M., & Loitzenbauer, V. (2018). Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. In Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2341–2356). https://doi.org/10.1137/1.9781611975031.151
  • Algorithms and Conditional Lower bounds for Planning Problems / Dvorak, W., Chatterjee, K., Henzinger, M., & Svozil, A. (2018). Algorithms and Conditional Lower bounds for Planning Problems. In International Conference on Automated Planning and Scheduling (ICAPS 2018) (pp. 1–14). CoRR. http://hdl.handle.net/20.500.12708/57486
  • On the Expressive Power of Collective Attacks / Dvorak, W., Woltran, S., & Fandinno, J. (2018). On the Expressive Power of Collective Attacks. In 7th International Conference on Computational Models of Argument (pp. 1–27). IOS Press. http://hdl.handle.net/20.500.12708/57485 / Project: GRAPPA
  • Evaluating SETAFs via Answer-Set Programming / Dvorak, W., Woltran, S., & Gressler, A. (2018). Evaluating SETAFs via Answer-Set Programming. In 2nd International Workshop on Systems and Algorithms for Formal Argumentation (pp. 10–21). CEUR-WS.org. http://hdl.handle.net/20.500.12708/57479 / Projects: GRAPPA, START
  • Application of ASP in formal argumentation / Dvorak, W., Pührer, J., Wallner, J. P., Woltran, S., & Diller, M. (2018). Application of ASP in formal argumentation. In 2nd Workshop on Trends and Applications of Answer Set Programming (TAASP 2018) (pp. 1–11). http://hdl.handle.net/20.500.12708/57477 / Projects: GRAPPA, START
  • Computational Problems in Formal Argumentation and their Complexity / Dvorak, W., & Dunne, P. E. (2018). Computational Problems in Formal Argumentation and their Complexity. In Handbook of Formal Argumentation (pp. 631–687). College Publications. http://hdl.handle.net/20.500.12708/29850

2017

  • Comparing the expressiveness of argumentation semantics / Dvořák, W., & Spanring, C. (2017). Comparing the expressiveness of argumentation semantics. Journal of Logic and Computation, exw008. https://doi.org/10.1093/logcom/exw008 / Project: GRAPPA
  • A General Notion of Equivalence for Abstract Argumentation / Dvorak, W. (2017). A General Notion of Equivalence for Abstract Argumentation. In A General Notion of Equivalence for Abstract Argumentation (p. 1). http://hdl.handle.net/20.500.12708/55700
  • Improved Set-based Symbolic Algorithms for Parity Games / Dvorak, W., Chatterjee, K., Henzinger, M., & Loitzenbauer, V. (2017). Improved Set-based Symbolic Algorithms for Parity Games. In Computer Science Logic - CSL 2017 (pp. 1–21). https://doi.org/10.4230/LIPIcs.CSL.2017.18
  • A General Notion of Equivalence for Abstract Argumentation / Dvorak, W., Linsbichler, T., Woltran, S., & Baumann, R. (2017). A General Notion of Equivalence for Abstract Argumentation. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia, Non-EU. https://doi.org/10.24963/ijcai.2017/111 / Project: GRAPPA

2016

2012

2011

2010

2009

  • Argumentation with Bounded Tree-Width / Dvorak, W. (2009). Argumentation with Bounded Tree-Width. Advanced Course in Artificial Intelligence ’09, Belfast, GB, EU. http://hdl.handle.net/20.500.12708/84891 / Project: Argu
  • Alternation as a programming paradigm / Dvořák, W., Gottlob, G., Pichler, R., & Woltran, S. (2009). Alternation as a programming paradigm. In A. Porto & F. J. Lopez-Fraguas (Eds.), Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming - PPDP ’09. ACM Press. https://doi.org/10.1145/1599410.1599419 / Project: TTPC
  • Technical Note: Complexity of Stage Semantics in Argumentation Frameworks / Dvorak, W., & Woltran, S. (2009). Technical Note: Complexity of Stage Semantics in Argumentation Frameworks (DBAI-TR-2009-66). http://hdl.handle.net/20.500.12708/35719 / Project: Argu
  • Alternation as a Programming Paradigm / Dvorak, W., Gottlob, G., Pichler, R., & Woltran, S. (2009). Alternation as a Programming Paradigm (DBAI-TR-2009-64). http://hdl.handle.net/20.500.12708/35631

 

Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once the migration is complete, everything will be up to date again.