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)

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)

Fazekas, K., Niemetz, A., Preiner, M., Kirchweger, M., Szeider, S., & Biere, A. (2024). Satisfiability Modulo User Propagators. Journal of Artificial Intelligence Research, 81, 989–1017. https://doi.org/10.1613/jair.1.16163 ( 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)

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)

Dreier, J., Ordyniak, S., & Szeider, S. (2023). CSP beyond tractable constraint languages. Constraints, 28(3), 450–471. https://doi.org/10.1007/s10601-023-09362-3 ( reposiTUm)

Schidler, A., & Szeider, S. (2023). SAT-boosted tabu search for coloring massive graphs. ACM Journal on Experimental Algorithmics, 28, Article 1.5. https://doi.org/10.1145/3603112 ( reposiTUm)

Dvořák, W., Rapberger, A., & Woltran, S. (2023). A claim-centric perspective on abstract argumentation semantics: Claim-defeat, principles, and expressiveness. Artificial Intelligence, 324, Article 104011. https://doi.org/10.1016/j.artint.2023.104011 ( 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)

Schidler, A., & Szeider, S. (2023). Computing optimal hypertree decompositions with SAT. Artificial Intelligence, 325, Article 104015. https://doi.org/10.1016/j.artint.2023.104015 ( reposiTUm)

Peitl, T., & Szeider, S. (2023). Are hitting formulas hard for resolution? Discrete Applied Mathematics, 337, 173–184. https://doi.org/10.1016/j.dam.2023.05.003 ( 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)

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

Ganian, R., Schidler, A., Sorge, M., & Szeider, S. (2022). Threshold Treewidth and Hypertree Width. Journal of Artificial Intelligence Research, 74, 1687–1713. https://doi.org/10.1613/JAIR.1.13661 ( reposiTUm)

Ganian, R., Kim, E. J., & Szeider, S. (2022). Algorithmic applications of tree-cut width. SIAM Journal on Discrete Mathematics, 36(4), 2635–2666. https://doi.org/10.1137/20M137478X ( reposiTUm)

Dvořák, W., Ulbricht, M., & Woltran, S. (2022). Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility. Journal of Artificial Intelligence Research, 74, 1403–1447. https://doi.org/10.1613/jair.1.13603 ( 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)

Xia, H., & Szeider, S. (2024). SAT-Based Tree Decomposition with Iterative Cascading Policy Selection. In M. Wooldridge, J. Dy, & S. Natarajan (Eds.), Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI-24) (pp. 8191–8199). AAAI Press. https://doi.org/10.1609/aaai.v38i8.28659 ( reposiTUm)

Buraglio, G., Dvorak, W., König, M., & Woltran, S. (2024). Splitting Argumentation Frameworks with Collective Attacks. In Proceedings of the Fifth International Workshop on Systems and Algorithms for Formal Argumentation co-located with 10th International Conference on Computational Models of Argument (COMMA 2024) (pp. 41–55). CEUR-WS.org. ( 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)

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)

Beiser, A., Hecher, M., Unalan, K., & Woltran, S. (2024). Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting. In Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence (pp. 3250–3258). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2024/360 ( 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)

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)

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)

Schidler, A., & Szeider, S. (2023). Computing Twin-width with SAT and Branch & Bound. In Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence (IJCAI-23) (pp. 2013–2021). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2023/224 ( reposiTUm)

Bernreiter, M., Dvořák, W., Rapberger, A., & Woltran, S. (2023). The Effect of Preferences in Abstract Argumentation under a Claim-Centric View. In Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI-23) (pp. 6253–6261). AAAI Press. https://doi.org/10.1609/AAAI.V37I5.25770 ( reposiTUm)

Kirchweger, M., Peitl, T., & Szeider, S. (2023). A SAT Solver’s Opinion on the Erdos-Faber-Lovász Conjecture. In M. Mahajan (Ed.), 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023) (pp. 1–17). Schloss-Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAT.2023.13 ( reposiTUm)

Zhang, T., & Szeider, S. (2023). Searching for Smallest Universal Graphs and Tournaments with SAT. In R. Yap (Ed.), 29th International Conference on Principles and Practice of Constraint Programming. https://doi.org/10.4230/LIPIcs.CP.2023.39 ( reposiTUm)

Ramaswamy, V. P., & Szeider, S. (2023). Proven Optimally-Balanced Latin Rectangles with SAT. In R. Yap (Ed.), 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Schloss-Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CP.2023.48 ( 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)

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)

Markus Kirchweger, Scheucher, M., & Szeider, S. (2023). SAT-Based Generation of Planar Graphs. In 26th International Conference on Theory and Applications of Satisfiability Testing (SAT 2023). 26th International Conference on Theory and Applications of Satisfiability Testing (SAT), Alghero, Italy. Schloss-Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAT.2023.14 ( 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)

Fazekas, K., Niemetz, A., Preiner, M., Kirchweger, M., Szeider, S., & Biere, A. (2023). IPASIR-UP: User Propagators for CDCL. In M. Mahajan & F. Slivovsky (Eds.), 26th International Conference on Theory and Applications of Satisfiability Testing (pp. 8:1-8:13). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAT.2023.8 ( reposiTUm)

Buraglio, G., Dvořák, W., Rapberger, A., & Woltran, S. (2023). Constrained Derivation in Assumption-Based Argumentation. In G. Alfano & S. Ferilli (Eds.), Proceedings of the 7th Workshop on Advances in Argumentation in Artificial Intelligence (AI^3 2023). CEUR-WS.org. https://doi.org/10.34726/5385 ( reposiTUm)

Peruvemba Ramaswamy, V., & Szeider, S. (2022). Learning Fast-Inference Bayesian Networks. In Advances in Neural Information Processing Systems 34 (NeurIPS 2021). 35th conference on neural information processing systems (NeurIPS 2021), Unknown. https://doi.org/10.34726/4023 ( reposiTUm)

Rapberger, A., & Ulbricht, M. (2022). On Dynamics in Structured Argumentation Formalisms. In Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning (pp. 288–298). IJCAI Organization. http://hdl.handle.net/20.500.12708/142535 ( 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)

Bernreiter, M., Dvořák, W., & Woltran, S. (2022). Abstract Argumentation with Conditional Preferences. In Computational Models of Argument. Proceedings of COMMA 2022 (pp. 92–103). IOS Press. https://doi.org/10.3233/FAIA220144 ( 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)

Chew, L., & Slivovsky, F. (2022). Towards Uniform Certification in QBF. In P. Berenbrink & B. Monmege (Eds.), 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) (pp. 1–23). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2022.22 ( 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)

Dreier, J., Ordyniak, S., & Szeider, S. (2022). SAT Backdoors: Depth Beats Size. In 30th Annual European Symposium on Algorithms (ESA 2022) (pp. 1–18). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.46 ( reposiTUm)

Dobler, A., Sorge, M., & Villedieu, A. (2022). Turbocharging Heuristics for Weak Coloring Numbers. In S. Chechik, G. Navarro, E. Rotenberg, & G. Herman (Eds.), 30th Annual European Symposium on Algorithms (ESA 2022) (pp. 1–18). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.44 ( reposiTUm)

Ganian, R., Pokrývka, F., Schidler, A., Simonov, K., & Szeider, S. (2022). Weighted Model Counting with Twin-Width. In K. S. Meel & O. Strichman (Eds.), 25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022) (pp. 1–17). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAT.2022.15 ( reposiTUm)

Rapberger, A., Ulbricht, M., & Wallner, J. (2022). Argumentation Frameworks Induced by Assumption-Based Argumentation: Relating Size and Complexity. In Proceedings of the 20th International Workshop on Non-Monotonic Reasoning (NMR 2022) (pp. 92–103). CEUR-WS. https://doi.org/10.34726/3549 ( reposiTUm)

Schidler, A. (2022). SAT-Based Local Search for Plane Subgraph Partitions. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry (SoCG 2022) (pp. 1–8). Schloss Dagstuhl --Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2022.74 ( 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)