TU Wien Informatics

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

Stefan Woltran

Univ.Prof. Dipl.-Ing. Dr.techn.

Research Focus

  • Logic and Computation: 100%

Research Areas

  • Propositional Logic, Nonmonotonic Reasoning, Argumentation, Knowledge Representation, Logic Programming
Stefan Woltran

About

Basic Research in Artificial Intelligence - Analysis for formal properties of different logic-based approaches to AI - Complexty Analysis - Development of algorithms (in particular via logic- and dynamic programming)

Roles

Contact

2024W

2025S

 

2024

2023

  • Constrained Derivation in Assumption-Based Argumentation / 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
    Download: PDF (1.16 MB)
    Project: REVEAL-AI (2020–2024)
  • A claim-centric perspective on abstract argumentation semantics: Claim-defeat, principles, and expressiveness / 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
    Download: PDF (1.17 MB)
    Project: REVEAL-AI (2020–2024)
  • Sets Attacking Sets in Abstract Argumentation / 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
    Download: PDF (1.39 MB)
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)
  • Grounding Planning Tasks Using Tree Decompositions and Iterated Solving / 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
    Download: All rights reserved (174 KB)
    Projects: DK - Logic (2014–2023) / HYPAR (2019–2024) / HyperTrac (2018–2022) / REVEAL-AI (2020–2024)
  • The Effect of Preferences in Abstract Argumentation under a Claim-Centric View / 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
    Download: All rights reserved (141 KB)
    Projects: DK - Logic (2014–2023) / REVEAL-AI (2020–2024) / START (2014–2022)
  • The complexity landscape of claim-augmented argumentation frameworks / 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
    Download: Paper (1.12 MB)
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)
  • Solving Projected Model Counting by Utilizing Treewidth and its Limits / 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
    Project: HYPAR (2019–2024)
  • On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth / 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
    Download: PDF (385 KB)
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)
  • Expressiveness of SETAFs and support-free ADFs under 3-valued semantics / 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
  • Abstract argumentation with conditional preferences / Bernreiter, M., Dvořák, W., & Woltran, S. (2023). Abstract argumentation with conditional preferences. Argument & Computation, 1–29. https://doi.org/10.34726/5479
    Download: PDF (633 KB)
    Projects: HYPAR (2019–2024) / REVEAL-AI (2020–2024)
  • Foundations for Projecting Away the Irrelevant in ASP Programs / 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

2022

2021

  • ASPARTIX-V - A Solver for Argumentation Tasks Using ASP / Dvorak, W., König, M., Rapberger, A., Wallner, J. P., & Woltran, S. (2021). ASPARTIX-V - A Solver for Argumentation Tasks Using ASP. ASPOCP 2021 - 14th Workshop on Answer Set Programming and Other Computing Paradigms, Porto, Portugal. http://hdl.handle.net/20.500.12708/87227
  • On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length / Dvořák, W., König, M., & Woltran, S. (2021). On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length. In Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning. KR 2021 - 18th International Conference on Principles of Knowledge Representation and Reasoning, virtual event, Unknown. https://doi.org/10.24963/kr.2021/67
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • The Complexity Landscape of Claim-Augmented Argumentation Frameworks / Dvorak, W., Greßler, A., Rapberger, A., & Woltran, S. (2021). The Complexity Landscape of Claim-Augmented Argumentation Frameworks. In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021 (pp. 6296–6303). http://hdl.handle.net/20.500.12708/58525
  • Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility / Dvořák, W., Ulbricht, M., & Woltran, S. (2021). Recursion in Abstract Argumentation is Hard  ---  On the Complexity of Semantics Based on Weak Admissibility. In 35th AAAI Conference on Artificial Intelligence (pp. 6288–6295). http://hdl.handle.net/20.500.12708/58530
    Project: START (2014–2022)
  • A Reduct-Driven Study of Argumentation Frameworks With Collective Attacks / Dvorak, W., König, M., Ulbricht, M., & Woltran, S. (2021). A Reduct-Driven Study of Argumentation Frameworks With Collective Attacks. NMR 2021 - 19th International Workshop on Non-Monotonic Reasoning, Hanoi, Vietnam, Viet Nam. http://hdl.handle.net/20.500.12708/87225
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • Choice Logics and Their Computational Properties / 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
    Project: START (2014–2022)
  • Beyond Uniform Equivalence between Answer-set Programs / 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
  • Exploiting Database Management Systems and Treewidth for Counting / 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
    Project: START (2014–2022)
  • DynASP2.5: Dynamic Programming on Tree Decompositions in Action / 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
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • Preface / BALDUCCINI, M., LIERLER, Y., & WOLTRAN, S. (2021). Preface. Theory and Practice of Logic Programming, 21(3), 293–295. https://doi.org/10.1017/s1471068420000484
  • Graph-Classes of Argumentation Frameworks with Collective Attacks / Dvořák, W., König, M., & Woltran, S. (2021). Graph-Classes of Argumentation Frameworks with Collective Attacks. In Logics in Artificial Intelligence (pp. 3–17). https://doi.org/10.1007/978-3-030-75775-5_1
    Projects: HYPAR (2019–2024) / START (2014–2022)

2020

2019

  • Preface / 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
  • Pruning External Minimality Checking for ASP Using Semantic Dependencies / 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
    Download: PDF (418 KB)
    Project: IE of ASP (2015–2018)
  • Multi-valued GRAPPA / 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
    Project: GRAPPA (2016–2019)
  • Strong Equivalence for Argumentation Frameworks with Collective Attacks / 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
    Project: GRAPPA (2016–2019)
  • Degrees of Laziness in Grounding / 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
    Project: DynaCon (2017–2020)
  • Treewidth and Counting Projected Answer Sets / 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
    Project: START (2014–2022)
  • Belief Revision Operators with Varying Attitudes Towards Initial Beliefs / 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
    Project: START (2014–2022)
  • Forgetting in Modular Answer Set Programming / 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
    Project: START (2014–2022)
  • Strong Equivalence for Epistemic Logic Programs Made Easy / 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
    Project: START (2014–2022)
  • Complexity of Abstract Argumentation under a Claim-Centric View / 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
    Projects: GRAPPA (2016–2019) / START (2014–2022)
  • Aggregating Expert Opinions in Support of Medical Diagnostic Decision-Making / 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
    Projects: START (2014–2022) / SuDeMa (2019–2025)
  • Preprocessing Argumentation Frameworks via Replacement Patterns / 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
    Project: GRAPPA (2016–2019)
  • Expansion-based QBF Solving on Tree Decompositions / 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
    Project: START (2014–2022)
  • A Multiparametric View on Answer Set Programming / 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
  • On Uniform Equivalence of Epistemic Logic Programs / 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
  • A general notion of equivalence for abstract argumentation / 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
    Projects: GRAPPA (2016–2019) / START (2014–2022)
  • Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? / Maly, J., Truszczyń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
  • On the expressive power of collective attacks / 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
    Project: GRAPPA (2016–2019)
  • Symbolische KI - Good Old Fashioned oder Haute Couture / Woltran, S. (2019). Symbolische KI - Good Old Fashioned oder Haute Couture. OCG Jahresopening 2019, Wien, Austria. http://hdl.handle.net/20.500.12708/86940
  • Preference Orders on Families of Sets -- Complexity and Characterization Results / 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
  • Symbolische KI - Good Old Fashioned oder Haute Couture / Woltran, S. (2019). Symbolische KI - Good Old Fashioned oder Haute Couture. Ai / Imagine19, Wien, Austria. http://hdl.handle.net/20.500.12708/86932
  • Structural Decompositions of Epistemic Logic Programs / 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
  • Logic Programming and Nonmonotonic Reasoning / 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

2018

  • Defensive alliances in graphs of bounded treewidth / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • An extension-based approach to belief revision in abstract argumentation / 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
    Projects: FAIR (2013–2018) / GRAPPA (2016–2019) / START (2014–2022)
  • Two sides of the same coin: Belief revision and enforcing arguments / 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
    Download: PDF (410 KB)
  • Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving / 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
    Download: PDF (548 KB)
  • Investigating Subclasses of Abstract Dialectical Frameworks / 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
    Project: GRAPPA (2016–2019)
  • Abstract Solvers for Dung's Argumentation Frameworks / 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
    Project: GRAPPA (2016–2019)
  • Summary Report of the Second International Competition on Computational Models of Argumentation / 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
    Project: GRAPPA (2016–2019)
  • Answer set programming unleashed! / 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
    Project: START (2014–2022)
  • Dynamic Programming on Tree Decompositions with {D-FLAT} / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Abstract Dialectical Frameworks / 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
    Projects: Belief Change (2013–2017) / GRAPPA (2016–2019)
  • On the Expressive Power of Collective Attacks / Dvorak, W., Woltran, S., & Fandinno, J. (2018). On the Expressive Power of Collective Attacks. In 7th International Conference on Computational Models of Argument (pp. 1–27). IOS Press. http://hdl.handle.net/20.500.12708/57485
    Project: GRAPPA (2016–2019)
  • Evaluating SETAFs via Answer-Set Programming / Dvorak, W., Woltran, S., & Gressler, A. (2018). Evaluating SETAFs via Answer-Set Programming. In 2nd International Workshop on Systems and Algorithms for Formal Argumentation (pp. 10–21). CEUR-WS.org. http://hdl.handle.net/20.500.12708/57479
    Projects: GRAPPA (2016–2019) / START (2014–2022)
  • ASP Programs with Groundings of Small Treewidth / 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
    Project: START (2014–2022)
  • Equivalence between answer-set programs under (partially) fixed input / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Weighted Model Counting on the GPU by Exploiting Small Treewidth / 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
    Project: START (2014–2022)
  • Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? / 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
    Projects: FAIR (2013–2018) / START (2014–2022)
  • Special Issue on Computational Logic in Multi-Agent Systems (CLIMA XIV) / 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
  • General Belief Revision / 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
    Projects: Belief Change (2013–2017) / START (2014–2022)
  • Complexity of Secure Sets / Bliem, B., & Woltran, S. (2018). Complexity of Secure Sets. Algorithmica, 80(10), 2909–2940. https://doi.org/10.1007/s00453-017-0358-5
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Special Issue on Answer Set Programming / Schaub, T., & Woltran, S. (2018). Special Issue on Answer Set Programming. KI - Künstliche Intelligenz, 32(2–3), 101–103. https://doi.org/10.1007/s13218-018-0554-8
  • Expressibility of Argumentation Frameworks and its Relation to the Dynamics of Argumentation / Woltran, S. (2018). Expressibility of Argumentation Frameworks and its Relation to the Dynamics of Argumentation. AMANDE Workshop, Toulouse, Frankreich, EU. http://hdl.handle.net/20.500.12708/86807
  • Solving (Q)SAT Problems via Tree Decomposition and Dynamic Programming / Woltran, S. (2018). Solving (Q)SAT Problems via Tree Decomposition and Dynamic Programming. JFPC (Journées Francophones de Programmation par Contraintes), Amiens, Frankreich, EU. http://hdl.handle.net/20.500.12708/86806
  • Foundations of Information and Knowledge Systems / Ferrarotti, F., & Woltran, S. (Eds.). (2018). Foundations of Information and Knowledge Systems. Springer Cham. https://doi.org/10.1007/978-3-319-90050-6
  • Belief Update in the Horn Fragment / 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, EU. ijcai.org. https://doi.org/10.24963/ijcai.2018/246
  • A New Logic for Jointly Representing Hard and Soft Constraints / 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
    Project: START (2014–2022)
  • Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? / 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, EU. ijcai.org. https://doi.org/10.24963/ijcai.2018/60
    Project: START (2014–2022)
  • Single-Shot Epistemic Logic Program Solving / 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, EU. ijcai.org. https://doi.org/10.24963/ijcai.2018/237
    Project: START (2014–2022)
  • Exploiting Treewidth for Projected Model Counting and Its Limits / 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
    Projects: FAIR (2013–2018) / START (2014–2022)
  • Belief Revision Operators with Varying Attitudes Towards Initial Beliefs / 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
  • Application of ASP in formal argumentation / Dvorak, W., Pührer, J., Wallner, J. P., Woltran, S., & Diller, M. (2018). Application of ASP in formal argumentation. In 2nd Workshop on Trends and Applications of Answer Set Programming (TAASP 2018) (pp. 1–11). http://hdl.handle.net/20.500.12708/57477
    Projects: GRAPPA (2016–2019) / START (2014–2022)
  • A Single-Shot Epistemic Logic Program Solver / 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
    Project: START (2014–2022)
  • Weighted Abstract Dialectical Frameworks / 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
    Project: GRAPPA (2016–2019)
  • Variable Elimination for DLP-Functions / 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
    Project: START (2014–2022)

2017

  • htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond / 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
    Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022)
  • When you must forget: Beyond strong persistence when forgetting in answer set programming / 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
    Projects: Belief Change (2013–2017) / START (2014–2022)
  • Expansion-based (QBF) Solving on Tree Decompositions / 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
    Project: START (2014–2022)
  • Abstract Dialectical Frameworks. An Overview / 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
    Download: PDF (683 KB)
  • Ranking Specific Sets of Objects / 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
    Projects: GRAPPA (2016–2019) / HINT (2012–2017) / START (2014–2022)
  • The Impact of Treewidth on {ASP} Grounding and Solving / 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
    Project: START (2014–2022)
  • A Multiparametric View on Answer Set Programming / 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
    Project: START (2014–2022)
  • DynASP2.5: Dynamic Programming on Tree Decompositions in Action / 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
    Project: START (2014–2022)
  • Merging in the Horn Fragment / 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
    Projects: Belief Change (2013–2017) / FAIR (2013–2018)
  • Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning / 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
    Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022)
  • Ranking Specific Sets of Objects / 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
    Projects: GRAPPA (2016–2019) / HINT (2012–2017) / START (2014–2022)
  • Implementing Courcelle's Theorem in a declarative framework for dynamic programming / 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
    Projects: D-Flat (2013–2017) / FAIR (2013–2018)
  • Solving Advanced Argumentation Problems with Answer-Set Programming / 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
    Project: GRAPPA (2016–2019)
  • Deviation in Belief Change on Fragments of Propositional Logic / 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
    Project: Belief Change (2013–2017)
  • The Impact of Treewidth on ASP Grounding and Solving / 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, Non-EU. AAAI Press. https://doi.org/10.24963/ijcai.2017/118
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • lpopt: A Rule Optimization Tool for Answer Set Programming / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Towards Preprocessing for Abstract Argumentation Frameworks / 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
    Project: GRAPPA (2016–2019)
  • On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks / 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, Non-EU. https://doi.org/10.24963/ijcai.2017/159
    Projects: FAIR (2013–2018) / GRAPPA (2016–2019) / HINT (2012–2017)
  • Answer Set Solving with Bounded Treewidth Revisited / 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
  • A General Notion of Equivalence for Abstract Argumentation / Dvorak, W., Linsbichler, T., Woltran, S., & Baumann, R. (2017). A General Notion of Equivalence for Abstract Argumentation. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, Australia, Non-EU. https://doi.org/10.24963/ijcai.2017/111
    Project: GRAPPA (2016–2019)

2016

  • Equivalence Between Answer-Set Programs Under (Partially) Fixed Input / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Introducing the Second International Competition on Computational Models of Argumentation / 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
  • ASP for Anytime Dynamic Programming on Tree Decompositions (Extended Abstract) / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Investigating the relationship between argumentation semantics via signatures / 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
  • Providing Built-In Counters in a Declarative Dynamic Programming Environment / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Clique-Width and Directed Width Measures for Answer-Set Programming / 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
    Project: START (2014–2022)
  • Beyond IC Postulates: Classification Criteria for Merging Operators / 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
    Project: FAIR (2013–2018)
  • Dynamic Programming-based QBF Solving / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Counting Answer Sets via Dynamic Programming / 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
    Project: START (2014–2022)
  • Clique-Width and Directed Width Measures for Answer-Set Programming / 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
    Project: START (2014–2022)
  • Revision of abstract dialectical frameworks: Preliminary report / 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
  • On rejected arguments and implicit conflicts: The hidden power of argumentation semantics / 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
  • The role of self-attacking arguments in characterizations of equivalence notions / 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
  • Shift Design with Answer Set Programming / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • The Power of Non-Ground Rules in Answer Set Programming / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Belief Merging within Fragments of Propositional Logic / 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
    Project: FAIR (2013–2018)
  • Dynamic Programming on Tree Decompositions in Practice / 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
    Project: START (2014–2022)
  • Grappavis - A system for advanced graph-based argumentation / 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
    Project: START (2014–2022)
  • Verifiability of argumentation semantics / 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
  • Translation-Based Revision and Merging for Minimal Horn Reasoning / 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
  • Towards advanced systems for abstract argumentation / 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
  • lpopt: A Rule Optimization Tool for Answer Set Programming / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Distributing Knowledge Into Simple Bases / 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
  • Investigating the relationship between argumentation semantics via signature / 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
  • Merging of Abstract Argumentation Frameworks / 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
  • On the functional completeness of argumentation semantics / 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
  • Distributing Knowledge Into Simple Bases / 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
  • Verifiability of argumentation semantics / 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
  • Complexity of Secure Sets / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • ASP for Anytime Dynamic Programming on Tree Decompositions / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Subset Minimization in Dynamic Programming on Tree Decompositions / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Answer Set Solving using Tree Decompositions and Dynamic Programming -- The DynASP2 System / 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
    Project: START (2014–2022)
  • Multiparametric View on Answer Set Programming / 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
    Project: START (2014–2022)
  • Treewidth-Preserving Modeling in ASP / 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
    Project: START (2014–2022)
  • htd -- A Free, Open-Source Framework for Tree Decompositions and Beyond / 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
    Project: START (2014–2022)
  • BDD-based Dynamic Programming on Tree Decompositions / 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
    Project: START (2014–2022)
  • Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning / 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
    Project: START (2014–2022)

2015

  • The complexity of handling minimal solutions in logic-based abduction / 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
    Project: FAIR (2013–2018)
  • Dual-normal logic programs - the forgotten class / 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
    Project: START (2014–2022)
  • Improved answer-set programming encodings for abstract argumentation / 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
    Project: START (2014–2022)
  • Characteristics of multiple viewpoints in abstract argumentation / 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
  • Abstract Solvers for Dung’s Argumentation Frameworks / 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
  • Shift Design with Answer Set Programming / 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
    Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022)
  • D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract) / 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
  • Reduction-Based Approaches to Implement Modgil’s Extended Argumentation Frameworks / 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
  • A Glimpse on Gerhard Brewka's Contributions to Artificial Intelligence / 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
  • Infinite Argumentation Frameworks / 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
  • Preference-Based Diagnosis Selection in Multi-Context Systems / 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
  • Characteristics of Multiple Viewpoints in Abstract Argumentation / 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
  • Methods for solving reasoning problems in abstract argumentation - A survey / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Reasoning in Abstract Dialectical Frameworks using Quantified Boolean Formulas / 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
  • Applications of logical approaches to argumentation / 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
  • Dynamic Programming on Tree Decomposition in Practice. Some Lessons Learned / 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
  • The Hidden Power of Abstract Argumentation Semantics / 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
  • On the Functional Completeness of Argumentation Semantics / 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
  • Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning / 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
    Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022)
  • Merging in the Horn Fragment / 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
  • An extension-based approach to belief revision in abstract argumentation / 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
  • Shift Design with Answer Set Programming / 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
    Projects: ARTE (2012–2017) / D-Flat (2013–2017) / START (2014–2022)
  • Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • On the Parameterized Complexity of Belief Revision / 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
    Projects: FAIR (2013–2018) / START (2014–2022)
  • D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation / 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

2014

  • Generalizations of Dung Frameworks and Their Role in Formal Argumentation / 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
  • Belief revision within fragments of propositional logic / 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
  • Probabilistic Argumentation Frameworks – A Logical Approach / 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
  • Complexity-Sensitive Decision Procedures for Abstract Argumentation / 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
  • Characteristics of Multiple Viewpoints in Abstract Argumentation / 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
  • Resolution-Based Grounded Semantics Revisited / 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
  • Compact Argumentation Frameworks / 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
  • Compact Argumentation Frameworks / 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
  • Complexity of super-coherence problems in ASP / 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
  • Comparing the Power of Different Semantics for Abstract Argumentation / 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
  • Abstract Argumentation - All Problems Solved? / 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
  • Computing Secure Sets in Graphs using Answer Set Programming. / 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
    Project: D-Flat (2013–2017)
  • The D-FLAT System for Dynamic Programming on Tree Decompositions / 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
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas / 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
  • Belief merging within fragments of propositional logic / 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
  • Belief merging within fragments of propositional logic / 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
  • GRAPPA: A Semantical Framework for Graph-Based Argument Processing / 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
  • An Introduction to Abstract Argumentation / 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
  • D-FLAT: Progress Report / 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
    Project: D-Flat (2013–2017)
  • Graph Structures for Knowledge Representation and Reasoning / 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

2013

  • Advanced SAT Techniques for Abstract Argumentation / 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
  • Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems / 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
  • Admissibility in the Abstract Dialectical Framework / 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
  • The cf2 argumentation semantics revisited. / 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
  • Parametric Properties of Ideal Semantics / 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
  • A Model-Theoretic Approach to Belief Change in Answer Set Programming / 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
    Project: Methods (2009–2013)
  • ARVis: Visualizing Relations between Answer Sets / 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
  • Characteristics of Multiple Viewpoints in Abstract Argumentation / 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
  • Strong Equivalence of Qualitative Optimization Problems / 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
  • Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence / 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
  • Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries / 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
    Projects: SODI (2009–2013) / TTPC (2008–2012)
  • Model-Based Recasting in Answer-Set Programming / 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
  • On the Limits of Expressiveness in Abstract Argumentation Semantics / 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
  • Applicability of ASP-based Problem Solving on Tree Decompositions / 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
    Projects: D-Flat (2013–2017) / FAIR (2013–2018)
  • Structural Properties for Deductive Argument Systems / 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
  • Abstract Dialectical Frameworks Revisited / 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
    Project: FAIR (2013–2018)
  • Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem / 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
    Project: D-Flat (2013–2017)
  • Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? / 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
    Project: FAIR (2013–2018)
  • AGM-Style Belief Revision of Logic Programs under Answer Set Semantics / 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
  • Model-Based Recasting in Answer-Set Programming / 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
  • Computational Logic in Multi-Agent Systems / 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

2012

  • Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough / 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
    Project: Complex Reason (2010–2014)
  • Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough / 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
    Project: TTPC (2008–2012)
  • Comparing the Expressiveness of Argumentation Semantics / 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
    Project: Argu (2009–2012)
  • Parameterized Splitting: A Simple Modification-Based Approach / 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
    Project: Argu (2009–2012)
  • Abstract Argumentation via Monadic Second Order Logic / 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
    Projects: Argu (2009–2012) / Complex Reason (2010–2014)
  • Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming / 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
  • D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming / 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
    Project: D-Flat (2013–2017)
  • Towards fixed-parameter tractable algorithms for abstract argumentation / 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
    Projects: Argu (2009–2012) / SODI (2009–2013) / TTPC (2008–2012)
  • The Added Value of Argumentation / 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
  • Utilizing ASP for Generating and Visualizing Argumentation Frameworks / 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
  • Strong Equivalence of Qualitative Optimization Problems / 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
  • CEGARTIX: A SAT-Based Argumentation System / 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
  • Characteristics of Argumentation Semantics / Woltran, S. (2012). Characteristics of Argumentation Semantics. Logique à Marseille -- Camilla Schwind à l’honneur, Marseille, EU. http://hdl.handle.net/20.500.12708/85463
  • dynPARTIX 2.0 - Dynamic Programming Argumentation Reasoning Tool / 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
    Project: Argu (2009–2012)
  • Preprocessing of Complex Non-Ground Rules in Answer Set Programming / 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
  • Complexity of logic-based argumentation in Schaefer's framework / 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
    Project: Boolean (2011–2019)
  • Valued-Based Argumentation for Tree-like Value Graphs / 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
    Projects: Complex Reason (2010–2014) / Complexity (2011–2013)
  • Evaluating Abstract Dialectical Frameworks with ASP / 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
  • Multicut on Graphs of Bounded Clique-Width / 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
    Project: TTPC (2008–2012)
  • Computational Aspects of cf2 and stage2 Argumentation Semantics. / 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
  • Incorporating Stage Semantics in the SCC-recursive Schema for Argumentation Semantics. / 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
    Project: Argu (2009–2012)
  • Complexity-Sensitive Decision Procedures for Abstract Argumentation / 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
    Project: Argu (2009–2012)
  • Belief Revision within Fragments of Propositional Logic / 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
    Project: TTPC (2008–2012)
  • The cf2 Argumentation Semantics Revisited. / Gaggl, S., & Woltran, S. (2012). The cf2 Argumentation Semantics Revisited. (DBAI-TR-2012-77). http://hdl.handle.net/20.500.12708/37419
    Project: Argu (2009–2012)
  • Abstract Argumentation via Monadic Second Order Logic. / 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
    Projects: Argu (2009–2012) / Complex Reason (2010–2014)
  • Fourth International Conference on Computational Models of Argument (COMMA 2012) / 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
    Project: Complex Reason (2010–2014)

2011

2010

  • Multicut Algorithms via Tree Decompositions / 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
    Projects: Argu (2009–2012) / TTPC (2008–2012)
  • Complexity of semi-stable and stage semantics in argumentation frameworks / 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
    Project: Argu (2009–2012)
  • Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries / 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
  • Minimising RDF Graphs under Rules and Constraints Revisited / 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
  • Answer-Set Programming Encodings for Argumentation Frameworks / 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
    Projects: Argu (2009–2012) / TTPC (2008–2012)
  • Strong Equivalence in Argumentation / 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
  • Computational Aspects of Abstract Argumentation / 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
  • Deciding Equivalence between Extended Datalog Programs. A Brief Survey / 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
  • Sets of Boolean Connectives That Make Argumentation Easier / 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
  • An Optimization for Reasoning with Forest Logic Programs / 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
  • Representing Preferences Among Sets / 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
  • The Complexity of Handling Minimal Solutions in Logic-Based Abduction / 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
  • A Dynamic-Programming Based ASP-Solver / 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
  • Counting and Enumeration Problems with Bounded Treewidth / 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
  • Decentralized Diagnosis: Complexity Analysis and Datalog Encodings / 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
  • cf2 Semantics Revisited / 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
    Project: Argu (2009–2012)
  • Reasoning in Argumentation Frameworks of Bounded Clique-Width / 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
    Projects: Argu (2009–2012) / Complex Reason (2010–2014)
  • Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough / 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
    Projects: Argu (2009–2012) / Complex Reason (2010–2014)
  • Towards Fixed-Parameter Tractable Algorithms for Argumentation / 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
    Projects: Argu (2009–2012) / TTPC (2008–2012)
  • Abstract Dialectical Frameworks / 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
    Project: Argu (2009–2012)
  • Characterizing Strong Equivalence for Argumentation Frameworks / 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
    Project: Argu (2009–2012)
  • On the Intertranslatability of Argumentation Semantics / 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
    Project: Argu (2009–2012)

2009

  • spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics / 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
  • A Solver for QBFs in Negation Normal Form / 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
  • Encoding deductive argumentation in quantified Boolean formulae / 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
    Project: Argu (2009–2012)
  • Modularity Aspects of Disjunctive Stable Models / 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
  • Characterising Equilibrium Logic and Nested Logic Programs: Reductions and Complexity / 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
  • Hyperequivalence of logic programs with respect to supported models / 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
  • Relativized hyperequivalence of logic programs for modular programming / 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
  • Manifold Answer-Set Programs for Meta-reasoning / 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
    Projects: Argu (2009–2012) / TTPC (2008–2012)
  • Belief Revision with Bounded Treewidth / 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
    Project: TTPC (2008–2012)
  • ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions / 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
    Project: Methods (2009–2013)
  • A Framework for Programming with Module Consequences / 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
    Projects: Argu (2009–2012) / TTPC (2008–2012)
  • Manifold Answer-Set Programs for Meta-Reasoning / 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
    Projects: Argu (2009–2012) / TTPC (2008–2012)
  • Alternation as a programming paradigm / Dvořák, W., Gottlob, G., Pichler, R., & Woltran, S. (2009). Alternation as a programming paradigm. In A. Porto & F. J. Lopez-Fraguas (Eds.), Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming - PPDP ’09. ACM Press. https://doi.org/10.1145/1599410.1599419
    Project: TTPC (2008–2012)
  • Characterizing Strong Equivalence for Argumentation Frameworks / Woltran, S. (2009). Characterizing Strong Equivalence for Argumentation Frameworks. Argumentation Christmas Meeting, Leipzig, EU. http://hdl.handle.net/20.500.12708/84908
  • Merging Logic Programs under Answer Set Semantics / 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
    Project: TTPC (2008–2012)
  • Belief Revision with Bounded Treewidth / 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
  • Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT / 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
  • Answer-Set Programming with Bounded Tree Width / 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
    Project: TTPC (2008–2012)
  • Technical Note: Complexity of Stage Semantics in Argumentation Frameworks / Dvorak, W., & Woltran, S. (2009). Technical Note: Complexity of Stage Semantics in Argumentation Frameworks (DBAI-TR-2009-66). http://hdl.handle.net/20.500.12708/35719
    Project: Argu (2009–2012)
  • Alternation as a Programming Paradigm / Dvorak, W., Gottlob, G., Pichler, R., & Woltran, S. (2009). Alternation as a Programming Paradigm (DBAI-TR-2009-64). http://hdl.handle.net/20.500.12708/35631

2008

2007

2006

2005

2004

2003

2002

 

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

 

  • EurAI Fellows programme
    2018 / EurAI Fellow / Website
  • Treating Hard Problems with Decomposition and Dynamic Programming (Decodyn)
    2014 / START-Programm / Austria / Website / Project
  • Distinguished student paper prize at the 13th International Conference on Principles of Knowledge Representation and Reasoning.
    2012 / KR Inc
  • OCG-Förderpreis
    2002 / Austria

Soon, this page will include additional information such as reference projects, activities as journal reviewer and editor, memberships in councils and committees, and other research activities.

Until then, please visit Stefan Woltran’s research profile in TISS .