Wissenschaftliche Artikel

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., Lolic, A., Maly, J., & Woltran, S. (2024). Sequent Calculi for Choice Logics. Journal of Automated Reasoning, 68(2), Article 8. https://doi.org/10.1007/s10817-024-09695-5 ( 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)

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)

Dvořák, W., Keshavarzi Zafarghandi, A., & Woltran, S. (2023). Expressiveness of SETAFs and support-free ADFs under 3-valued semantics. Journal of Applied Non-Classical Logics, 33(3–4), 298–327. https://doi.org/10.1080/11663081.2023.2244361 ( 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., 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)

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)

Bernreiter, M., Maly, J., & Woltran, S. (2022). Choice logics and their computational properties. Artificial Intelligence, 311, 1–24. https://doi.org/10.1016/j.artint.2022.103755 ( reposiTUm)

Fandinno, J., Pearce, D., Vidal, C., & Woltran, S. (2022). Comparing the Reasoning Capabilities of Equilibrium Theories and Answer Set Programs. Algorithms, 15(6), Article 201. https://doi.org/10.3390/a15060201 ( 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)

Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2021). Beyond Uniform Equivalence between Answer-set Programs. ACM Transactions on Computational Logic, 22(1), 1–46. https://doi.org/10.1145/3422361 ( reposiTUm)

BALDUCCINI, M., LIERLER, Y., & WOLTRAN, S. (2021). Preface. Theory and Practice of Logic Programming, 21(3), 293–295. https://doi.org/10.1017/s1471068420000484 ( 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)

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

Bichler, M., Morak, M., & Woltran, S. (2020). lpopt: A Rule Optimization Tool for Answer Set Programming. Fundamenta Informaticae, 177(3–4). https://doi.org/10.3233/fi-2020-1990 ( reposiTUm)

Abseher, M., Bliem, B., Charwat, G., Dusberger, F., & Woltran, S. (2020). Computing Secure Sets in Graphs using Answer Set Programming. Journal of Logic and Computation, 30(4), 837–862. https://doi.org/10.1093/logcom/exv060 ( reposiTUm)

Gaggl, S. A., Linsbichler, T., Maratea, M., & Woltran, S. (2020). Design and results of the Second International Competition on Computational Models of Argumentation. Artificial Intelligence, 279(103193), 103193. https://doi.org/10.1016/j.artint.2019.103193 ( reposiTUm)

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

BREWKA, G., DILLER, M., HEISSENBERGER, G., LINSBICHLER, T., & WOLTRAN, S. (2020). Solving Advanced Argumentation Problems with Answer Set Programming. Theory and Practice of Logic Programming, 20(3), 391–431. https://doi.org/10.1017/s1471068419000474 ( reposiTUm)

BICHLER, M., MORAK, M., & WOLTRAN, S. (2020). selp: A Single-Shot Epistemic Logic Program Solver. Theory and Practice of Logic Programming, 20(4), 435–455. https://doi.org/10.1017/s1471068420000022 ( reposiTUm)

Gonçalves, R., Knorr, M., Leite, J., & Woltran, S. (2020). On the limits of forgetting in Answer Set Programming. Artificial Intelligence, 286(103307), 103307. https://doi.org/10.1016/j.artint.2020.103307 ( reposiTUm)

Diller, M., Keshavarzi Zafarghandi, A., Linsbichler, T., & Woltran, S. (2020). Investigating subclasses of abstract dialectical frameworks. Argument & Computation, 11(1–2), 191–219. https://doi.org/10.3233/aac-190481 ( 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)

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

Moser, B., Dorffner, G., Eiter, T., Faber, W., Klambauer, G., Legenstein, R., Nessler, B., Polleres, A., & Woltran, S. (2020). Österreichische AI Strategie aus Sicht der Wissenschaft. OCG Journal, 01–02, 14–17. http://hdl.handle.net/20.500.12708/141528 ( reposiTUm)

Fichte, J. K., Kronegger, M., & Woltran, S. (2019). A Multiparametric View on Answer Set Programming. Annals of Mathematics and Artificial Intelligence, 86(1–3), 121–147. https://doi.org/10.1007/s10472-019-09633-x ( reposiTUm)

Baumann, R., Dvorak, W., Linsbichler, T., & Woltran, S. (2019). A general notion of equivalence for abstract argumentation. Artificial Intelligence, 275, 379–410. https://doi.org/10.1016/j.artint.2019.06.006 ( reposiTUm)

Dvorak, W., Woltran, S., & Fandinno, J. (2019). On the expressive power of collective attacks. Argument & Computation, 10(2), 191–230. https://doi.org/10.3233/aac-190457 ( reposiTUm)

Charwat, G., & Woltran, S. (2019). Expansion-based QBF Solving on Tree Decompositions. Fundamenta Informaticae, 167(1–2), 59–92. https://doi.org/10.3233/fi-2019-1810 ( reposiTUm)

FABER, W., MORAK, M., & WOLTRAN, S. (2019). On Uniform Equivalence of Epistemic Logic Programs. Theory and Practice of Logic Programming, 19(5–6), 826–840. https://doi.org/10.1017/s1471068419000218 ( reposiTUm)

Maly, J., Truszczyński, M., & Woltran, S. (2019). Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? Journal of Artificial Intelligence Research, 66, 1147–1197. https://doi.org/10.1613/jair.1.11879 ( reposiTUm)

Ferrarotti, F., & Woltran, S. (2019). Preface. Annals of Mathematics and Artificial Intelligence, 87(1–2), 1–4. https://doi.org/10.1007/s10472-019-09667-1 ( reposiTUm)

Brochenin, R., Linsbichler, T., Maratea, M., Wallner, J. P., & Woltran, S. (2018). Abstract Solvers for Dung’s Argumentation Frameworks. Argument & Computation, 9(1), 41–72. https://doi.org/10.3233/aac-170031 ( reposiTUm)

Woltran, S., & Schaub, T. (2018). Answer set programming unleashed! Kuenstliche Intelligenz, 32(2–3), 105–108. https://doi.org/10.1007/s13218-018-0550-z ( reposiTUm)

Leite, J., Tran, C. S., Torroni, P., & Woltran, S. (2018). Special Issue on Computational Logic in Multi-Agent Systems (CLIMA XIV). Journal of Logic and Computation, 28(3), 475–476. https://doi.org/10.1093/logcom/exv005 ( reposiTUm)

Gaggl, S. A., Linsbichler, T., Maratea, M., & Woltran, S. (2018). Summary Report of the Second International Competition on Computational Models of Argumentation. AI Magazine, 39(4), 77–79. https://doi.org/10.1609/aimag.v39i4.2781 ( reposiTUm)

Abseher, M., Hecher, M., Moldovan, M., Woltran, S., & Bliem, B. (2018). Dynamic Programming on Tree Decompositions with {D-FLAT}. Kuenstliche Intelligenz, 32(2–3), 191–192. https://doi.org/10.1007/s13218-018-0531-2 ( reposiTUm)

Delgrande, J. P., Peppas, P., & Woltran, S. (2018). General Belief Revision. Journal of the ACM, 65(5), 1–34. https://doi.org/10.1145/3203409 ( reposiTUm)

Diller, M., Haret, A., Linsbichler, T., Rümmele, S., & Woltran, S. (2018). An extension-based approach to belief revision in abstract argumentation. International Journal of Approximate Reasoning, 93, 395–423. https://doi.org/10.1016/j.ijar.2017.11.013 ( reposiTUm)

Bliem, B., & Woltran, S. (2018). Complexity of Secure Sets. Algorithmica, 80(10), 2909–2940. https://doi.org/10.1007/s00453-017-0358-5 ( reposiTUm)

Bliem, B., & Woltran, S. (2018). Equivalence between answer-set programs under (partially) fixed input. Annals of Mathematics and Artificial Intelligence, 83(3–4), 277–295. https://doi.org/10.1007/s10472-017-9567-5 ( reposiTUm)

Bliem, B., & Woltran, S. (2018). Defensive alliances in graphs of bounded treewidth. Discrete Applied Mathematics, 251, 334–339. https://doi.org/10.1016/j.dam.2018.04.001 ( reposiTUm)

Creignou, N., Pichler, R., & Woltran, S. (2018). Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? Logical Methods in Computer Science, 14(4), 1–25. https://doi.org/10.23638/LMCS-14(4:10)2018 ( reposiTUm)

Schaub, T., & Woltran, S. (2018). Special Issue on Answer Set Programming. Kuenstliche Intelligenz, 32(2–3), 101–103. https://doi.org/10.1007/s13218-018-0554-8 ( reposiTUm)

Maly, J., & Woltran, S. (2017). Ranking Specific Sets of Objects. Datenbank-Spektrum: Zeitschrift Für Datenbanktechnologien Und Information Retrieval, 17(3), 255–265. https://doi.org/10.1007/s13222-017-0264-7 ( reposiTUm)

Bliem, B., Pichler, R., & Woltran, S. (2017). Implementing Courcelle’s Theorem in a declarative framework for dynamic programming. Journal of Logic and Computation, exv089. https://doi.org/10.1093/logcom/exv089 ( reposiTUm)

Abseher, M., Musliu, N., & Woltran, S. (2017). Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. Journal of Artificial Intelligence Research, 58, 829–858. https://doi.org/10.1613/jair.5312 ( reposiTUm)

GONÇALVES, R., KNORR, M., LEITE, J., & WOLTRAN, S. (2017). When you must forget: Beyond strong persistence when forgetting in answer set programming. Theory and Practice of Logic Programming, 17(5–6), 837–854. https://doi.org/10.1017/s1471068417000382 ( reposiTUm)

Haret, A., Rümmele, S., & Woltran, S. (2017). Merging in the Horn Fragment. ACM Transactions on Computational Logic, 18(1), 1–32. https://doi.org/10.1145/3043700 ( reposiTUm)

Brewka, G., Ellmauthaler, S., Strass, H., Wallner, J. P., & Woltran, S. (2017). Abstract Dialectical Frameworks. An Overview. Journal of Applied Logics, 4(8), 2263–2317. https://resolver.obvsg.at/urn:nbn:at:at-ubtuw:3-4548 ( reposiTUm)

Creignou, N., Papini, O., Rümmele, S., & Woltran, S. (2016). Belief Merging within Fragments of Propositional Logic. ACM Transactions on Computational Logic, 17(3), 1–28. https://doi.org/10.1145/2898436 ( reposiTUm)

Bliem, B., Charwat, G., Hecher, M., & Woltran, S. (2016). D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy. Fundamenta Informaticae, 147(1), 27–61. http://hdl.handle.net/20.500.12708/149519 ( reposiTUm)

Abseher, M., Gebser, M., Musliu, N., Schaub, T., & Woltran, S. (2016). Shift Design with Answer Set Programming. Fundamenta Informaticae, 147(1), 1–25. http://hdl.handle.net/20.500.12708/149520 ( reposiTUm)

BICHLER, M., MORAK, M., & WOLTRAN, S. (2016). The Power of Non-Ground Rules in Answer Set Programming. Theory and Practice of Logic Programming, 16(5–6), 552–569. https://doi.org/10.1017/s1471068416000338 ( reposiTUm)

Baumann, R., & Woltran, S. (2016). The role of self-attacking arguments in characterizations of equivalence notions. Journal of Logic and Computation, 26(4), 1293–1313. https://doi.org/10.1093/logcom/exu010 ( reposiTUm)

Baumann, R., Dvořák, W., Linsbichler, T., Spanring, C., Strass, H., & Woltran, S. (2016). On rejected arguments and implicit conflicts: The hidden power of argumentation semantics. Artificial Intelligence, 241, 244–284. https://doi.org/10.1016/j.artint.2016.09.004 ( reposiTUm)

Diller, M., Wallner, J. P., & Woltran, S. (2015). Reasoning in Abstract Dialectical Frameworks using Quantified Boolean Formulas. Argument and Computation, 6(2), 149–177. https://doi.org/10.1080/19462166.2015.1036922 ( reposiTUm)

Leite, J., Tran, C. S., Torroni, P., & Woltran, S. (2015). Applications of logical approaches to argumentation. Argument and Computation, 6(1), 1–2. https://doi.org/10.1080/19462166.2014.1003407 ( reposiTUm)

Pfandler, A., Pichler, R., & Woltran, S. (2015). The complexity of handling minimal solutions in logic-based abduction. Journal of Logic and Computation, 25(3), 805–825. https://doi.org/10.1093/logcom/exu053 ( reposiTUm)

FICHTE, J. K., TRUSZCZYŃSKI, M., & WOLTRAN, S. (2015). Dual-normal logic programs - the forgotten class. Theory and Practice of Logic Programming, 15(4–5), 495–510. https://doi.org/10.1017/s1471068415000186 ( reposiTUm)

GAGGL, S. A., MANTHEY, N., RONCA, A., WALLNER, J. P., & WOLTRAN, S. (2015). Improved answer-set programming encodings for abstract argumentation. Theory and Practice of Logic Programming, 15(4–5), 434–448. https://doi.org/10.1017/s1471068415000149 ( reposiTUm)

Dunne, P. E., Dvořák, W., Linsbichler, T., & Woltran, S. (2015). Characteristics of multiple viewpoints in abstract argumentation. Artificial Intelligence, 228, 153–178. https://doi.org/10.1016/j.artint.2015.07.006 ( reposiTUm)

Charwat, G., Dvořák, W., Gaggl, S. A., Wallner, J. P., & Woltran, S. (2015). Methods for solving reasoning problems in abstract argumentation - A survey. Artificial Intelligence, 220, 28–63. https://doi.org/10.1016/j.artint.2014.11.008 ( reposiTUm)

ALVIANO, M., FABER, W., & WOLTRAN, S. (2014). Complexity of super-coherence problems in ASP. Theory and Practice of Logic Programming, 14(3), 339–361. https://doi.org/10.1017/s147106841300001x ( reposiTUm)

Creignou, N., Papini, O., Pichler, R., & Woltran, S. (2014). Belief revision within fragments of propositional logic. Journal of Computer and System Sciences, 80(2), 427–449. https://doi.org/10.1016/j.jcss.2013.08.002 ( reposiTUm)

Brewka, G., Polberg, S., & Woltran, S. (2014). Generalizations of Dung Frameworks and Their Role in Formal Argumentation. IEEE Intelligent Systems, 29(1), 30–38. https://doi.org/10.1109/mis.2013.122 ( reposiTUm)

Dvořák, W., Järvisalo, M., Wallner, J. P., & Woltran, S. (2014). Complexity-Sensitive Decision Procedures for Abstract Argumentation. Artificial Intelligence, 206, 53–78. https://doi.org/10.1016/j.artint.2013.10.001 ( reposiTUm)

Pichler, R., Polleres, A., Skritek, S., & Woltran, S. (2013). Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries. Semantic Web: Interoperability, Usability, Applicability, 4(4), 351–393. http://hdl.handle.net/20.500.12708/155572 ( reposiTUm)

Faber, W., Truszczyński, M., & Woltran, S. (2013). Strong Equivalence of Qualitative Optimization Problems. Journal of Artificial Intelligence Research, 47, 351–391. https://doi.org/10.1613/jair.3991 ( reposiTUm)

Eiter, T., Fink, M., Pührer, J., Tompits, H., & Woltran, S. (2013). Model-Based Recasting in Answer-Set Programming. Journal of Applied Non-Classical Logics, 23(1–2), 75–104. https://doi.org/10.1080/11663081.2013.799318 ( reposiTUm)

Delgrande, J., Schaub, T., Tompits, H., & Woltran, S. (2013). A Model-Theoretic Approach to Belief Change in Answer Set Programming. ACM Transactions on Computational Logic, 14(2), 1–46. https://doi.org/10.1145/2480759.2480766 ( reposiTUm)

Gaggl, S. A., & Woltran, S. (2013). The cf2 argumentation semantics revisited. Journal of Logic and Computation, 23(5), 925–949. https://doi.org/10.1093/logcom/exs011 ( reposiTUm)

Dunne, P. E., Dvořák, W., & Woltran, S. (2013). Parametric Properties of Ideal Semantics. Artificial Intelligence, 202, 1–28. https://doi.org/10.1016/j.artint.2013.06.004 ( reposiTUm)

Dvořák, W., Pichler, R., & Woltran, S. (2012). Towards fixed-parameter tractable algorithms for abstract argumentation. Artificial Intelligence, 186, 1–37. https://doi.org/10.1016/j.artint.2012.03.005 ( reposiTUm)

BLIEM, B., MORAK, M., & WOLTRAN, S. (2012). D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming. Theory and Practice of Logic Programming, 12(4–5), 445–464. https://doi.org/10.1017/s1471068412000129 ( reposiTUm)

PICHLER, R., RÜMMELE, S., SZEIDER, S., & WOLTRAN, S. (2012). Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough. Theory and Practice of Logic Programming, 14(2), 141–164. https://doi.org/10.1017/s1471068412000099 ( reposiTUm)

Creignou, N., Schmidt, J., Thomas, M., & Woltran, S. (2011). Complexity of logic-based argumentation in Post’s framework. Argument and Computation, 2(2–3), 107–129. https://doi.org/10.1080/19462166.2011.629736 ( reposiTUm)

Oikarinen, E., & Woltran, S. (2011). Characterizing strong equivalence for argumentation frameworks. Artificial Intelligence, 175(14–15), 1985–2009. https://doi.org/10.1016/j.artint.2011.06.003 ( reposiTUm)

Dvořák, W., & Woltran, S. (2011). On the Intertranslatability of Argumentation Semantics. Journal of Artificial Intelligence Research, 41, 445–475. https://doi.org/10.1613/jair.3318 ( reposiTUm)

Balduccini, M., & Woltran, S. (2011). Special issue on answer set programming. AI Communications, 24(2), 105–106. http://hdl.handle.net/20.500.12708/162167 ( reposiTUm)

Egly, U., Gaggl, S., & Woltran, S. (2010). Answer-Set Programming Encodings for Argumentation Frameworks. Argument and Computation, 1(2), 147–177. http://hdl.handle.net/20.500.12708/167366 ( reposiTUm)

Dvořák, W., & Woltran, S. (2010). Complexity of semi-stable and stage semantics in argumentation frameworks. Information Processing Letters, 110(11), 425–430. https://doi.org/10.1016/j.ipl.2010.04.005 ( reposiTUm)

TRUSZCZYŃSKI, M., & WOLTRAN, S. (2009). Relativized hyperequivalence of logic programs for modular programming. Theory and Practice of Logic Programming, 9(6), 781–819. https://doi.org/10.1017/s1471068409990159 ( reposiTUm)

Besnard, P., Hunter, A., & Woltran, S. (2009). Encoding deductive argumentation in quantified Boolean formulae. Artificial Intelligence, 173(15), 1406–1423. https://doi.org/10.1016/j.artint.2009.06.006 ( reposiTUm)

Truszczyński, M., & Woltran, S. (2009). Hyperequivalence of logic programs with respect to supported models. Annals of Mathematics and Artificial Intelligence, 53(1–4), 331–365. https://doi.org/10.1007/s10472-009-9119-8 ( reposiTUm)

PEARCE, D., TOMPITS, H., & WOLTRAN, S. (2009). Characterising Equilibrium Logic and Nested Logic Programs: Reductions and Complexity. Theory and Practice of Logic Programming, 9(05), 565–616. https://doi.org/10.1017/s147106840999010x ( reposiTUm)

Janhunen, T., Oikarinen, E., Tompits, H., & Woltran, S. (2009). Modularity Aspects of Disjunctive Stable Models. Journal of Artificial Intelligence Research, 35, 813–857. https://doi.org/10.1613/jair.2810 ( reposiTUm)

Egly, U., Seidl, M., & Woltran, S. (2009). A Solver for QBFs in Negation Normal Form. Constraints, 14(1), 38–79. http://hdl.handle.net/20.500.12708/165275 ( reposiTUm)

WOLTRAN, S. (2008). A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming. Theory and Practice of Logic Programming, 8(2), 217–234. https://doi.org/10.1017/s1471068407003250 ( reposiTUm)

Eiter, T., Faber, W., Fink, M., & Woltran, S. (2007). Complexity results for answer set programming with bounded predicate arities and implications. Annals of Mathematics and Artificial Intelligence, 51(2–4), 123–165. https://doi.org/10.1007/s10472-008-9086-5 ( reposiTUm)

Eiter, T., Fink, M., & Woltran, S. (2007). Semantical Characterizations and Complexity of Equivalences in Answer Set Programming. ACM Transactions on Computational Logic, 8(3), 1–53. http://hdl.handle.net/20.500.12708/169634 ( reposiTUm)

Egly, U., Pichler, R., & Woltran, S. (2005). On Deciding Subsumption Problems. Annals of Mathematics and Artificial Intelligence, 43(1–4), 255–294. http://hdl.handle.net/20.500.12708/173345 ( reposiTUm)

Beiträge in Tagungsbänden

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)

Bernreiter, M., Maly, J., Nardi, O., & Woltran, S. (2024). Combining Voting and Abstract Argumentation to Understand Online Discussions. In AAMAS ’24: Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems (pp. 170–179). ( 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)

Eiter, T., Fichte, J. K., Hecher, M., & Woltran, S. (2024). Epistemic Logic Programs: Non-Ground and Counting Complexity. In Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, {IJCAI} 2024, Jeju, South Korea, August 3-9,2024 (pp. 3333–3341). https://doi.org/10.24963/ijcai.2024/369 ( 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., 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)

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)

Saribatur, Z. G., & Woltran, S. (2023). Foundations for Projecting Away the Irrelevant in ASP Programs. In P. Marquis, T. C. Son, & G. Kern-Isberner (Eds.), Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning (pp. 614–624). IJCAI Organization. https://doi.org/10.24963/kr.2023/60 ( 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)

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)

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)

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)

Prem, E., Neidhardt, J., Knees, P., Woltran, S., & Werthner, H. (2023). Digital Humanism and Norms in Recommender Systems. In S. Vrijenhoek, L. Michiels, J. Kruse, A. Starke, J. Viader Guerrero, & N. Tintarev (Eds.), Proceedings of the First Workshop on the Normative Design and Evaluation of Recommender Systems. CEUR-WS.org. https://doi.org/10.34726/8560 ( 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)

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)

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)

Bernreiter, M., Dvorak, W., Rapberger, A., & Woltran, S. (2022). The Effect of Preferences in Abstract Argumentation Under a Claim-Centric View. In Proceedings of the 20th International Workshop on Non-Monotonic Reasoning (pp. 27–38). ( 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)

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)

Dvořák, W., Rienstra, T., van der Torre, L., & Woltran, S. (2022). Non-Admissibility in Abstract Argumentation. In F. Toni, S. Polberg, M. Caminada, R. Booth, & H. Kido (Eds.), Computational Models of Argument - Proceedings of COMMA 2022 (pp. 128–139). IOS Press. https://doi.org/10.3233/FAIA220147 ( reposiTUm)

Bernreiter, M., Maly, J., & Woltran, S. (2021). Choice Logics and Their Computational Properties. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada, Canada. https://doi.org/10.24963/ijcai.2021/247 ( reposiTUm)

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

Dvořák, W., Ulbricht, M., & Woltran, S. (2021). Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility. In 35th AAAI Conference on Artificial Intelligence (pp. 6288–6295). http://hdl.handle.net/20.500.12708/58530 ( 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)

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)

Dvořák, 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 ( reposiTUm)

Saribatur, Z. G., Wallner, J. P., & Woltran, S. (2020). Explaining Non-Acceptability in Abstract Argumentation. In G. De Giacomo (Ed.), Proceedings ECAI (pp. 881–888). IOS Press. http://hdl.handle.net/20.500.12708/58147 ( 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)

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

Hecher, M., Morak, M., & Woltran, S. (2020). Structural Decompositions of Epistemic Logic Programs. In International Conference on Logic Programming 2020 Workshop Proceedings. ICLP 2020, Rende, Italy. CEUR-WS.org. http://hdl.handle.net/20.500.12708/58264 ( reposiTUm)

Dvořák, W., Rapberger, A., & Woltran, S. (2020). Strong Equivalence for Argumentation Frameworks with Collective Attacks. In ECAI 2020 - 24th European Conference on Artificial Intelligence (pp. 721–728). IOS Press. https://doi.org/10.3233/FAIA200159 ( 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)

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

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, Greece. https://doi.org/10.24963/kr.2020/35 ( reposiTUm)

Gonçalves, R., Janhunen, T., Knorr, M., Leite, J., & Woltran, S. (2020). Forgetting in Modular Answer Set Programming. In Proceedings of the 18th INTERNATIONAL WORKSHOP ON NON-MONOTONIC REASONING (pp. 189–197). http://hdl.handle.net/20.500.12708/58278 ( reposiTUm)

Hecher, M., Thier, P., & Woltran, S. (2020). Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. In Theory and Applications of Satisfiability Testing – SAT 2020 (pp. 343–360). https://doi.org/10.1007/978-3-030-51825-7_25 ( reposiTUm)

Bernreiter, M., Maly, J., & Woltran, S. (2020). Encoding Choice Logics in ASP. In International Conference on Logic Programming 2020 Workshop Proceedings co-located with 36th International Conference on Logic Programming (ICLP 2020), Rende, Italy, September 18-19, 2020 (pp. 1–14). http://hdl.handle.net/20.500.12708/58290 ( reposiTUm)

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

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

Faber, W., Morak, M., & Woltran, S. (2019). Strong Equivalence for Epistemic Logic Programs Made Easy. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2809–2816). AAAI Press. https://doi.org/10.1609/aaai.v33i01.33012809 ( reposiTUm)

Haret, A., & Woltran, S. (2019). Belief Revision Operators with Varying Attitudes Towards Initial Beliefs. In S. Kraus (Ed.), Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, {IJCAI} 2019 (pp. 1726–1733). ijcai.org. https://doi.org/10.24963/ijcai.2019/239 ( reposiTUm)

Dvořák, W., & Woltran, S. (2019). Complexity of Abstract Argumentation under a Claim-Centric View. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2801–2808). AAAI Press. https://doi.org/10.1609/aaai.v33i01.33012801 ( reposiTUm)

Gonçalves, R., Janhunen, T., Knorr, M., Leite, J., & Woltran, S. (2019). Forgetting in Modular Answer Set Programming. In Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2843–2850). AAAI Press. https://doi.org/10.1609/aaai.v33i01.33012843 ( reposiTUm)

Gangl, C., Lackner, M., Maly, J., & Woltran, S. (2019). Aggregating Expert Opinions in Support of Medical Diagnostic Decision-Making. In Knowledge Representation for Health Care/ProHealth, KR4HC 2019 (pp. 56–62). http://hdl.handle.net/20.500.12708/57907 ( reposiTUm)

Dvořák, W., Järvisalo, M., Linsbichler, T., Niskanen, A., & Woltran, S. (2019). Preprocessing Argumentation Frameworks via Replacement Patterns. In Logics in Artificial Intelligence (pp. 116–132). Springer. https://doi.org/10.1007/978-3-030-19570-0_8 ( reposiTUm)

Brewka, G., Pührer, J., & Woltran, S. (2019). Multi-valued GRAPPA. In Logics in Artificial Intelligence 16th European Conference, JELIA 2019, Rende, Italy, May 7–11, 2019, Proceedings. JELIA 2019 - 16th Edition of the European Conference on Logics in Artificial Intelligence, Rende, Kalbrien, Italy. Springer. https://doi.org/10.1007/978-3-030-19570-0_6 ( reposiTUm)

Eiter, T., & Kaminski, T. D. (2019). Pruning External Minimality Checking for ASP Using Semantic Dependencies. In M. Balduccini, Y. Lierler, & S. Woltran (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 326–339). Springer. https://doi.org/10.34726/721 ( reposiTUm)

Taupe, R., Weinzierl, A., & Friedrich, G. (2019). Degrees of Laziness in Grounding. In M. Balduccini, Y. Lierler, & S. Woltran (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 298–311). https://doi.org/10.1007/978-3-030-20528-7_22 ( reposiTUm)

Fichte, J., & Hecher, M. (2019). Treewidth and Counting Projected Answer Sets. In M. Balduccini, Y. Lierler, & S. Woltran (Eds.), Logic Programming and Nonmonotonic Reasoning: 15th International Conference, LPNMR 2019 (pp. 105–119). Springer. https://doi.org/10.1007/978-3-030-20528-7_9 ( reposiTUm)

Hecher, M., Morak, M., & Woltran, S. (2019). Structural Decompositions of Epistemic Logic Programs. In TAASP 2019 (pp. 1–15). http://hdl.handle.net/20.500.12708/58008 ( reposiTUm)

Dvorak, W., Rapberger, A., & Woltran, S. (2019). Strong Equivalence for Argumentation Frameworks with Collective Attacks. In KI 2019: Advances in Artificial Intelligence 42nd German Conference on AI, Kassel, Germany, September 23–26, 2019, Proceedings. KI 2019 - 42nd German Conference on AI, Kassel, Germany. https://doi.org/10.1007/978-3-030-30179-8_11 ( reposiTUm)

Linsbichler, T., Maratea, M., Niskanen, A., Wallner, J., & Woltran, S. (2018). Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving. In J. Lang (Ed.), Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence : Stockholm, 13-19 July 2018. ijcai.org. https://doi.org/10.24963/ijcai.2018/263 ( reposiTUm)

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

Haret, A., Creignou, N., Papini, O., & Woltran, S. (2018). Belief Update in the Horn Fragment. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI - International Joint Conference on Artificial Intelligence, Stockholm, Sweden. ijcai.org. https://doi.org/10.24963/ijcai.2018/246 ( reposiTUm)

Woltran, S., Goncalves, R., Janhunen, T., Knorr, M., & Leite, J. (2018). Variable Elimination for DLP-Functions. In AAAI Publications, Sixteenth International Conference on Principles of Knowledge Representation and Reasoning (pp. 643–644). AAAI. http://hdl.handle.net/20.500.12708/57297 ( reposiTUm)

Fichte, J. K., Hecher, M., Morak, M., & Woltran, S. (2018). Exploiting Treewidth for Projected Model Counting and Its Limits. In Theory and Applications of Satisfiability Testing – SAT 2018 (pp. 165–184). Springer. https://doi.org/10.1007/978-3-319-94144-8_11 ( reposiTUm)

Keshavarzi Zafarghandi, A., Linsbichler, T., Woltran, S., & Diller, M. (2018). Investigating Subclasses of Abstract Dialectical Frameworks. In Computational Models of Argument - Proceedings of {COMMA} 2018 (pp. 61–72). IOS Press. http://hdl.handle.net/20.500.12708/57561 ( reposiTUm)

Haret, A., & Woltran, S. (2018). Belief Revision Operators with Varying Attitudes Towards Initial Beliefs. In 17th International Workshop On Non-Monotonic Reasoning (pp. 156–165). http://hdl.handle.net/20.500.12708/57504 ( reposiTUm)

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

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

Fichte, J., Hecher, M., Woltran, S., & Zisser, M. (2018). Weighted Model Counting on the GPU by Exploiting Small Treewidth. In Y. Azar, H. Bast, & G. Herman (Eds.), 26th Annual European Symposium on Algorithms, {ESA} 2018 (pp. 28:2-28:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ESA.2018.28 ( reposiTUm)

Maly, J., Woltran, S., & Truszczynski, M. (2018). Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI - International Joint Conference on Artificial Intelligence, Stockholm, Sweden. ijcai.org. https://doi.org/10.24963/ijcai.2018/60 ( reposiTUm)

Bichler, M., Morak, M., & Woltran, S. (2018). Single-Shot Epistemic Logic Program Solving. In Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. IJCAI - International Joint Conference on Artificial Intelligence, Stockholm, Sweden. ijcai.org. https://doi.org/10.24963/ijcai.2018/237 ( reposiTUm)

Maly, J., & Woltran, S. (2018). A New Logic for Jointly Representing Hard and Soft Constraints. In Second Workshop on Logics for Reasoning about Preferences, Uncertainty, and Vagueness (pp. 1–4). http://hdl.handle.net/20.500.12708/57539 ( reposiTUm)

Bliem, B. (2018). ASP Programs with Groundings of Small Treewidth. In F. Ferrarotti & S. Woltran (Eds.), Foundations of Information and Knowledge Systems: 10th International Symposium, FoIKS 2018 (pp. 97–113). LNCS. https://doi.org/10.1007/978-3-319-90050-6_6 ( reposiTUm)

Haret, A., Wallner, J. P., & Woltran, S. (2018). Two sides of the same coin: Belief revision and enforcing arguments. In J. Lang (Ed.), Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence : Stockholm, 13-19 July 2018. International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2018/256 ( reposiTUm)

Brewka, G., Strass, H., Wallner, J. P., & Woltran, S. (2018). Weighted Abstract Dialectical Frameworks. In S. McIlraith & K. Weinberger (Eds.), Proceedings AAAI 2018 (pp. 1779–1786). AAAI Press. http://hdl.handle.net/20.500.12708/57336 ( reposiTUm)

Bichler, M., Morak, M., & Woltran, S. (2018). A Single-Shot Epistemic Logic Program Solver. In 11th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2018) (pp. 1–14). http://hdl.handle.net/20.500.12708/57441 ( reposiTUm)

Fichte, J., Hecher, M., Morak, M., & Woltran, S. (2017). DynASP2.5: Dynamic Programming on Tree Decompositions in Action. In D. Lokshtanov & N. Nishimura (Eds.), 12th International Symposium on Parameterized and Exact Computation (IPEC 2017) (pp. 17:1-17:13). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.IPEC.2017.17 ( reposiTUm)

Moldovan, M., Bliem, B., Morak, M., Woltran, S., & Bliem, B. (2017). The Impact of Treewidth on {ASP} Grounding and Solving. In Proceedings of the 4th International Workshop on Grounding and Transformations for Theories with Variables (GTTV 2017) (pp. 1–13). http://hdl.handle.net/20.500.12708/57064 ( reposiTUm)

Abseher, M., Musliu, N., & Woltran, S. (2017). htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond. In D. Salvagnin & M. Lombardi (Eds.), Integration of AI and OR Techniques in Constraint Programming (pp. 376–386). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-319-59776-8_30 ( reposiTUm)

Maly, J., & Woltran, S. (2017). Ranking Specific Sets of Objects. In Workshop Präferenzen und Personalisierung in der Informatik (pp. 193–201). http://hdl.handle.net/20.500.12708/57051 ( reposiTUm)

Woltran, S. (2017). Towards Preprocessing for Abstract Argumentation Frameworks. In Proceedings of the 4th International Workshop on Defeasible and Ampliative Reasoning (DARe-17) (p. 1). http://hdl.handle.net/20.500.12708/57058 ( reposiTUm)

Hecher, M., Fichte, J., Morak, M., & Woltran, S. (2017). Answer Set Solving with Bounded Treewidth Revisited. In M. Balduccini & T. Janhunen (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 132–145). Springer. https://doi.org/10.1007/978-3-319-61660-5_13 ( reposiTUm)

Fichte, J., Kronegger, M., & Woltran, S. (2017). A Multiparametric View on Answer Set Programming. In Proceedings of the 10th Workshop on Answer Set Programming and Other Computing Paradigms co-located with the 14th International Conference on Logic Programming and Nonmonotonic Reasoning (ASPOCP@LPNMR’17) (pp. 1–14). http://hdl.handle.net/20.500.12708/57098 ( reposiTUm)

Morak, M., Bichler, M., & Woltran, S. (2017). lpopt: A Rule Optimization Tool for Answer Set Programming. In M. Hermenegildo & P. Lopez-Garcia (Eds.), Logic-Based Program Synthesis and Transformation (pp. 114–130). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-63139-4_7 ( reposiTUm)

Charwat, G., & Woltran, S. (2017). Expansion-based (QBF) Solving on Tree Decompositions. In M. Maratea & I. Serina (Eds.), Proceedings of the 24th International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion (RCRA@AI*IA 2017) (pp. 16–26). CEUR-WS.org. http://hdl.handle.net/20.500.12708/57127 ( reposiTUm)

Haret, A., & Woltran, S. (2017). Deviation in Belief Change on Fragments of Propositional Logic. In C. Beierle, G. Kern-Isberner, M. Ragni, & F. Stolzenburg (Eds.), Proceedings of the 6th Workshop on Dynamics of Knowledge and Belief (DKB-2017) and the 5th Workshop KI & Kognition (KIK-2017) (p. 13). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55459 ( reposiTUm)

Diller, M., Linsbichler, T., Woltran, S., Brewka, G., & Heissenberger, G. (2017). Solving Advanced Argumentation Problems with Answer-Set Programming. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (pp. 1077–1083). http://hdl.handle.net/20.500.12708/55706 ( reposiTUm)

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. https://doi.org/10.24963/ijcai.2017/111 ( reposiTUm)

Kröll, M., Pichler, R., & Woltran, S. (2017). On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia. https://doi.org/10.24963/ijcai.2017/159 ( reposiTUm)

Bliem, B., Moldovan, M., Morak, M., & Woltran, S. (2017). The Impact of Treewidth on ASP Grounding and Solving. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia. AAAI Press. https://doi.org/10.24963/ijcai.2017/118 ( reposiTUm)

Haret, A., Pfandler, A., & Woltran, S. (2016). Beyond IC Postulates: Classification Criteria for Merging Operators. In G. A. Kaminka, M. Fox, P. Bouquet, E. Hüllermeier, V. Dignum, F. Dignum, & F. van Harmelen (Eds.), ECAI 2016 - 22nd European Conference on Artificial Intelligence (pp. 372–380). IOS Press. http://hdl.handle.net/20.500.12708/56666 ( reposiTUm)

Bliem, B., Ordyniak, S., & Woltran, S. (2016). Clique-Width and Directed Width Measures for Answer-Set Programming. In G. A. Kaminka, M. Fox, P. Bouquet, E. Hüllermeier, V. Dignum, F. Dignum, & F. van Harmelen (Eds.), ECAI 2016 - 22nd European Conference on Artificial Intelligence (pp. 1105–1113). IOS Press. http://hdl.handle.net/20.500.12708/56679 ( reposiTUm)

Bliem, B., Charwat, G., Hecher, M., & Woltran, S. (2016). Subset Minimization in Dynamic Programming on Tree Decompositions. In A. Darwiche (Ed.), Beyond NP, Papers from the 2016 AAAI Workshop (pp. 300–306). AAAI Press. http://hdl.handle.net/20.500.12708/56613 ( reposiTUm)

Bliem, B., Kaufmann, B., Schaub, T., & Woltran, S. (2016). ASP for Anytime Dynamic Programming on Tree Decompositions. In S. Kambhampati (Ed.), Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016 (pp. 979–986). IJCAI/AAAI Press. http://hdl.handle.net/20.500.12708/56682 ( reposiTUm)

Charwat, G., & Woltran, S. (2016). Dynamic Programming-based QBF Solving. In F. Lonsing & M. Seidl (Eds.), Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) (p. 14). CEUR-WS.org. http://hdl.handle.net/20.500.12708/56683 ( reposiTUm)

Bliem, B., Kaufmann, B., Schaub, T., & Woltran, S. (2016). ASP for Anytime Dynamic Programming on Tree Decompositions (Extended Abstract). In G. Friedrich, M. Helmert, & F. Wotawa (Eds.), KI 2016: Advances in Artificial Intelligence (pp. 257–263). LNCS/Springer. http://hdl.handle.net/20.500.12708/56694 ( reposiTUm)

Bliem, B., & Woltran, S. (2016). Complexity of Secure Sets. In E. W. Mayr (Ed.), Graph-Theoretic Concepts in Computer Science (pp. 64–77). LNCS/Springer. https://doi.org/10.1007/978-3-662-53174-7_5 ( reposiTUm)

Bliem, B., Hecher, M., & Woltran, S. (2016). On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions. In P. Baroni, T. F. Gordon, T. Scheffler, & M. Stede (Eds.), Computational Models of Argument (pp. 107–118). IOS Press. http://hdl.handle.net/20.500.12708/56690 ( reposiTUm)

Abseher, M., Moldovan, M., & Woltran, S. (2016). Providing Built-In Counters in a Declarative Dynamic Programming Environment. In G. Friedrich, M. Helmert, & F. Wotawa (Eds.), KI 2016: Advances in Artificial Intelligence (pp. 3–16). LNCS/Springer. https://doi.org/10.1007/978-3-319-46073-4_1 ( reposiTUm)

Woltran, S. (2016). Towards advanced systems for abstract argumentation. In M. Thimm, F. Cerutti, H. Strass, & M. Vallati (Eds.), Proceedings of the First International Workshop on Systems and Algorithms for Formal Argumentation (p. 3). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56745 ( reposiTUm)

Baumann, R., Linsbichler, T., & Woltran, S. (2016). Verifiability of argumentation semantics. In G. Kern-Isberner & R. Wassermann (Eds.), Proceedings of the 16th International Workshop on Non-monotonic reasoning (p. 10). http://hdl.handle.net/20.500.12708/56747 ( reposiTUm)

Baumann, R., Linsbichler, T., & Woltran, S. (2016). Verifiability of argumentation semantics. In P. Baroni, T. F. Gordon, T. Scheffler, & M. Stede (Eds.), Computational Models of Argument - Proceedings of COMMA 2016 (pp. 83–94). IOS Press. http://hdl.handle.net/20.500.12708/56777 ( reposiTUm)

Bichler, M., Morak, M., & Woltran, S. (2016). lpopt: A Rule Optimization Tool for Answer Set Programming. In M. Hermenegildo & P. Lopez-Garcia (Eds.), Pre-proceedings of the 26th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2016) (p. 14). http://hdl.handle.net/20.500.12708/56841 ( reposiTUm)

Dunne, P. E., Linsbichler, T., Spanring, C., & Woltran, S. (2016). Investigating the relationship between argumentation semantics via signatures. In G. Friedrich, M. Helmert, & F. Wotawa (Eds.), Advances in Artificial Intelligence - 39th Annual German Conference on AI, Proceedings (pp. 271–277). Springer. http://hdl.handle.net/20.500.12708/56782 ( reposiTUm)

Heissenberger, G., & Woltran, S. (2016). Grappavis - A system for advanced graph-based argumentation. In P. Baroni, T. F. Gordon, T. Scheffler, & M. Stede (Eds.), Computational Models of Argument - Proceedings of COMMA 2016 (pp. 473–474). IOS Press. http://hdl.handle.net/20.500.12708/56781 ( reposiTUm)

Gaggl, S. A., Linsbichler, T., Maratea, M., & Woltran, S. (2016). Introducing the Second International Competition on Computational Models of Argumentation. In M. Thimm, F. Cerutti, H. Strass, & M. Vallati (Eds.), Proceedings of the First International Workshop on Systems and Algorithms for Formal Argumentation (p. 6). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56778 ( reposiTUm)

Linsbichler, T., & Woltran, S. (2016). Revision of abstract dialectical frameworks: Preliminary report. In S. A. Gaggl, J. C. Nieves, & H. Strass (Eds.), Proceedings of the First international Workshop on Argumentation in Logic Programming and Non-Monotonic Reasoning (p. 8). http://hdl.handle.net/20.500.12708/56770 ( reposiTUm)

Dunne, P. E., Linsbichler, T., Spanring, C., & Woltran, S. (2016). Investigating the relationship between argumentation semantics via signature. In S. Kambhampati (Ed.), Proceedings of the 25th International Joint Conference on Artificial Intelligence (pp. 1051–1057). IJCAI/AAAI Press. http://hdl.handle.net/20.500.12708/56771 ( reposiTUm)

Haret, A., Mailly, J.-G., & Woltran, S. (2016). Distributing Knowledge Into Simple Bases. In S. Kambhampati (Ed.), Proceedings of the 25th International Joint Conference on Artificial Intelligence (pp. 1109–1115). IJCAI/AAAI Press. http://hdl.handle.net/20.500.12708/56772 ( reposiTUm)

Delobelle, J., Haret, A., Konieczny, S., Mailly, J.-G., Rossit, J., & Woltran, S. (2016). Merging of Abstract Argumentation Frameworks. In C. Baral, J. P. Delgrande, & F. Wolter (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the 15th International Conference (pp. 33–42). AAAI Press. http://hdl.handle.net/20.500.12708/56766 ( reposiTUm)

Haret, A., Mailly, J.-G., & Woltran, S. (2016). Distributing Knowledge Into Simple Bases. In G. Kern-Isberner & R. Wassermann (Eds.), Proceedings of the 16th International Workshop on Non-monotonic reasoning (p. 9). http://hdl.handle.net/20.500.12708/56764 ( reposiTUm)

Giacomin, M., Linsbichler, T., & Woltran, S. (2016). On the functional completeness of argumentation semantics. In C. Baral, J. P. Delgrande, & F. Wolter (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the 15th International Conference (pp. 43–52). AAAI Press. http://hdl.handle.net/20.500.12708/56765 ( reposiTUm)

Brewka, G., Mailly, J.-G., & Woltran, S. (2016). Translation-Based Revision and Merging for Minimal Horn Reasoning. In G. A. Kaminka, M. Fox, P. Bouquet, E. Hüllermeier, V. Dignum, F. Dignum, & F. van Harmelen (Eds.), Proceedings of the 22nd European Conference on Artificial Intelligence (pp. 734–742). IOS Press. http://hdl.handle.net/20.500.12708/56775 ( reposiTUm)

Fichte, J., Hecher, M., Morak, M., & Woltran, S. (2016). Counting Answer Sets via Dynamic Programming. In T. Eiter, W. Faber, & S. Woltran (Eds.), Proceedings of the Workshop on Trends and Applications of Answer Set Programming (TAASP 2016) (p. 14). http://hdl.handle.net/20.500.12708/56808 ( reposiTUm)

Bliem, B., Ordyniak, S., & Woltran, S. (2016). Clique-Width and Directed Width Measures for Answer-Set Programming. In T. Eiter, W. Faber, & S. Woltran (Eds.), Proceedings of the Workshop on Trends and Applications of Answer Set Programming (TAASP 2016) (p. 17). http://hdl.handle.net/20.500.12708/56809 ( reposiTUm)

Bliem, B., & Woltran, S. (2016). Equivalence Between Answer-Set Programs Under (Partially) Fixed Input. In M. Gyssens & G. R. Simari (Eds.), Foundations of Information and Knowledge Systems : 9th International Symposium, FoIKS 2016, Linz, Austria, March 7-11, 2016. Proceedings (pp. 95–111). Lecture Notes in Computer Science (LNCS) / Springer. https://doi.org/10.1007/978-3-319-30024-5_6 ( reposiTUm)

Giacomin, M., Linsbichler, T., & Woltran, S. (2015). On the Functional Completeness of Argumentation Semantics. In C. Beierle, G. Kern-Isberner, M. Ragni, & F. Stolzenburg (Eds.), Proceedings of the 5th Workshop on Dynamics of Knowledge and Belief (DKB-2015) and the 4th Workshop KI & Kognition (KIK-2015) (p. 12). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56276 ( reposiTUm)

Dvorak, W., Järvisalo, M., Wallner, J. P., & Woltran, S. (2015). Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract). In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015 (pp. 4173–4177). http://hdl.handle.net/20.500.12708/56291 ( reposiTUm)

Diller, M., Haret, A., Linsbichler, T., Rümmele, S., & Woltran, S. (2015). An extension-based approach to belief revision in abstract argumentation. In Q. Yang & M. Wooldridge (Eds.), Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence - IJCAI 2015 (pp. 2926–2932). AAAI Press. http://hdl.handle.net/20.500.12708/56273 ( reposiTUm)

Haret, A., Rümmele, S., & Woltran, S. (2015). Merging in the Horn Fragment. In Q. Yang & M. Wooldridge (Eds.), Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence - IJCAI 2015 (pp. 3041–3047). AAAI Press. http://hdl.handle.net/20.500.12708/56274 ( reposiTUm)

Linsbichler, T., Spanring, C., & Woltran, S. (2015). The Hidden Power of Abstract Argumentation Semantics. In E. Black, S. Modgil, & N. Oren (Eds.), Theory and Applications of Formal Argumentation (pp. 146–162). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-28460-6_9 ( reposiTUm)

Brochenin, R., Linsbichler, T., Maratea, M., Wallner, J. P., & Woltran, S. (2015). Abstract Solvers for Dung’s Argumentation Frameworks. In E. Black, S. Modgil, & N. Oren (Eds.), Theory and Applications of Formal Argumentation (pp. 40–58). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-319-28460-6_3 ( reposiTUm)

Dusberger, F., Abseher, M., Musliu, N., & Woltran, S. (2015). Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. In Q. Yang & M. Wooldridge (Eds.), Proceedings of IJCAI 2015, the 24th International Joint Conference on Artificial Intelligence (pp. 275–282). AAAI Press. http://hdl.handle.net/20.500.12708/56206 ( reposiTUm)

Pfandler, A., Rümmele, S., Wallner, J. P., & Woltran, S. (2015). On the Parameterized Complexity of Belief Revision. In Q. Yang & M. Wooldridge (Eds.), Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence - IJCAI 2015 (pp. 3149–3155). AAAI Press. http://hdl.handle.net/20.500.12708/56180 ( reposiTUm)

Bliem, B., Charwat, G., Hecher, M., & Woltran, S. (2015). D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy. In D. Inclezan & M. Maratea (Eds.), 8th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2015 (p. 15). http://hdl.handle.net/20.500.12708/56186 ( reposiTUm)

Charwat, G., & Woltran, S. (2015). Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams. In F. Calimeri, G. Ianni, & M. Truszczynski (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 213–227). Springer. https://doi.org/10.1007/978-3-319-23264-5_19 ( reposiTUm)

Abseher, M., Gebser, M., Musliu, N., Schaub, T., & Woltran, S. (2015). Shift Design with Answer Set Programming. In F. Calimeri, G. Ianni, & M. Truszczynski (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 32–39). Springer. https://doi.org/10.1007/978-3-319-23264-5_4 ( reposiTUm)

Abseher, M., Gebser, M., Musliu, N., Schaub, T., & Woltran, S. (2015). Shift Design with Answer Set Programming. In D. Inclezan & M. Maratea (Eds.), 8th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2015 (p. 13). http://hdl.handle.net/20.500.12708/56218 ( reposiTUm)

Brewka, G., & Woltran, S. (2014). GRAPPA: A Semantical Framework for Graph-Based Argument Processing. In Proceedings of 21st European Conference on Artificial Intelligence (pp. 153–158). http://hdl.handle.net/20.500.12708/55701 ( reposiTUm)

Creignou, N., Papini, O., Rümmele, S., & Woltran, S. (2014). Belief merging within fragments of propositional logic. In Proceedings of the 15th International Workshop on Non-Monotonic Reasoning (p. 10). http://hdl.handle.net/20.500.12708/55732 ( reposiTUm)

Creignou, N., Papini, O., Rümmele, S., & Woltran, S. (2014). Belief merging within fragments of propositional logic. In Proceedings of the 21st European Conference on Artificial Intelligence (pp. 231–236). http://hdl.handle.net/20.500.12708/55731 ( reposiTUm)

Baumann, R., Dvorak, W., Linsbichler, T., Strass, H., & Woltran, S. (2014). Compact Argumentation Frameworks. In Proceedings of the 21st European Conference on Artificial Intelligence (pp. 69–74). http://hdl.handle.net/20.500.12708/55733 ( reposiTUm)

Diller, M., Wallner, J. P., & Woltran, S. (2014). Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas. In Computational Models of Argument (pp. 241–252). IOS Press. http://hdl.handle.net/20.500.12708/55157 ( reposiTUm)

Doder, D., & Woltran, S. (2014). Probabilistic Argumentation Frameworks – A Logical Approach. In U. Straccia & A. Cali (Eds.), Scalable Uncertainty Management 8th International Conference, SUM 2014, Oxford, UK, September 15-17, 2014, Proceedings (pp. 134–147). Springer. https://doi.org/10.1007/978-3-319-11508-5_12 ( reposiTUm)

Baumann, R., Dvorak, W., Linsbichler, T., Strass, H., & Woltran, S. (2014). Compact Argumentation Frameworks. In S. Konieczny & H. Tompits (Eds.), 15th International Workshop on Non-monotonic Reasoning (NMR 2014) (p. 10). http://hdl.handle.net/20.500.12708/55236 ( reposiTUm)

Dvorak, W., Linsbichler, T., Oikarinen, E., & Woltran, S. (2014). Resolution-Based Grounded Semantics Revisited. In S. Parsons, N. Oren, C. Reed, & F. Cerutti (Eds.), Computational Models of Argument (pp. 269–280). IOS Press. http://hdl.handle.net/20.500.12708/55238 ( reposiTUm)

Woltran, S. (2014). Abstract Argumentation - All Problems Solved? In T. Schaub (Ed.), Proceedings ECAI 2014. IOS Press. http://hdl.handle.net/20.500.12708/55232 ( reposiTUm)

Woltran, S. (2014). An Introduction to Abstract Argumentation. In A. Chapman, B. Ludaescher, & A. Schreiber (Eds.), Proceedings 6th USENIX Workshop on the Theory and Practice of Provenance. http://hdl.handle.net/20.500.12708/55233 ( reposiTUm)

Dunne, P. E., Dvorak, W., Linsbichler, T., & Woltran, S. (2014). Characteristics of Multiple Viewpoints in Abstract Argumentation. In C. Baral, G. De Giacomo, & T. Eiter (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference (pp. 72–81). AAAI Press. http://hdl.handle.net/20.500.12708/55234 ( reposiTUm)

Abseher, M., Bliem, B., Charwat, G., Dusberger, F., Hecher, M., & Woltran, S. (2014). The D-FLAT System for Dynamic Programming on Tree Decompositions. In E. Fermé & J. Leite (Eds.), Logics in Artificial Intelligence (pp. 558–572). Springer. https://doi.org/10.1007/978-3-319-11558-0_39 ( reposiTUm)

Abseher, M., Bliem, B., Charwat, G., Dusberger, F., & Woltran, S. (2014). Computing Secure Sets in Graphs using Answer Set Programming. In 7th Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2014. ASPOCP 2014 - 7th Workshop on Answer Set Programming and Other Computing Paradigms, Wien, Austria. http://hdl.handle.net/20.500.12708/55222 ( reposiTUm)

Creignou, N., Pichler, R., & Woltran, S. (2013). Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? In F. Rossi (Ed.), Proceedings of the 23rd International Joint Conference on Artificial Intelligence (pp. 954–961). AAAI Press. http://hdl.handle.net/20.500.12708/54860 ( reposiTUm)

Ambroz, T., Charwat, G., Jusits, A., Wallner, J. P., & Woltran, S. (2013). ARVis: Visualizing Relations between Answer Sets. In P. Cabalar & T. C. Son (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 73–78). Springer. https://doi.org/10.1007/978-3-642-40564-8_8 ( reposiTUm)

Polberg, S., Wallner, J. P., & Woltran, S. (2013). Admissibility in the Abstract Dialectical Framework. In J. Leite, T. C. Son, P. Torroni, L. van der Torre, & S. Woltran (Eds.), Computational Logic in Multi-Agent Systems 14th International Workshop, CLIMA XIV, Corunna, Spain, September 16-18, 2013, Proceedings (pp. 102–118). Springer. https://doi.org/10.1007/978-3-642-40624-9_7 ( reposiTUm)

Delgrande, J., Peppas, P., & Woltran, S. (2013). AGM-Style Belief Revision of Logic Programs under Answer Set Semantics. In P. Cabalar & T. C. Son (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 264–276). Springer. https://doi.org/10.1007/978-3-642-40564-8_27 ( reposiTUm)

Bliem, B., Pichler, R., & Woltran, S. (2013). Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem. In G. Gutin & S. Szeider (Eds.), Parameterized and Exact Computation (pp. 28–40). Springer. https://doi.org/10.1007/978-3-319-03898-8_4 ( reposiTUm)

Hunter, A., & Woltran, S. (2013). Structural Properties for Deductive Argument Systems. In L. van der Gaag (Ed.), Symbolic and Quantitative Approaches to Reasoning with Uncertainty (pp. 278–289). Springer. http://hdl.handle.net/20.500.12708/54786 ( reposiTUm)

Brewka, G., Ellmauthaler, S., Strass, H., Wallner, J. P., & Woltran, S. (2013). Abstract Dialectical Frameworks Revisited. In F. Rossi (Ed.), Proceedings of the twenty-third International Joint Conference on Artificial Intelligence (IJCAI 2013) (pp. 803–809). AAAI Press. http://hdl.handle.net/20.500.12708/54784 ( reposiTUm)

Wallner, J. P., Weissenbacher, G., & Woltran, S. (2013). Advanced SAT Techniques for Abstract Argumentation. In Computational Logic in Multi-Agent Systems 14th International Workshop, CLIMA XIV, Corunna, Spain, September 16-18, 2013, Proceedings (pp. 138–154). Springer / LNCS. https://doi.org/10.1007/978-3-642-40624-9_9 ( reposiTUm)

Faber, W., Truszczynski, M., & Woltran, S. (2013). Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence. In Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence (pp. 297–303). AAAI Press. http://hdl.handle.net/20.500.12708/54899 ( reposiTUm)

Dvořák, W., Gaggl, S. A., Wallner, J. P., & Woltran, S. (2013). Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems. In H. Tompits, S. Abreu, J. Oetsch, J. Puehrer, D. Seipel, M. Umeda, & A. Wolf (Eds.), Applications of Declarative Programming and Knowledge Management (pp. 114–133). Springer. https://doi.org/10.1007/978-3-642-41524-1_7 ( reposiTUm)

Dvorak, W., & Spanring, C. (2012). Comparing the Expressiveness of Argumentation Semantics. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Proceedings of Computational Models of Argument - Proceedings of COMMA 2012 (pp. 261–272). Frontiers in Artificial Intelligence and Applications / IOS Press. http://hdl.handle.net/20.500.12708/54496 ( reposiTUm)

Charwat, G., & Dvorak, W. (2012). dynPARTIX 2.0 - Dynamic Programming Argumentation Reasoning Tool. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Proceedings of Computational Models of Argument - Proceedings of COMMA 2012 (pp. 507–508). Frontiers in Artificial Intelligence and Applications / IOS Press. http://hdl.handle.net/20.500.12708/54497 ( reposiTUm)

Dvorak, W., Järvisalo, M., Wallner, J. P., & Woltran, S. (2012). Complexity-Sensitive Decision Procedures for Abstract Argumentation. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Proceedings of 13#^{th} int. conf. of Principles of Knowledge Representation and Reasoning (pp. 54–64). AAAI Press. http://hdl.handle.net/20.500.12708/54155 ( reposiTUm)

Creignou, N., Papini, O., Pichler, R., & Woltran, S. (2012). Belief Revision within Fragments of Propositional Logic. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Proceedings of 13#^{th} int. conf. on Principles of Knowledge Representation and Reasoning (p. 11). AAAI Press. http://hdl.handle.net/20.500.12708/54154 ( reposiTUm)

Morak, M., Musliu, N., Pichler, R., Rümmele, S., & Woltran, S. (2012). Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. In Y. Hamadi & M. Schoenauer (Eds.), Learning and Intelligent Optimization (pp. 130–144). Springer. https://doi.org/10.1007/978-3-642-34413-8_10 ( reposiTUm)

Morak, M., & Woltran, S. (2012). Preprocessing of Complex Non-Ground Rules in Answer Set Programming. In A. Dovier & V. S. Costa (Eds.), Technical Communications of the 28th International Conference on Logic Programming (pp. 247–258). LIPIcs. http://hdl.handle.net/20.500.12708/54464 ( reposiTUm)

Kim, E. J., & Ordyniak, S. (2012). Valued-Based Argumentation for Tree-like Value Graphs. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Fourth International Conference on Computational Models of Argument (Comma 2012) (pp. 378–389). IOS Press. http://hdl.handle.net/20.500.12708/54321 ( reposiTUm)

Egly, U., Creignou, N., & Schmidt, J. (2012). Complexity of logic-based argumentation in Schaefer’s framework. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Computational Models of Argument (pp. 237–248). IOS Press. http://hdl.handle.net/20.500.12708/54461 ( reposiTUm)

Dvořák, W., Szeider, S., & Woltran, S. (2012). Abstract Argumentation via Monadic Second Order Logic. In E. Hüllermeier, S. Link, T. Fober, & B. Seeger (Eds.), Scalable Uncertainty Management 6th International Conference, SUM 2012, Marburg, Germany, September 17-19, 2012, Proceedings (pp. 85–98). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-642-33362-0_7 ( reposiTUm)

Dvorak, W., & Gaggl, S. (2012). Incorporating Stage Semantics in the SCC-recursive Schema for Argumentation Semantics. In R. Rosati & S. Woltran (Eds.), Proceedings of 14#^{th} International Workshop on Non-Monotonic Reasoning (p. 9). http://hdl.handle.net/20.500.12708/54176 ( reposiTUm)

Dvorak, W., & Gaggl, S. (2012). Computational Aspects of cf2 and stage2 Argumentation Semantics. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Proceedings of Fourth International Conference on Computational Models of Argument (pp. 273–284). “Frontiers in Artificial Intelligence and Applications” series/IOS Press. http://hdl.handle.net/20.500.12708/54177 ( reposiTUm)

Lackner, M., Pichler, R., Rümmele, S., & Woltran, S. (2012). Multicut on Graphs of Bounded Clique-Width. In G. Lin (Ed.), Combinatorial Optimization and Applications (pp. 115–126). Springer. https://doi.org/10.1007/978-3-642-31770-5_11 ( reposiTUm)

Charwat, G., Wallner, J. P., & Woltran, S. (2012). Utilizing ASP for Generating and Visualizing Argumentation Frameworks. In M. Fink & Y. Lierler (Eds.), 5th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2012) (p. 15). CoRR. http://hdl.handle.net/20.500.12708/54185 ( reposiTUm)

Ellmauthaler, S., & Wallner, J. P. (2012). Evaluating Abstract Dialectical Frameworks with ASP. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Proceedings of Computational Models of Argument - Proceedings of COMMA 2012 (pp. 505–506). IOS Press. http://hdl.handle.net/20.500.12708/54186 ( reposiTUm)

Faber, W., Truszczynski, M., & Woltran, S. (2012). Strong Equivalence of Qualitative Optimization Problems. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Proceedings of 13#^{th} int. conf. on Principles of Knowledge Representation and Reasoning (pp. 188–198). AAAI Press. http://hdl.handle.net/20.500.12708/54159 ( reposiTUm)

Morak, M., Musliu, N., Pichler, R., Rümmele, S., & Woltran, S. (2011). A New Tree-Decomposition Based Algorithm for Answer Set Programming. In T. M. Khoshgoftaar & X. Zhu (Eds.), 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence. https://doi.org/10.1109/ictai.2011.154 ( reposiTUm)

Woltran, S. (2011). Equivalence between Extended Datalog Programs. A Brief Survey. In O. de Moor, G. Gottlob, T. Furche, & A. Sellers (Eds.), Datalog Reloaded (pp. 106–119). Springer. http://hdl.handle.net/20.500.12708/53954 ( reposiTUm)

Dvorak, W., Gaggl, S., Wallner, J. P., & Woltran, S. (2011). Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems. In 19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011) (p. 14). http://hdl.handle.net/20.500.12708/53720 ( reposiTUm)

Gaggl, S. A., & Woltran, S. (2011). Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets. In W. Liu (Ed.), Symbolic and Quantitative Approaches to Reasoning with Uncertainty (pp. 38–49). Springer. https://doi.org/10.1007/978-3-642-22152-1_4 ( reposiTUm)

Brewka, G., Dunne, P. E., & Woltran, S. (2011). Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs. In T. Walsh (Ed.), Proceedings of the 22#^{nd} Int. Joint Conference on Artificial Intelligence (p. 6). AAAI Press. http://hdl.handle.net/20.500.12708/53672 ( reposiTUm)

Dvorak, W., Dunne, P. E., & Woltran, S. (2011). Parametric Properties of Ideal Semantics. In T. Walsh (Ed.), Proceedings of the 22#^{nd} Int. Joint Conference on Artificial Intelligence (p. 6). AAAI Press. http://hdl.handle.net/20.500.12708/53671 ( reposiTUm)

Dvorak, W., Morak, M., Nopp, C., & Woltran, S. (2011). A Dynamic Programming Reasoner for Abstract Argumentation. In 19th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2011) (p. 5). http://hdl.handle.net/20.500.12708/53730 ( reposiTUm)

Gaggl, S., & Woltran, S. (2010). cf2 Semantics Revisited. In P. Baroni, F. Cerutti, M. Giacomin, & G. R. Simari (Eds.), Computational Models of Argument (pp. 243–254). IOS Press. http://hdl.handle.net/20.500.12708/53354 ( reposiTUm)

Dvorak, W., & Woltran, S. (2010). On the Intertranslatability of Argumentation Semantics. In Proceedings of the Conference on Thirty Years of Nonmonotonic Reasoning (p. 15). http://hdl.handle.net/20.500.12708/53356 ( reposiTUm)

Dvorak, W., Szeider, S., & Woltran, S. (2010). Reasoning in Argumentation Frameworks of Bounded Clique-Width. In P. Baroni, F. Cerutti, M. Giacomin, & G. R. Simari (Eds.), Proceedings of COMMA 2010 (pp. 219–230). IOS Press. http://hdl.handle.net/20.500.12708/53323 ( reposiTUm)

Pfandler, A., Pichler, R., & Woltran, S. (2010). Decentralized Diagnosis: Complexity Analysis and Datalog Encodings. In H. Kaiser & R. Kirner (Eds.), Proceedings of the Junior Scientist Conference 2010 (pp. 291–292). http://hdl.handle.net/20.500.12708/53424 ( reposiTUm)

Pichler, R., Rümmele, S., & Woltran, S. (2010). Counting and Enumeration Problems with Bounded Treewidth. In R. Goebel, J. Siekmann, & W. Wahlster (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (pp. 387–404). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-17511-4_22 ( reposiTUm)

Pichler, R., Polleres, A., Skritek, S., & Woltran, S. (2010). Minimising RDF Graphs under Rules and Constraints Revisited. In A. H. F. Laender & L. V. S. Lakshmanan (Eds.), Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/53438 ( reposiTUm)

Pichler, R., & Woltran, S. (2010). The Complexity of Handling Minimal Solutions in Logic-Based Abduction. In H. Coelho, R. Studer, & M. Woolridge (Eds.), Prooceedings of ECAI 2010 - 19th European Conference on Artificial Intelligence (pp. 895–900). IOS Press. http://hdl.handle.net/20.500.12708/53439 ( reposiTUm)

Pichler, R., Polleres, A., Skritek, S., & Woltran, S. (2010). Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries. In P. Hitzler & T. Lukasiewicz (Eds.), Web Reasoning and Rule Systems (pp. 133–148). Lecture Notes/ Springer. https://doi.org/10.1007/978-3-642-15918-3_11 ( reposiTUm)

Woltran, S. (2010). Strong Equivalence in Argumentation. In J. Dix, J. Leite, G. Governatori, & W. Jamroga (Eds.), Computational Logic in Multi-Agent Systems (p. 14). Lecture Notes/ Springer. https://doi.org/10.1007/978-3-642-14977-1_4 ( reposiTUm)

Brewka, G., Truszczynski, M., & Woltran, S. (2010). Representing Preferences Among Sets. In M. Fox & D. Poole (Eds.), Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010. AAAI Press. http://hdl.handle.net/20.500.12708/53441 ( reposiTUm)

Oikarinen, E., & Woltran, S. (2010). Characterizing Strong Equivalence for Argumentation Frameworks. In F. Lin, U. Sattler, & M. Truszczynski (Eds.), Proc. of KR 2010 (p. 11). AAAI Press. http://hdl.handle.net/20.500.12708/53133 ( reposiTUm)

Pichler, R., Rümmele, S., & Woltran, S. (2010). Multicut Algorithms via Tree Decompositions. In T. Calamoneri & J. Diaz (Eds.), Algorithms and Complexity : 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010, Proceedings (pp. 167–179). LNCS, Springer. https://doi.org/10.1007/978-3-642-13073-1_16 ( reposiTUm)

Dvorak, W., Pichler, R., & Woltran, S. (2010). Towards Fixed-Parameter Tractable Algorithms for Argumentation. In F. Lin, U. Sattler, & M. Truszczynski (Eds.), Proc. of KR 2010 (p. 11). AAAI Press. http://hdl.handle.net/20.500.12708/53170 ( reposiTUm)

Brewka, G., & Woltran, S. (2010). Abstract Dialectical Frameworks. In F. Lin, U. Sattler, & M. Truszczynski (Eds.), Proc. of KR 2010 (p. 10). AAAI Press. http://hdl.handle.net/20.500.12708/53169 ( reposiTUm)

Pichler, R., Rümmele, S., Szeider, S., & Woltran, S. (2010). Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. In F. Lin, U. Sattler, & M. Truszczynski (Eds.), Proc. of KR 2010 (p. 10). AAAI Press. http://hdl.handle.net/20.500.12708/53171 ( reposiTUm)

Morak, M., Pichler, R., Rümmele, S., & Woltran, S. (2010). A Dynamic-Programming Based ASP-Solver. In R. Goebel, J. Siekmann, & W. Wahlster (Eds.), Logics in Artificial Intelligence (pp. 369–372). Springer. https://doi.org/10.1007/978-3-642-15675-5_34 ( reposiTUm)

Feier, C., & Heymans, S. (2010). An Optimization for Reasoning with Forest Logic Programs. In S. Woltran & M. Balduccini (Eds.), Proc. of the Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2010) (p. 15). http://hdl.handle.net/20.500.12708/53511 ( reposiTUm)

Creignou, N., Schmidt, J., Thomas, M., & Woltran, S. (2010). Sets of Boolean Connectives That Make Argumentation Easier. In T. Janhunen & I. Niemelä (Eds.), Logics in Artificial Intelligence (pp. 117–129). Springer. https://doi.org/10.1007/978-3-642-15675-5_12 ( reposiTUm)

Faber, W., & Woltran, S. (2009). A Framework for Programming with Module Consequences. In M. De Vos & T. Schaub (Eds.), Proc. of the 2#^{nd} International Workshop on Software Engineering for Answer Set Programming (SEA’09) (pp. 34–48). http://hdl.handle.net/20.500.12708/52763 ( reposiTUm)

Faber, W., & Woltran, S. (2009). Manifold Answer-Set Programs for Meta-Reasoning. In A. Herzig & B. Johnston (Eds.), Proc. of the IJCAI-09 Workshop on Nonmonotonic Reasoning, Action and Change (NRAC’09) (pp. 33–40). ePress of the University of Technology, Sydney. http://hdl.handle.net/20.500.12708/52762 ( reposiTUm)

Pichler, R., Rümmele, S., & Woltran, S. (2009). Belief Revision with Bounded Treewidth. In E. Erdem, F. Lin, & T. Schaub (Eds.), Logic Programming and Nonmonotonic Reasoning: 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009, Proceedings (pp. 250–263). Springer. https://doi.org/10.1007/978-3-642-04238-6_22 ( reposiTUm)

Faber, W., & Woltran, S. (2009). Manifold Answer-Set Programs for Meta-reasoning. In E. Erdem, F. Lin, & T. Schaub (Eds.), Logic Programming and Nonmonotonic Reasoning: 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009, Proceedings (pp. 115–128). Springer. https://doi.org/10.1007/978-3-642-04238-6_12 ( reposiTUm)

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

Woltran, S. (2009). Belief Revision with Bounded Treewidth. In G. Bonanno, J. P. Delgrande, & H. Rott (Eds.), Dagstuhl Seminar Proceedings (p. 51). http://hdl.handle.net/20.500.12708/52766 ( reposiTUm)

Gebser, M., Pührer, J., Schaub, T., Tompits, H., & Woltran, S. (2009). spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics. In D. Seipel, M. Hanus, & A. Wolf (Eds.), Applications of Declarative Programming and Knowledge Management (pp. 247–252). Springer. https://doi.org/10.1007/978-3-642-00675-3_17 ( reposiTUm)

Jakl, M., Pichler, R., & Woltran, S. (2009). Answer-Set Programming with Bounded Tree Width. In C. Boutilier (Ed.), Proc. of the Twenty-First Int. Joint Conference on Artificial Intelligence (pp. 816–822). AAAI Press. http://hdl.handle.net/20.500.12708/52743 ( reposiTUm)

Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2009). Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT. In D. Seipel, M. Hanus, & A. Wolf (Eds.), Applications of Declarative Programming and Knowledge Management (pp. 241–246). Springer. http://hdl.handle.net/20.500.12708/52744 ( reposiTUm)

Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2009). ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions. In E. Erdem, F. Lin, & T. Schaub (Eds.), Logic Programming and Nonmonotonic Reasoning: 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009, Proceedings (pp. 382–395). Springer. https://doi.org/10.1007/978-3-642-04238-6_32 ( reposiTUm)

Delgrande, J. P., Schaub, T., Tompits, H., & Woltran, S. (2009). Merging Logic Programs under Answer Set Semantics. In P. M. Hill & D. S. Warren (Eds.), Logic Programming: 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 14-17, 2009, Proceedings (pp. 160–174). Springer. https://doi.org/10.1007/978-3-642-02846-5_17 ( reposiTUm)

Truszczynski, M., & Woltran, S. (2008). Hyperequivalence of Logic Programs with Respect to Supported Models. In A. Cohn & D. M. Hamilton (Eds.), AAAI-08/IAAI-08 Proceedings (pp. 560–565). AAAI Press. http://hdl.handle.net/20.500.12708/52262 ( reposiTUm)

Gebser, M., Schaub, T., Tompits, H., & Woltran, S. (2008). Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets. In S. Hartmann & G. Kern-Isberner (Eds.), Foundations of Information and Knowledge Systems. Springer LNCS. https://doi.org/10.1007/978-3-540-77684-0_5 ( reposiTUm)

Puehrer, J., Tompits, H., & Woltran, S. (2008). Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence. In M. G. de la Banda & E. Pontelli (Eds.), Logic Programming. Springer LNCS. https://doi.org/10.1007/978-3-540-89982-2_47 ( reposiTUm)

Pichler, R., Polleres, A., Wei, F., & Woltran, S. (2008). dRDF: Entailment for Domain-Restricted RDF. In The Semantic Web: Research and Applications (pp. 200–214). Springer LNCS. https://doi.org/10.1007/978-3-540-68234-9_17 ( reposiTUm)

Truszczynski, M., & Woltran, S. (2008). Hyperequivalence of programs and operators (Preliminary version). In M. Kaminski & M. Truszczynski (Eds.), Tenth International Symposium on Artificial Intelligence and Mathematics (ISAIM) (p. 8). http://hdl.handle.net/20.500.12708/52639 ( reposiTUm)

Egly, U., Gaggl, S. A., & Woltran, S. (2008). ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming. In M. G. de la Banda & E. Pontelli (Eds.), Proceedings of the 24#^{th} Conference on Logic Programming (ICLP’08) (pp. 734–738). Springer. http://hdl.handle.net/20.500.12708/52465 ( reposiTUm)

Truszczynski, M., & Woltran, S. (2008). Relativized Hyperequivalence of Logic Programs for Modular Programming. In M. G. de la Banda & E. Pontelli (Eds.), Proceedings of the 24#^{th} Conference on Logic Programming (ICLP’08) (pp. 576–590). Springer. http://hdl.handle.net/20.500.12708/52468 ( reposiTUm)

Egly, U., Gaggl, S. A., & Woltran, S. (2008). Answer-Set Programming Encodings for Argumentation Frameworks. In W. Faber & J. Lee (Eds.), ICLP-Workshop Proceedings; Proceedings of the 1st International Workshop on Answer Set Programming and Other Computing Paradigms, ASPOCP 2008 (pp. 1–15). http://hdl.handle.net/20.500.12708/52469 ( reposiTUm)

Delgrande, J. P., Schaub, T., Tompits, H., & Woltran, S. (2008). Belief Revision of Logic Programs under Answer Set Semantics. In G. Brewka & J. Lang (Eds.), Proceedings of the 11th Conference on Principles of Knowledge Representation and Reasoning (KR’08) (pp. 411–421). AAAI Press. http://hdl.handle.net/20.500.12708/52555 ( reposiTUm)

Faber, W., Tompits, H., & Woltran, S. (2008). Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. In G. Brewka & J. Lang (Eds.), Proceedings of the 11th Conference on Principles of Knowledge Representation and Reasoning (KR’08) (pp. 433–443). AAAI Press. http://hdl.handle.net/20.500.12708/52556 ( reposiTUm)

Jakl, M., Pichler, R., Rümmele, S., & Woltran, S. (2008). Fast Counting with Bounded Treewidth. In I. Cervesato, H. Veith, & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (pp. 436–450). Springer. http://hdl.handle.net/20.500.12708/52425 ( reposiTUm)

Fink, M., Pichler, R., Tompits, H., & Woltran, S. (2007). Complexity of Rule Redundancy in Non-Ground Answer-Set Programming over Finite Domains. In C. Baral, G. Brewka, & J. Schlipf (Eds.), Proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2007) (pp. 123–135). Springer. http://hdl.handle.net/20.500.12708/51780 ( reposiTUm)

Eiter, T., Fink, M., Tompits, H., & Woltran, S. (2007). Complexity Results for Checking Equivalence of Stratified Logic Programs. In M. Veloso (Ed.), Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007) (pp. 330–335). AAAI Press. http://hdl.handle.net/20.500.12708/51779 ( reposiTUm)

Faber, W., Tompits, H., & Woltran, S. (2007). Characterizing Notions of Strong Equivalence for Logic Programs with Ordered Disjunctions. In 3rd Multidisciplinary Workshop on Advances in Preference Handling (M-PREF 2007) (p. 8). http://hdl.handle.net/20.500.12708/51849 ( reposiTUm)

Gebser, M., Puehrer, J., Schaub, T., Tompits, H., & Woltran, S. (2007). spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics. In Proc. of 17th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2007) and 21st Workshop on (Constraint) Logic Programming (WLP 2007) (p. 4). Bayerische Julius-Maximilians-Universität Würzburg,. http://hdl.handle.net/20.500.12708/52027 ( reposiTUm)

Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2007). Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT. In Proc. of 17th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2007) and 21st Workshop on (Constraint) Logic Programming (WLP 2007) (p. 4). http://hdl.handle.net/20.500.12708/51977 ( reposiTUm)

Janhunen, T., Oikarinen, E., Tompits, H., & Woltran, S. (2007). Modularity Aspects of Disjunctive Stable Models. In Proceeding of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR ’07) (pp. 175–187). LNCS/Springer. http://hdl.handle.net/20.500.12708/51827 ( reposiTUm)

Brain, M., Gebser, M., Puehrer, J., Schaub, T., Tompits, H., & Woltran, S. (2007). Debugging ASP Programs by Means of ASP. In Proceeding of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR ’07) (pp. 31–43). LNCS/Springer. http://hdl.handle.net/20.500.12708/51826 ( reposiTUm)

Woltran, S. (2007). A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming. In Proceedings of the LPNMR’07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories (pp. 13–24). CEUR-Proceedings. http://hdl.handle.net/20.500.12708/51828 ( reposiTUm)

Oetsch, J., Tompits, H., & Woltran, S. (2007). Facts do not Cease to Exist Because They are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. In D. Pearce, A. F. Polleres, S. Woltran, & A. Valverde (Eds.), Proceedings of the LPNMR’07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories (pp. 25–36). http://hdl.handle.net/20.500.12708/51829 ( reposiTUm)

Gebser, M., Schaub, T., Tompits, H., & Woltran, S. (2007). Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. In Proceedings of the LPNMR’07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories (pp. 37–48). CEUR-Proceedings. http://hdl.handle.net/20.500.12708/51830 ( reposiTUm)

Oetsch, J., Tompits, H., & Woltran, S. (2007). Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. In Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence (p. 7). AAAI Press. http://hdl.handle.net/20.500.12708/51825 ( reposiTUm)

Pearce, D., Tompits, H., & Woltran, S. (2007). Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report. In Proceedings of the LPNMR’07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories (pp. 49–60). CEUR-Proceedings. http://hdl.handle.net/20.500.12708/51831 ( reposiTUm)

Brain, M., Gebser, M., Puehrer, J., Schaub, T., Tompits, H., & Woltran, S. (2007). That is illogical Captain! The Debugging Support Tool spock for Answer-Set Programs -- System Description. In Proceeding of the LPNMR’ 07 Workshop on Software Engineering for Answer Set Programming (pp. 71–85). http://hdl.handle.net/20.500.12708/51847 ( reposiTUm)

Eiter, T., Ianni, G., Schindlauer, R., & Tompits, H. (2006). dlvhex: A System for Integrating Multiple Semantics in an Answer-Set Programming Framework. In M. Fink, H. Tompits, & S. Woltran (Eds.), Proceedings 20th Workshop on Logic Programming and Constraint Systems (WLP ’06) (pp. 206–210). http://hdl.handle.net/20.500.12708/51580 ( reposiTUm)

Egly, U., & Woltran, S. (2006). Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas. In P. E. Dunne & T. J. M. Bench-Capon (Eds.), Proceedings of the 1st International Conference on Computational Models of Argument (COMMA 2006) (pp. 133–144). IOS Press. http://hdl.handle.net/20.500.12708/51590 ( reposiTUm)

Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2006). ccT: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming. In Proceedings of CIC-06 (pp. 3–11). IEEE Computer Society. http://hdl.handle.net/20.500.12708/51609 ( reposiTUm)

Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2006). ccT: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming. In Proceedings. ICLP’06 Workshop: Lash’06, Seattle, Washington, Non-EU. http://hdl.handle.net/20.500.12708/51606 ( reposiTUm)

Egly, U., Seidl, M., & Woltran, S. (2006). A Solver for QBFs in Nonprenex Form: Overview and Experimental Results. In Proceedings of the Guangzhou Symposioum on Satisfiability in Logic-Based Modeling (p. 11). http://hdl.handle.net/20.500.12708/51624 ( reposiTUm)

Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2006). ccT: A Correspondence-Checking Tool For Logic Programs Under The Answer-Set Semantics. In Proceedings of the JELIA2006 (pp. 502–505). Springer. http://hdl.handle.net/20.500.12708/51449 ( reposiTUm)

Egly, U., Seidl, M., & Woltran, S. (2006). A Solver for QBFs in Nonprenex Form. In Proceedings of the ECAI 2006 (pp. 477–481). IOS Press. http://hdl.handle.net/20.500.12708/51448 ( reposiTUm)

Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2006). A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results. In Online Proceedings - WLP 2006. 20th Workshop on Logic Programming, Wien, EU. http://hdl.handle.net/20.500.12708/51450 ( reposiTUm)

Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2006). A Tool for Advanced Correspondence Checking in Answer-Set Programming. In Proceedings is for the Eleventh International Workshop on Nonmonotonic Reasoning. 11th International Workshop on Nonmonotonic Reasoning, Lake District, UK, EU. http://hdl.handle.net/20.500.12708/51451 ( reposiTUm)

Pichler, R. (2006). Algorithmic Aspectc of Model Representations. In M. Fink, H. Tompits, & S. Woltran (Eds.), 20th Workshop on Logic Programming (WLP2006) (pp. 12–20). INFSYS Research Report. http://hdl.handle.net/20.500.12708/51472 ( reposiTUm)

Eiter, T., Fink, M., Tompits, H., Traxler, P., & Woltran, S. (2006). Replacements in Non-Ground Answer-Set Programming. In M. Fink, H. Tompits, & S. Woltran (Eds.), Proceedings of the 20th Workshop on Logic Programming (WLP 2006), Vienna, Austria, February 22--24 (p. 9). TU Wien, Institut fuer Informationssysteme. http://hdl.handle.net/20.500.12708/51566 ( reposiTUm)

Eiter, T., Fink, M., Tompits, H., Traxler, P., & Woltran, S. (2006). Replacements in Non-Ground Answer-Set Programming. In P. Doherty, J. Mylopoulos, & C. Welty (Eds.), Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR 2006), Lake District of the United Kingdom, June 2--5 (pp. 340–351). AAAI Press. http://hdl.handle.net/20.500.12708/51567 ( reposiTUm)

Eiter, T., Traxler, P., & Woltran, S. (2006). An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs. In M. Fisher, W. van der Hoek, B. Konev, & A. Lisitsa (Eds.), Proceedings of the 10th European Conference on Logics in Artificial Intelligence (JELIA 2006) (pp. 477–480). Springer. http://hdl.handle.net/20.500.12708/51589 ( reposiTUm)

Tompits, H., & Woltran, S. (2005). Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. In M. Gabbrielli & G. Gupta (Eds.), Proceedings of the 21st International Conference on Logic Programming (pp. 189–203). Springer. http://hdl.handle.net/20.500.12708/51103 ( reposiTUm)

Eiter, T., Fink, M., Tompits, H., & Woltran, S. (2005). Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. In Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, (pp. 695–700). AAAI Press / The MIT Press 2005. http://hdl.handle.net/20.500.12708/51104 ( reposiTUm)

Tompits, H., & Woltran, S. (2005). Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. In M. De Vos & A. Provetti (Eds.), Answer Set Programming, Advances in Theory and Implementation, Proceedings of the 3rd Intl. ASP’05 Workshop (pp. 115–129). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/51106 ( reposiTUm)

Eiter, T., Tompits, H., & Woltran, S. (2005). On Solution Correspondences in Answer-Set Programming. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05) (pp. 97–102). http://hdl.handle.net/20.500.12708/51105 ( reposiTUm)

Beiträge in Büchern

Clemens Heitzinger, & Stefan Woltran. (2024). A Short Introduction to Artificial Intelligence: Methods, Success Stories, and Current Limitations. In H. Werthner, C. Ghezzi, & J. Kramer (Eds.), Introduction to Digital Humanism : A Textbook (pp. 135–149). Springer. https://doi.org/10.1007/978-3-031-45304-5_9 ( reposiTUm)

Neidhardt, J., Werthner, H., & Woltran, S. (2022). It Is Simple, It Is Complicated. Perspectives on Digital Humanism. In H. Werthner, E. Prem, E. A. Lee, & C. Ghezzi (Eds.), Perspectives on Digital Humanism (pp. 335–342). Springer. http://hdl.handle.net/20.500.12708/30705 ( reposiTUm)

Brewka, G., Ellmauthaler, S., Strass, H., Wallner, J. P., & Woltran, S. (2018). Abstract Dialectical Frameworks. In P. Baroni, D. M. Gabbay, M. Giacomin, & L. van der Torre (Eds.), Handbook of Formal Argumentation (pp. 237–285). College Publications. http://hdl.handle.net/20.500.12708/29406 ( reposiTUm)

Eiter, T., Fink, M., & Weinzierl, A. (2015). Preference-Based Diagnosis Selection in Multi-Context Systems. In T. Eiter, H. Strass, M. Truszczynski, & S. Woltran (Eds.), Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation (pp. 233–248). Springer International Publishing Switzerland. https://doi.org/10.1007/978-3-319-14726-0_16 ( reposiTUm)

Baumann, R., & Spanring, C. (2015). Infinite Argumentation Frameworks. In T. Eiter, H. Strass, M. Truszczynski, & S. Woltran (Eds.), Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation (pp. 281–295). Springer LNCS. https://doi.org/10.1007/978-3-319-14726-0_19 ( reposiTUm)

Eiter, T., Strass, H., Truszczynski, M., & Woltran, S. (2015). A Glimpse on Gerhard Brewka’s Contributions to Artificial Intelligence. In T. Eiter, H. Strass, M. Truszczynski, & S. Woltran (Eds.), Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation (pp. 1–16). Springer LNCS. http://hdl.handle.net/20.500.12708/28886 ( reposiTUm)

Dvořák, W., Gaggl, S. A., Linsbichler, T., & Wallner, J. P. (2015). Reduction-Based Approaches to Implement Modgil’s Extended Argumentation Frameworks. In T. Eiter, H. Strass, M. Truszczynski, & S. Woltran (Eds.), Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation (pp. 249–264). Springer. https://doi.org/10.1007/978-3-319-14726-0_17 ( reposiTUm)

Baumann, R., Brewka, G., Dvorak, W., & Woltran, S. (2012). Parameterized Splitting: A Simple Modification-Based Approach. In E. Erdem, J. Lee, Y. Lierler, & D. Pearce (Eds.), Correct Reasoning. Springer LNCS. http://hdl.handle.net/20.500.12708/27624 ( reposiTUm)

Modgil, S., Toni, F., Bex, F., Bratko, I., Chesñevar, C. I., Dvořák, W., Falappa, M. A., Fan, X., Gaggl, S. A., García, A. J., González, M. P., Gordon, T. F., Leite, J., Možina, M., Reed, C., Simari, G. R., Szeider, S., Torroni, P., & Woltran, S. (2012). The Added Value of Argumentation. In S. Ossowski (Ed.), Agreement Technologies (pp. 357–403). Springer Netherlands. https://doi.org/10.1007/978-94-007-5583-3_21 ( reposiTUm)

Faber, W., & Woltran, S. (2011). Manifold Answer-Set Programs and Their Applications. In M. Balduccini & T. C. Son (Eds.), Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. Springer-Verlag. http://hdl.handle.net/20.500.12708/27229 ( reposiTUm)

Besnard, P., Schaub, T., Tompits, H., & Woltran, S. (2005). Representing Paraconsistent Reasoning via Quantified Propositional Logic. In L. Bertossi (Ed.), Inconsistency Tolerance (pp. 84–118). Springer, LNCS 3300. http://hdl.handle.net/20.500.12708/25356 ( reposiTUm)

Bücher

Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation. (2015). In T. Eiter, H. Strass, M. Truszczynski, & S. Woltran (Eds.), Lecture Notes in Computer Science. Springer. https://doi.org/10.1007/978-3-319-14726-0 ( reposiTUm)

Computational Logic in Multi-Agent Systems. (2013). In J. Leite, T. C. Son, P. Torroni, L. van der Torre, & S. Woltran (Eds.), Lecture Notes in Computer Science. Springer. https://doi.org/10.1007/978-3-642-40624-9 ( reposiTUm)

Tagungsbände

Logic Programming and Nonmonotonic Reasoning. (2019). In M. Balduccini, Y. Lierler, & S. Woltran (Eds.), Lecture Notes in Computer Science. Springer LNCS. https://doi.org/10.1007/978-3-030-20528-7 ( reposiTUm)

Ferrarotti, F., & Woltran, S. (Eds.). (2018). Foundations of Information and Knowledge Systems. Springer Cham. https://doi.org/10.1007/978-3-319-90050-6 ( reposiTUm)

Graph Structures for Knowledge Representation and Reasoning. (2014). In M. Croitoru, S. Rudolph, S. Woltran, & C. Gonzales (Eds.), Lecture Notes in Computer Science. Springer. https://doi.org/10.1007/978-3-319-04534-4 ( reposiTUm)

Verheij, B., Szeider, S., & Woltran, S. (Eds.). (2012). Fourth International Conference on Computational Models of Argument (COMMA 2012). IOS Press. http://hdl.handle.net/20.500.12708/23575 ( reposiTUm)

Pearce, D., Polleres, A. F., Valverde, A., & Woltran, S. (Eds.). (2007). Workshop on Correspondence and Equivalence for Nonmonotonic Theories (CENT 2007). CEUR-Proceedings. http://hdl.handle.net/20.500.12708/22346 ( reposiTUm)

Fink, M., Tompits, H., & Woltran, S. (Eds.). (2006). Proceedings of the 20th Workshop on Logic Programming (WLP 2006), Vienna, Austria, February 22--24. TU Wien. http://hdl.handle.net/20.500.12708/22322 ( reposiTUm)

Präsentationen

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)

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

Woltran, S. (2020). Computational Argumentation - Formal Models and Complexity Results. Research-Seminar, Bergen, Norway. http://hdl.handle.net/20.500.12708/87106 ( 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)

Woltran, S. (2019). Symbolische KI - Good Old Fashioned oder Haute Couture. OCG Jahresopening 2019, Wien, Austria. http://hdl.handle.net/20.500.12708/86940 ( reposiTUm)

Woltran, S. (2019). Preference Orders on Families of Sets -- Complexity and Characterization Results. IPASC - Workshop Individual Preferences and Social Choice, Graz, Austria. http://hdl.handle.net/20.500.12708/86939 ( reposiTUm)

Woltran, S. (2019). Symbolische KI - Good Old Fashioned oder Haute Couture. Ai / Imagine19, Wien, Austria. http://hdl.handle.net/20.500.12708/86932 ( reposiTUm)

Woltran, S. (2018). Expressibility of Argumentation Frameworks and its Relation to the Dynamics of Argumentation. AMANDE Workshop, Toulouse, France. http://hdl.handle.net/20.500.12708/86807 ( reposiTUm)

Woltran, S. (2018). Solving (Q)SAT Problems via Tree Decomposition and Dynamic Programming. JFPC (Journées Francophones de Programmation par Contraintes), Amiens, France. http://hdl.handle.net/20.500.12708/86806 ( reposiTUm)

Woltran, S. (2016). Dynamic Programming on Tree Decompositions in Practice. 8th European Starting AI Researcher Symposium, Den Haag, EU. http://hdl.handle.net/20.500.12708/86435 ( reposiTUm)

Woltran, S. (2015). Dynamic Programming on Tree Decomposition in Practice. Some Lessons Learned. 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2015), Timisoara, EU. http://hdl.handle.net/20.500.12708/86188 ( reposiTUm)

Woltran, S. (2014). Comparing the Power of Different Semantics for Abstract Argumentation. Workshop on the Dynamics of Argumentation, Rules and Conditionals DARC, University Luxembourg, Luxembourg, EU. http://hdl.handle.net/20.500.12708/85863 ( reposiTUm)

Dunne, P. E., Dvorak, W., Linsbichler, T., & Woltran, S. (2013). Characteristics of Multiple Viewpoints in Abstract Argumentation. 4th Workshop on Dynamics of Knowledge and Belief (DKB-2013), Koblenz, Germany, EU. http://hdl.handle.net/20.500.12708/85646 ( reposiTUm)

Bliem, B., Pichler, R., & Woltran, S. (2013). Applicability of ASP-based Problem Solving on Tree Decompositions. Third International Workshop on Graph Structures for Knowledge Representation and Reasoning (GKR) 2013, Peking, Non-EU. http://hdl.handle.net/20.500.12708/85667 ( reposiTUm)

Woltran, S. (2013). On the Limits of Expressiveness in Abstract Argumentation Semantics. Belief Change and Argumentation in Multi-Agent Scenarios, Dagstuhl, Germany, EU. http://hdl.handle.net/20.500.12708/85678 ( reposiTUm)

Dvorak, W., Järvisalo, M., Wallner, J. P., & Woltran, S. (2012). CEGARTIX: A SAT-Based Argumentation System. Theory and Application of Satisfiability Testing -- SAT, Guangzhou, Non-EU. http://hdl.handle.net/20.500.12708/85369 ( reposiTUm)

Woltran, S. (2012). Characteristics of Argumentation Semantics. Logique à Marseille -- Camilla Schwind à l’honneur, Marseille, EU. http://hdl.handle.net/20.500.12708/85463 ( reposiTUm)

Alviano, M., Faber, W., & Woltran, S. (2011). Complexity of Super-Coherence Problems in ASP. Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP) 2010, Edinburgh, Non-EU. http://hdl.handle.net/20.500.12708/85143 ( reposiTUm)

Woltran, S. (2011). Computational Aspects of Formal Argumentation. TU Dresden, Dresden, Deutschland, EU. http://hdl.handle.net/20.500.12708/85222 ( reposiTUm)

Woltran, S. (2011). Strong Equivalence in Argumentation. Universität Leipzig, Leipzig, Deutschland, EU. http://hdl.handle.net/20.500.12708/85223 ( reposiTUm)

Woltran, S. (2010). Deciding Equivalence between Extended Datalog Programs. A Brief Survey. Datalog 2.0 Workshop, Oxford, UK, EU. http://hdl.handle.net/20.500.12708/85016 ( reposiTUm)

Woltran, S. (2010). Computational Aspects of Abstract Argumentation. Helsinki Graduate School in Computer Science and Engineering, Helsinki, EU. http://hdl.handle.net/20.500.12708/85068 ( reposiTUm)

Woltran, S. (2009). Characterizing Strong Equivalence for Argumentation Frameworks. Argumentation Christmas Meeting, Leipzig, EU. http://hdl.handle.net/20.500.12708/84908 ( reposiTUm)

Oetsch, J., Tompits, H., & Woltran, S. (2007). Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. AAAI ’ 07, Vancouver, Canada, Non-EU. http://hdl.handle.net/20.500.12708/84653 ( reposiTUm)

Woltran, S. (2006). Replacements in Non-Ground Answer-Set Programming. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84538 ( reposiTUm)

Woltran, S. (2006). Complexity Results for Checking Equivalence of Stratified Logic Programs. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84536 ( reposiTUm)

Woltran, S. (2006). Replacements in Non-Ground Answer-Set Programming. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84537 ( reposiTUm)

Woltran, S. (2005). Solution Correspondences in Answer-Set Programming: An Overview. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84442 ( reposiTUm)

Woltran, S. (2005). Survey of Equivalences in ASP. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84441 ( reposiTUm)

Woltran, S. (2005). Solution Correspondences in Answer-Set Programming: An Overview. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84444 ( reposiTUm)

Woltran, S. (2005). On Solution Correspondences in Answer Set Programming: A General Framework (and Characterizations for the Ground Case). Dagstuhl Seminar Nr. 05171, Nonmonotonic Reasoning, Answer Set Programming and Constraints, Dagstuhl, Deutschland, Austria. http://hdl.handle.net/20.500.12708/84445 ( reposiTUm)

Woltran, S. (2005). Node Presentation: TU Wien. International Workshop on Answer Set Programming (ASP), Bath, UK, Austria. http://hdl.handle.net/20.500.12708/84443 ( reposiTUm)

Tompits, H., & Woltran, S. (2004). On Simplifying and Rewriting Logic Programs: Characterisations and Complexity. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84318 ( reposiTUm)

Woltran, S. (2004). Elimination of Disjunction in Stable Logic Programming. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84317 ( reposiTUm)

Woltran, S. (2004). Complexity of Equivalence between Propositional Logic Programs. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84315 ( reposiTUm)

Woltran, S. (2004). Relativized Notions of Equivalence in ASP. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84316 ( reposiTUm)

Woltran, S. (2003). Paraconsistent Reasoning via QBFs. Dagstuhl Seminar Nr. 03241, Inconsistency Tolerance, Dagstuhl, Germany, Austria. http://hdl.handle.net/20.500.12708/84237 ( reposiTUm)

Woltran, S. (2002). On Implementing Nested Logic Programs. Dagstuhl Seminar Nr. 02381, Nonmonotonic Reasoning, Answer Set Programming and Constraints, Schloss Dagstuhl, Deutschland, Austria. http://hdl.handle.net/20.500.12708/84093 ( reposiTUm)

Woltran, S. (2002). Deciding Strong Equivalence between Logic Programs. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84095 ( reposiTUm)

Berichte

Fichte, J., Kronegger, M., & Woltran, S. (2016). Multiparametric View on Answer Set Programming (DBAI-TR-2016-99). http://hdl.handle.net/20.500.12708/39080 ( reposiTUm)

Bichler, M., Bliem, B., Moldovan, M., Morak, M., & Woltran, S. (2016). Treewidth-Preserving Modeling in ASP (DBAI-TR-2016-97). http://hdl.handle.net/20.500.12708/39078 ( reposiTUm)

Fichte, J., Hecher, M., Morak, M., & Woltran, S. (2016). Answer Set Solving using Tree Decompositions and Dynamic Programming -- The DynASP2 System (DBAI-TR-2016-101). http://hdl.handle.net/20.500.12708/39081 ( reposiTUm)

Abseher, M., Musliu, N., & Woltran, S. (2016). htd -- A Free, Open-Source Framework for Tree Decompositions and Beyond (DBAI-TR-2016-96). http://hdl.handle.net/20.500.12708/39077 ( reposiTUm)

Charwat, G., & Woltran, S. (2016). BDD-based Dynamic Programming on Tree Decompositions (DBAI-TR-2016-95, DBAI). http://hdl.handle.net/20.500.12708/39076 ( reposiTUm)

Abseher, M., Musliu, N., & Woltran, S. (2016). Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning (DBAI-TR-2016-94). http://hdl.handle.net/20.500.12708/39075 ( reposiTUm)

Dunne, P. E., Dvorak, W., Linsbichler, T., & Woltran, S. (2015). Characteristics of Multiple Viewpoints in Abstract Argumentation (DBAI-TR-2015-89). http://hdl.handle.net/20.500.12708/38660 ( reposiTUm)

Bliem, B., Charwat, G., Hecher, M., & Woltran, S. (2015). D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy (DBAI-TR-2015-93). http://hdl.handle.net/20.500.12708/38634 ( reposiTUm)

Abseher, M., Bliem, B., Charwat, G., Dusberger, F., Hecher, M., & Woltran, S. (2014). D-FLAT: Progress Report (DBAI-TR-2014-86). http://hdl.handle.net/20.500.12708/38156 ( reposiTUm)

Eiter, T., Fink, M., Puehrer, J., Tompits, H., & Woltran, S. (2013). Model-Based Recasting in Answer-Set Programming (DBAI-TR-2013-83). http://hdl.handle.net/20.500.12708/37698 ( reposiTUm)

Dvorak, W., Szeider, S., & Woltran, S. (2012). Abstract Argumentation via Monadic Second Order Logic. (DBAI-TR-2012-79). http://hdl.handle.net/20.500.12708/37417 ( reposiTUm)

Gaggl, S., & Woltran, S. (2012). The cf2 Argumentation Semantics Revisited. (DBAI-TR-2012-77). http://hdl.handle.net/20.500.12708/37419 ( reposiTUm)

Dvorak, W., Pichler, R., & Woltran, S. (2011). Towards Fixed-Parameter Tractable Algorithms for Abstract Argumentation (DBAI-TR-2011-74). http://hdl.handle.net/20.500.12708/37126 ( reposiTUm)

Morak, M., Musliu, N., Pichler, R., Rümmele, S., & Woltran, S. (2011). Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming (DBAI-TR-2011-73). http://hdl.handle.net/20.500.12708/37104 ( reposiTUm)

Morak, M., & Woltran, S. (2011). Preprocessing of Complex Non-Ground Rules in Answer Set Programming (DBAI-TR-2011-72). http://hdl.handle.net/20.500.12708/37103 ( reposiTUm)

Dvorak, W., Gaggl, S., Wallner, J. P., & Woltran, S. (2011). Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems (DBAI-TR-2011-70). http://hdl.handle.net/20.500.12708/36951 ( reposiTUm)

Gaggl, S., & Woltran, S. (2011). Strong Equivalence for Argumentation Semantics based on Conflict-free Sets (DBAI-TR-2011-68). http://hdl.handle.net/20.500.12708/36952 ( reposiTUm)

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

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

Truszczynski, M., & Woltran, S. (2008). Hyperequivalence of Logic Programs with Respect to Supported Models (DBAI-TR-2008-58). http://hdl.handle.net/20.500.12708/35161 ( reposiTUm)

Pichler, R., Polleres, A., Wei, F., & Woltran, S. (2008). dRDF: Entailment for Domain-Restricted RDF (DBAI-TR-2008-59). http://hdl.handle.net/20.500.12708/35162 ( reposiTUm)

Egly, U., Gaggl, S. A., & Woltran, S. (2008). Answer-Set Programming Encodings for Argumentation Frameworks (DBAI-TR-2008-62). http://hdl.handle.net/20.500.12708/35164 ( reposiTUm)

Besnard, P., Hunter, A., & Woltran, S. (2008). Encoding Deductive Argumentation in Quantified Boolean Formulae (DBAI-TR-2008-60). http://hdl.handle.net/20.500.12708/35163 ( reposiTUm)

Truszczynski, M., & Woltran, S. (2008). Relativized Hyperequivalence of Logic Programs for Modular Programming (DBAI-TR-2008-63). http://hdl.handle.net/20.500.12708/35165 ( reposiTUm)

Egly, U., Seidl, M., & Woltran, S. (2008). A Solver for QBFs in Negation Normal Form (INFSYS RR-1843-08-03). http://hdl.handle.net/20.500.12708/35354 ( reposiTUm)

Jakl, M., Pichler, R., Rümmele, S., & Woltran, S. (2008). Fast Counting with Bounded Treewidth (DBAI-TR-2008-61). http://hdl.handle.net/20.500.12708/35325 ( reposiTUm)

Pearce, D., Tompits, H., & Woltran, S. (2007). Characterising Equilibrium Logic and Nested Logic Programs: Reductions and Complexity (GIA-TR-2007-12-01). http://hdl.handle.net/20.500.12708/33090 ( reposiTUm)

Eiter, T., Fink, M., & Woltran, S. (2005). Semantical Characterizations and Complexity of Equivalences in Answer Set Programming. http://hdl.handle.net/20.500.12708/33032 ( reposiTUm)

Eiter, T., Faber, W., Pfeifer, G., Fink, M., & Woltran, S. (2003). Complexity of Answer Set Checking and Bounded Predicate Arities for Non-Ground Answer Set Programming. http://hdl.handle.net/20.500.12708/32930 ( reposiTUm)

Eiter, T., Fink, M., Tompits, H., & Woltran, S. (2003). On Eliminating Disjunctions in Stable Logic Programming. http://hdl.handle.net/20.500.12708/32929 ( reposiTUm)

Egly, U., Pichler, R., & Woltran, S. (2003). On Deciding Subsumption Problems. http://hdl.handle.net/20.500.12708/32928 ( reposiTUm)

Delgrande, J. P., Schaub, T., Tompits, H., & Woltran, S. (2003). On Computing Solutions to Belief Change Scenarios. http://hdl.handle.net/20.500.12708/32927 ( reposiTUm)

Eiter, T., Faber, W., Fink, M., Woltran, S., & Zalewska, L. (2003). Methods for data acquisition and transformation. http://hdl.handle.net/20.500.12708/32954 ( reposiTUm)

Pearce, D., Schaub, T., Sarsakov, V., Tompits, H., & Woltran, S. (2002). Polynomial Translations of Nested Logic Programs into Disjunctive Logic Programs. http://hdl.handle.net/20.500.12708/32790 ( reposiTUm)

Preprints

Nöllenburg, M., Pirker, C., Rapberger, A., Woltran, S., & Wulms, J. (2024). Visualizing Extensions of Argumentation Frameworks as Layered Graphs. arXiv. https://doi.org/10.48550/arXiv.2409.05457 ( reposiTUm)

Pichler, R., Rümmele, S., Szeider, S., & Woltran, S. (2012). Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough. CoRR - Computing Research Repository. https://doi.org/10.48550/arXiv.1204.3040 ( reposiTUm)

Spezialbeiträge

Eiter, T., & Woltran, S. (2024, March 1). Künstliche Intelligenz ist mehr als CHATGPT. Bulletin. Alumni-Magazin der TU Wien, 56, 4–5. https://doi.org/10.34726/8422 ( reposiTUm)

Hochschulschriften

Woltran, S. (2008). Contributions to advanced equivalence checking in answer set programming [Professorial Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/181446 ( reposiTUm)

Woltran, S. (2003). Quantified Boolean formulas - from theory to practice [Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/183034 ( reposiTUm)

Woltran, S. (2000). A framework for solving advanced reasoning tasks [Diploma Thesis, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/183916 ( reposiTUm)