Dvořák, W., König, M., & Woltran, S. (2025). Parameterized complexity of abstract argumentation with collective attacks. Argument & Computation, 16(1). https://doi.org/10.1177/19462174251319186 ( reposiTUm)

Bernreiter, M., Dvořák, W., Rapberger, A., & Woltran, S. (2024). The Effect of Preferences in Abstract Argumentation under a Claim-Centric View. Journal of Artificial Intelligence Research, 81, 203–262. https://doi.org/10.1613/JAIR.1.15932 ( reposiTUm)

Dvorak, W., König, M., Ulbricht, M., & Woltran, S. (2024). Principles and their Computational Consequences for Argumentation Frameworks with Collective Attacks. Journal of Artificial Intelligence Research, 79, 69–136. https://doi.org/10.1613/jair.1.14879 ( reposiTUm)

Caminada Martin, König, M., Rapberger, A., & Ulbricht, M. (2024). Attack semantics and collective attacks revisited. Argument & Computation, Pre-press(Pre-press). https://doi.org/10.3233/AAC-230011 ( reposiTUm)

Dvořák, W., Greßler, A., Rapberger, A., & Woltran, S. (2023). The complexity landscape of claim-augmented argumentation frameworks. Artificial Intelligence, 317, Article 103873. https://doi.org/10.1016/j.artint.2023.103873 ( reposiTUm)

Bernreiter, M., Dvořák, W., & Woltran, S. (2023). Abstract argumentation with conditional preferences. Argument & Computation, 1–29. https://doi.org/10.34726/5479 ( reposiTUm)

Fichte, J. K., Le Berre, D., Hecher, M., & Szeider, S. (2023). The silent (r)evolution of SAT. Communications of the ACM, 66(6), 64–72. https://doi.org/10.1145/3560469 ( reposiTUm)

Fichte, J. K., Hecher, M., Morak, M., Thier, C.-P., & Woltran, S. (2023). Solving Projected Model Counting by Utilizing Treewidth and its Limits. Artificial Intelligence, 314, Article 103810. https://doi.org/10.1016/j.artint.2022.103810 ( reposiTUm)

Linsbichler, T., Maratea, M., Niskanen, A., Wallner, J. P., & Woltran, S. (2022). Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving. Artificial Intelligence, 307, 1–40. https://doi.org/10.1016/j.artint.2022.103697 ( reposiTUm)

Fichte, J. K., Hecher, M., Morak, M., & Woltran, S. (2021). DynASP2.5: Dynamic Programming on Tree Decompositions in Action. Algorithms, 14(3), 81. https://doi.org/10.3390/a14030081 ( reposiTUm)

Bliem, B., Morak, M., Moldovan, M., & Woltran, S. (2020). The Impact of Treewidth on Grounding and Solving of Answer Set Programs. Artificial Intelligence, 67, 35–80. https://doi.org/10.1613/jair.1.11515 ( reposiTUm)

Saribatur Yaman, Z. G., & Woltran, S. (2024). A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 10687–10695). https://doi.org/10.1609/aaai.v38i9.28940 ( reposiTUm)

Dimopoulos, Y., Dvorak, W., König, M., Rapberger, A., Ulbricht, M., & Woltran, S. (2024). Redefining ABA+ semantics via abstract set-to-set attacks. In Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence and Thirty-Sixth Conference on Innovative Applications of Artificial Intelligence and Fourteenth Symposium on Educational Advances in Artificial Intelligence (pp. 10493–10500). AAAI Press. https://doi.org/10.1609/aaai.v38i9.28918 ( reposiTUm)

Buraglio, G., Dvorak, W., König, M., & Ulbricht, M. (2024). Justifying Argument Acceptance with Collective Attacks: Discussions and Disputes. In Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence (pp. 3281–3288). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2024/363 ( reposiTUm)

Blümel, L., König, M., & Ulbricht, M. (2024). Weak Admissibility for ABA via Abstract Set-Attacks. In Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning (pp. 178–188). IJCAI Organization. https://doi.org/10.24963/kr.2024/17 ( reposiTUm)

Dimopoulos, Y., Dvorak, W., & König, M. (2024). Connecting Abstract Argumentation and Boolean Networks. In Computational Models of Argument : Proceedings of COMMA 2024 (pp. 85–96). IOS Press. https://doi.org/10.3233/FAIA240312 ( reposiTUm)

Buraglio, G., Dvorak, W., Rapberger, A., & Woltran, S. (2024). Constrained Derivation in Assumption-Based Argumentation. In Foundations of Information and Knowledge Systems: 13th International Symposium, FoIKS 2024, Sheffield, UK, April 8–11, 2024, Proceedings (pp. 340–359). Springer. https://doi.org/10.1007/978-3-031-56940-1_19 ( reposiTUm)

Dvořák, W., Gressler, A., & Woltran, S. (2024). Equipping Abstract Argumentation Solvers for Verifying Negative Results. In SAC ’24: Proceedings of the 39th ACM/SIGAPP Symposium on Applied Computing (pp. 762–769). https://doi.org/10.1145/3605098.3636073 ( reposiTUm)

Greßler, A., Dvořák, W., & Woltran, S. (2024). The GSAF Solver and Verifier. In Computational Models of Argument: Proceedings of COMMA 2024 (pp. 353–354). IOS Press. https://doi.org/10.3233/FAIA240336 ( reposiTUm)

Bernreiter, M., & König, M. (2023). From Qualitative Choice Logic to Abstract Argumentation. In Proceedings of the Twentieth International Conference on Principles of Knowledge Representation and Reasoning (pp. 737–741). International Joint Conferences on Artificial Intelligence Organization. https://doi.org/10.24963/kr.2023/73 ( reposiTUm)

Dimopoulos, Y., Dvořák, W., König, M., Rapberger, A., Ulbricht, M., & Woltran, S. (2023). Sets Attacking Sets in Abstract Argumentation. In K. Sauterwald & M. Thimm (Eds.), Proceedings of the 21st International Workshop on Non-Monotonic Reasoning, co-located with the 20th International Conference on Principles of Knowledge Representation and Reasoning (KR 2023) and co-located with the 36th International Workshop on Description Logics (DL 2023) (pp. 22–31). CEUR-WS.org. https://doi.org/10.34726/5386 ( reposiTUm)

Corrêa, A., Hecher, M., Helmert, M., Longo, D. M., Pommerening, F., & Woltran, S. (2023). Grounding Planning Tasks Using Tree Decompositions and Iterated Solving. In Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling (pp. 100–108). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/icaps.v33i1.27184 ( reposiTUm)

Besin, V., Hecher, M., & Woltran, S. (2023). On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth. In K. Gal, A. Nowé, G. J. Nalepa, R. Fairstein, & R. Raduelscu (Eds.), ECAI 2023 : 26th European Conference on Artificial Intelligence, September 30–October 4, 2023, Kraków, Poland. Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023). Proceedings (pp. 247–254). IOS Press. https://doi.org/10.3233/FAIA230277 ( reposiTUm)

Besin, V., Hecher, M., & Woltran, S. (2022). Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck. In Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI-22) (pp. 2546–2552). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2022/353 ( reposiTUm)

Dvořák, W., Hecher, M., König, M., Schidler, A., Szeider, S., & Woltran, S. (2022). Tractable Abstract Argumentation via Backdoor-Treewidth. In Proceedings of the 36th AAAI Conference on Artificial Intelligence (pp. 5608–5615). AAAI Press. https://doi.org/10.1609/aaai.v36i5.20501 ( reposiTUm)

Fichte, J. K., Gaggl, S. A., Hecher, M., & Rusovac, D. (2022). IASCAR: Incremental Answer Set Counting by Anytime Refinement. In Logic Programming and Nonmonotonic Reasoning (pp. 217–230). Springer. http://hdl.handle.net/20.500.12708/142530 ( reposiTUm)

Dvořák, W., König, M., & Woltran, S. (2022). Deletion-Backdoors for Argumentation Frameworks with Collective Attacks. In Proceedings of the Fourth International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2022) (pp. 98–110). CEUR-WS. https://doi.org/10.34726/3826 ( reposiTUm)

Fichte, J. K., Hecher, M., & Roland, V. (2022). Proofs for Propositional Model Counting. In 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022) (pp. 1–24). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAT.2022.30 ( reposiTUm)

Dvořák, W., König, M., & Woltran, S. (2022). Treewidth for Argumentation Frameworks with Collective Attacks. In Computational Models of Argument. Proceedings of COMMA 2022 (pp. 140–151). IOS Press. https://doi.org/10.34726/3422 ( reposiTUm)

Bernreiter, M., Lolic, A., Maly, J., & Woltran, S. (2022). Sequent Calculi for Choice Logics. In Automated Reasoning (pp. 331–349). Springer International Publishing. https://doi.org/10.1007/978-3-031-10769-6_20 ( reposiTUm)

Fichte, J. K., Hecher, M., & Nadeem, M. A. (2022). Plausibility Reasoning via Projected Answer Set Counting - A Hybrid Approach. In L. De Raedt (Ed.), Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (IJCAI-22) (pp. 2620–2626). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2022/363 ( reposiTUm)

Dewoprabowo, R., Fichte, J. K., Gorczyca, P. J., & Hecher, M. (2022). A Practical Account into Counting Dung’s Extensions by Dynamic Programming. In Logic Programming and Nonmonotonic Reasoning (pp. 387–400). Springer. https://doi.org/10.1007/978-3-031-15707-3_30 ( reposiTUm)

König, M., Rapberger, A., & Ulbricht, M. (2022). Just a Matter of Perspective. In Computational Models of Argument (pp. 212–223). IOS Press. https://doi.org/10.3233/FAIA220154 ( reposiTUm)

Dvorak, W., König, M., Ulbricht, M., & Woltran, S. (2022). Rediscovering Argumentation Principles Utilizing Collective Attacks. In Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, {KR} (pp. 122–131). International Joint Conferences on Artificial Intelligence Organization. https://doi.org/10.24963/kr.2022/13 ( reposiTUm)

Baumann, R., Rapberger, A., & Ulbricht, M. (2022). Equivalence in Argumentation Frameworks with a Claim-Centric View – Classical Results with Novel Ingredients. In Proceedings of the 36th AAAI Conference on Artificial Intelligence (pp. 5479–5486). AAAI Press. https://doi.org/10.1609/aaai.v36i5.20486 ( reposiTUm)

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, Unknown. https://doi.org/10.24963/kr.2021/67 ( reposiTUm)

Eiter, T., Hecher, M., & Kiesel, R. (2021). Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting. In Proceedings of the 37th International Conference on Logic Programming (ICLP 2021). 37th International Conference on Logic Programming (ICLP 2021), Unknown. http://hdl.handle.net/20.500.12708/58728 ( reposiTUm)

Eiter, T., Hecher, M., & Kiesel, R. (2021). Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting. 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/26 ( reposiTUm)

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 ( reposiTUm)

Fichte, J. K., Hecher, M., & Kieler, M. F. I. (2020). Treewidth-Aware Quantifier Elimination and Expansion for QCSP. In Principles and Practice of Constraint Programming 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings (pp. 248–266). https://doi.org/10.1007/978-3-030-58475-7_15 ( reposiTUm)

Fichte, J. K., Hecher, M., & Szeider, S. (2020). A Time Leap Challenge for SAT-Solving. In Principles and Practice of Constraint Programming 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings (pp. 267–285). https://doi.org/10.1007/978-3-030-58475-7_16 ( reposiTUm)

Fichte, J. K., Hecher, M., & Szeider, S. (2020). Breaking Symmetries with RootClique and LexTopSort. In Principles and Practice of Constraint Programming 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7–11, 2020, Proceedings (pp. 286–303). https://doi.org/10.1007/978-3-030-58475-7_17 ( reposiTUm)

Hecher, M. (2020). Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? 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, online, Greece. https://doi.org/10.24963/kr.2020/49 ( reposiTUm)

Hecher, M., Morak, M., & Woltran, S. (2020). Structural Decompositions of Epistemic Logic Programs. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2830–2837). https://doi.org/10.1609/aaai.v34i03.5672 ( reposiTUm)

FICHTE, J. K., HECHER, M., THIER, P., & WOLTRAN, S. (2020). Exploiting Database Management Systems and Treewidth for Counting. In Theory and Practice of Logic Programming (pp. 128–157). https://doi.org/10.1017/s147106842100003x ( reposiTUm)

Woltran, S. (2020). Computational Argumentation - Formal Models and Complexity Results. In Proceedings of the 35th Italian Conference on Computational Logic - {CILC} 2020, Rende, Italy, October 13-15, 2020 (pp. 1–2). http://hdl.handle.net/20.500.12708/55556 ( reposiTUm)

Fichte, J. K., Hecher, M., & Schidler, A. (2020). Solving the Steiner Tree Problem with few Terminals. In 2020 IEEE 32nd International Conference on Tools with Artificial Intelligence (ICTAI). ICTAI 2020 - 32th International Conference on Tools with Artificial Intelligence, online conference, Unknown. https://doi.org/10.1109/ictai50040.2020.00054 ( reposiTUm)

Bernreiter, M., & Freiman, R. (2022). Truth and Preferences - A Game Approach for Qualitative Choice Logic [Conference Presentation]. M-PREF 2022 - 13th Multidisciplinary Workshop on Advances in Preference Handling, Wien, Austria. https://doi.org/10.48550/arXiv.2209.12777 ( reposiTUm)

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, Viet Nam. http://hdl.handle.net/20.500.12708/87225 ( reposiTUm)

Everardo, F., Hecher, M., & Shukla, A. (2020). Extending XORRO with Approximate Model Counting. Workshop ASPOCP 2020, University of Calabria, Rende, Italy. http://hdl.handle.net/20.500.12708/87108 ( reposiTUm)

Hecher, M. (2020). Treewidth-Aware Reductions of normal ASP to SAT - Is normal ASP harder than SAT after all? 4th Workshop on Trends and Applications of Answer Set Programming (TAASP 2020), Klagenfurt, Austria. http://hdl.handle.net/20.500.12708/87107 ( reposiTUm)

Hecher, M., Thier, P., & Woltran, S. (2020). Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. DPSW 2020 - Declarative Problem Solving Workshop, Santiago de Compostela, online, Spain. http://hdl.handle.net/20.500.12708/87109 ( reposiTUm)