iBet uBet web content aggregator. Adding the entire web to your favor.

Link to original content: https://dblp.org/pid/39/6130.xml

Stefan Woltran TU Wien, Vienna, Autria http://www.dbai.tuwien.ac.at/staff/woltran/ https://orcid.org/0000-0003-1594-8972

Michael Bernreiter Wolfgang Dvorák Stefan Woltran Abstract argumentation with conditional preferences. 161-189 2024 15 Argument Comput. 2 https://doi.org/10.3233/AAC-230001 db/journals/argcom/argcom15.html#BernreiterDW24 streams/journals/argcom

Wolfgang Dvorák Matthias König 0002 Markus Ulbricht 0001 Stefan Woltran Principles and their Computational Consequences for Argumentation Frameworks with Collective Attacks. 69-136 2024 79 J. Artif. Intell. Res. https://doi.org/10.1613/jair.1.14879 db/journals/jair/jair79.html#DvorakKUW24

Michael Bernreiter Wolfgang Dvorák Anna Rapberger Stefan Woltran The Effect of Preferences in Abstract Argumentation under a Claim-Centric View. 203-262 2024 81 J. Artif. Intell. Res. https://doi.org/10.1613/jair.1.15932 db/journals/jair/jair81.html#BernreiterDRW24 streams/journals/jair

Michael Bernreiter Anela Lolic Jan Maly 0001 Stefan Woltran Sequent Calculi for Choice Logics. 8 2024 June 68 J. Autom. Reason. 2 https://doi.org/10.1007/s10817-024-09695-5 db/journals/jar/jar68.html#BernreiterLMW24

Yannis Dimopoulos Wolfgang Dvorák Matthias König 0002 Anna Rapberger Markus Ulbricht 0001 Stefan Woltran Redefining ABA+ Semantics via Abstract Set-to-Set Attacks. 10493-10500 2024 AAAI https://doi.org/10.1609/aaai.v38i9.28918 conf/aaai/2024 db/conf/aaai/aaai2024.html#DimopoulosD0R0W24 Zeynep G. Saribatur Stefan Woltran A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming. 10687-10695 2024 AAAI https://doi.org/10.1609/aaai.v38i9.28940 conf/aaai/2024 db/conf/aaai/aaai2024.html#SaribaturW24 Michael Bernreiter Jan Maly 0001 Oliviero Nardi Stefan Woltran Combining Voting and Abstract Argumentation to Understand Online Discussions. 170-179 2024 AAMAS https://dl.acm.org/doi/10.5555/3635637.3662864 conf/atal/2024 db/conf/atal/aamas2024.html#Bernreiter0NW24 Giovanni Buraglio Wolfgang Dvorák Matthias König 0002 Stefan Woltran Splitting Argumentation Frameworks with Collective Attacks. 41-55 2024 SAFA@COMMA https://ceur-ws.org/Vol-3757/paper3.pdf conf/comma/2024safa db/conf/comma/safa2024.html#BuraglioD0W24 Alexander Greßler Wolfgang Dvorák Stefan Woltran The GSAF Solver and Verifier. 353-354 2024 COMMA https://doi.org/10.3233/FAIA240336 conf/comma/2024 db/conf/comma/comma2024.html#GresslerDW24 Giovanni Buraglio Wolfgang Dvorák Anna Rapberger Stefan Woltran Constrained Derivation in Assumption-Based Argumentation. 340-359 2024 FoIKS https://doi.org/10.1007/978-3-031-56940-1_19 conf/foiks/2024 db/conf/foiks/foiks2024.html#BuraglioDRW24 Alexander Beiser Markus Hecher Kaan Unalan Stefan Woltran Bypassing the ASP Bottleneck: Hybrid Grounding by Splitting and Rewriting. 3250-3258 2024 IJCAI https://www.ijcai.org/proceedings/2024/360 conf/ijcai/2024 db/conf/ijcai/ijcai2024.html#BeiserHUW24 Thomas Eiter Johannes Klaus Fichte Markus Hecher Stefan Woltran Epistemic Logic Programs: Non-Ground and Counting Complexity. 3333-3341 2024 IJCAI https://www.ijcai.org/proceedings/2024/369 conf/ijcai/2024 db/conf/ijcai/ijcai2024.html#EiterFHW24 Wolfgang Dvorák Alexander Greßler Stefan Woltran Equipping Abstract Argumentation Solvers for Verifying Negative Results. 762-769 2024 SAC https://doi.org/10.1145/3605098.3636073 conf/sac/2024 db/conf/sac/sac2024.html#DvorakGW24 Michael Bernreiter Jan Maly 0001 Oliviero Nardi Stefan Woltran Supplementary Material for "Combining Voting and Abstract Argumentation to Understand Online Discussions". 2024 January https://doi.org/10.5281/zenodo.10571625 Zenodo streams/repo/zenodo

Michael Bernreiter Jan Maly 0001 Oliviero Nardi Stefan Woltran Combining Voting and Abstract Argumentation to Understand Online Discussions. 2024 abs/2402.05895 CoRR https://doi.org/10.48550/arXiv.2402.05895 db/journals/corr/corr2402.html#abs-2402-05895

Martin Nöllenburg Christian Pirker Anna Rapberger Stefan Woltran Jules Wulms Visualizing Extensions of Argumentation Frameworks as Layered Graphs. 2024 abs/2409.05457 CoRR https://doi.org/10.48550/arXiv.2409.05457 db/journals/corr/corr2409.html#abs-2409-05457 streams/journals/corr

Johannes Klaus Fichte Markus Hecher Michael Morak Patrick Thier Stefan Woltran Solving Projected Model Counting by Utilizing Treewidth and its Limits. 103810 2023 314 Artif. Intell. https://doi.org/10.1016/j.artint.2022.103810 db/journals/ai/ai314.html#FichteHMTW23

Wolfgang Dvorák Alexander Greßler Anna Rapberger Stefan Woltran The complexity landscape of claim-augmented argumentation frameworks. 103873 2023 April 317 Artif. Intell. https://doi.org/10.1016/j.artint.2023.103873 db/journals/ai/ai317.html#DvorakGRW23

Wolfgang Dvorák Anna Rapberger Stefan Woltran A claim-centric perspective on abstract argumentation semantics: Claim-defeat, principles, and expressiveness. 104011 2023 November 324 Artif. Intell. https://doi.org/10.1016/j.artint.2023.104011 db/journals/ai/ai324.html#DvorakRW23

Wolfgang Dvorák Atefeh Keshavarzi Zafarghandi Stefan Woltran Expressiveness of SETAFs and support-free ADFs under 3-valued semantics. 298-327 2023 October 33 J. Appl. Non Class. Logics 3-4 https://doi.org/10.1080/11663081.2023.2244361 db/journals/jancl/jancl33.html#DvorakZW23

Michael Bernreiter Wolfgang Dvorák Anna Rapberger Stefan Woltran The Effect of Preferences in Abstract Argumentation under a Claim-Centric View. 6253-6261 2023 AAAI https://doi.org/10.1609/aaai.v37i5.25770 conf/aaai/2023 db/conf/aaai/aaai2023.html#BernreiterDRW23 Giovanni Buraglio Wolfgang Dvorák Anna Rapberger Stefan Woltran Constrained Derivation in Assumption-Based Argumentation. 2023 AI³@AI*IA https://ceur-ws.org/Vol-3546/paper05.pdf conf/ai3/2023 db/conf/ai3/ai32023.html#BuraglioDRW23 Augusto B. Corrêa Markus Hecher Malte Helmert Davide Mario Longo Florian Pommerening Stefan Woltran Grounding Planning Tasks Using Tree Decompositions and Iterated Solving. 100-108 2023 ICAPS https://doi.org/10.1609/icaps.v33i1.27184 conf/aips/2023 db/conf/aips/icaps2023.html#CorreaHHLPW23 Viktor Besin Markus Hecher Stefan Woltran On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth. 247-254 2023 ECAI https://doi.org/10.3233/FAIA230277 conf/ecai/2023 db/conf/ecai/ecai2023.html#BesinHW23 Zeynep G. Saribatur Stefan Woltran Foundations for Projecting Away the Irrelevant in ASP Programs. 614-624 2023 KR https://doi.org/10.24963/kr.2023/60 conf/kr/2023 db/conf/kr/kr2023.html#SaribaturW23 Yannis Dimopoulos Wolfgang Dvorák Matthias König 0002 Anna Rapberger Markus Ulbricht 0001 Stefan Woltran Sets Attacking Sets in Abstract Argumentation. 22-31 2023 NMR https://ceur-ws.org/Vol-3464/paper3.pdf conf/nmr/2023 db/conf/nmr/nmr2023.html#DimopoulosD0R0W23 Erich Prem Julia Neidhardt Peter Knees Stefan Woltran Hannes Werthner Digital Humanism and Norms in Recommender Systems. 2023 NORMalize@RecSys https://ceur-ws.org/Vol-3639/short1.pdf conf/normalize/2023 db/conf/normalize/normalize2023.html#PremNKWW23

Johannes Klaus Fichte Markus Hecher Michael Morak Patrick Thier Stefan Woltran Solving Projected Model Counting by Utilizing Treewidth and its Limits. 2023 abs/2305.19212 CoRR https://doi.org/10.48550/arXiv.2305.19212 db/journals/corr/corr2305.html#abs-2305-19212

Zeynep G. Saribatur Stefan Woltran A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming. 2023 abs/2312.07993 CoRR https://doi.org/10.48550/arXiv.2312.07993 db/journals/corr/corr2312.html#abs-2312-07993

Thomas Linsbichler Marco Maratea Andreas Niskanen Johannes Peter Wallner Stefan Woltran Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving. 103697 2022 307 Artif. Intell. https://doi.org/10.1016/j.artint.2022.103697 db/journals/ai/ai307.html#LinsbichlerMNWW22

Michael Bernreiter Jan Maly 0001 Stefan Woltran Choice logics and their computational properties. 103755 2022 311 Artif. Intell. https://doi.org/10.1016/j.artint.2022.103755 db/journals/ai/ai311.html#BernreiterMW22

Jorge Fandinno David Pearce 0001 Concepción Vidal Stefan Woltran Comparing the Reasoning Capabilities of Equilibrium Theories and Answer Set Programs. 201 2022 15 Algorithms 6 https://doi.org/10.3390/a15060201 https://www.wikidata.org/entity/Q114033179 db/journals/algorithms/algorithms15.html#FandinnoPVW22

Wolfgang Dvorák Markus Ulbricht 0001 Stefan Woltran Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility. 1403-1447 2022 74 J. Artif. Intell. Res. https://doi.org/10.1613/jair.1.13603 db/journals/jair/jair74.html#DvorakUW22

Johannes Klaus Fichte Markus Hecher Patrick Thier Stefan Woltran Exploiting Database Management Systems and Treewidth for Counting. 128-157 2022 22 Theory Pract. Log. Program. 1 https://doi.org/10.1017/S147106842100003X db/journals/tplp/tplp22.html#FichteHTW22

Wolfgang Dvorák Markus Hecher Matthias König 0002 André Schidler Stefan Szeider Stefan Woltran Tractable Abstract Argumentation via Backdoor-Treewidth. 5608-5615 2022 AAAI https://doi.org/10.1609/aaai.v36i5.20501 conf/aaai/2022 db/conf/aaai/aaai2022.html#DvorakH0SSW22 Michael Bernreiter Anela Lolic Jan Maly 0001 Stefan Woltran Sequent Calculi for Choice Logics. 331-349 2022 IJCAR https://doi.org/10.1007/978-3-031-10769-6_20 conf/cade/2022 db/conf/cade/ijcar2022.html#BernreiterLMW22 Michael Bernreiter Wolfgang Dvorák Stefan Woltran Abstract Argumentation with Conditional Preferences. 92-103 2022 COMMA https://doi.org/10.3233/FAIA220144 conf/comma/2022 db/conf/comma/comma2022.html#BernreiterDW22 Wolfgang Dvorák Matthias König 0002 Stefan Woltran Deletion-Backdoors for Argumentation Frameworks with Collective Attacks. 98-110 2022 SAFA@COMMA https://ceur-ws.org/Vol-3236/paper8.pdf conf/comma/2022safa db/conf/comma/safa2022.html#Dvorak0W22a Wolfgang Dvorák Tjitze Rienstra Leendert van der Torre Stefan Woltran Non-Admissibility in Abstract Argumentation. 128-139 2022 COMMA https://doi.org/10.3233/FAIA220147 conf/comma/2022 db/conf/comma/comma2022.html#DvorakRTW22 Wolfgang Dvorák Matthias König 0002 Stefan Woltran Treewidth for Argumentation Frameworks with Collective Attacks. 140-151 2022 COMMA https://doi.org/10.3233/FAIA220148 conf/comma/2022 db/conf/comma/comma2022.html#Dvorak0W22 Viktor Besin Markus Hecher Stefan Woltran Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck. 2546-2552 2022 IJCAI https://doi.org/10.24963/ijcai.2022/353 conf/ijcai/2022 db/conf/ijcai/ijcai2022.html#BesinHW22 Viktor Besin Markus Hecher Stefan Woltran Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract). 5264-5268 2022 IJCAI https://doi.org/10.24963/ijcai.2022/732 conf/ijcai/2022 db/conf/ijcai/ijcai2022.html#BesinHW22a Wolfgang Dvorák Matthias König 0002 Markus Ulbricht 0001 Stefan Woltran Rediscovering Argumentation Principles Utilizing Collective Attacks. 2022 KR https://proceedings.kr.org/2022/13/ conf/kr/2022 db/conf/kr/kr2022.html#Dvorak00W22 Michael Bernreiter Wolfgang Dvorák Anna Rapberger Stefan Woltran The Effect of Preferences in Abstract Argumentation Under a Claim-Centric View. 27-38 2022 NMR https://ceur-ws.org/Vol-3197/paper3.pdf conf/nmr/2022 db/conf/nmr/nmr2022.html#BernreiterDRW22 Julia Neidhardt Hannes Werthner Stefan Woltran It Is Simple, It Is Complicated. 335-342 2022 Perspectives on Digital Humanism https://doi.org/10.1007/978-3-030-86144-5_46 db/books/collections/WPLG2022.html#NeidhardtWW22

Michael Bernreiter Wolfgang Dvorák Anna Rapberger Stefan Woltran The Effect of Preferences in Abstract Argumentation Under a Claim-Centric View. 2022 abs/2204.13305 CoRR https://doi.org/10.48550/arXiv.2204.13305 db/journals/corr/corr2204.html#abs-2204-13305

Wolfgang Dvorák Matthias König 0002 Markus Ulbricht 0001 Stefan Woltran Rediscovering Argumentation Principles Utilizing Collective Attacks. 2022 abs/2205.03151 CoRR https://doi.org/10.48550/arXiv.2205.03151 db/journals/corr/corr2205.html#abs-2205-03151

Johannes Klaus Fichte Markus Hecher Michael Morak Stefan Woltran DynASP2.5: Dynamic Programming on Tree Decompositions in Action. 81 2021 14 Algorithms 3 https://doi.org/10.3390/a14030081 db/journals/algorithms/algorithms14.html#FichteHMW21

Johannes Oetsch Martina Seidl Hans Tompits Stefan Woltran Beyond Uniform Equivalence between Answer-set Programs. 2:1-2:46 2021 22 ACM Trans. Comput. Log. 1 https://doi.org/10.1145/3422361 db/journals/tocl/tocl22.html#OetschSTW21

Marcello Balduccini Yuliya Lierler Stefan Woltran Preface. 293-295 2021 21 Theory Pract. Log. Program. 3 https://doi.org/10.1017/S1471068420000484 db/journals/tplp/tplp21.html#BalducciniLW21

Viktor Besin Markus Hecher Stefan Woltran Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs. 575-592 2021 21 Theory Pract. Log. Program. 5 https://doi.org/10.1017/S1471068421000399 db/journals/tplp/tplp21.html#BesinHW21

Wolfgang Dvorák Markus Ulbricht 0001 Stefan Woltran Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility. 6288-6295 2021 AAAI https://doi.org/10.1609/aaai.v35i7.16781 conf/aaai/2021 db/conf/aaai/aaai2021.html#Dvorak0W21 Wolfgang Dvorák Alexander Greßler Anna Rapberger Stefan Woltran The Complexity Landscape of Claim-Augmented Argumentation Frameworks. 6296-6303 2021 AAAI https://doi.org/10.1609/aaai.v35i7.16782 conf/aaai/2021 db/conf/aaai/aaai2021.html#DvorakGRW21 Michael Bernreiter Jan Maly 0001 Stefan Woltran Choice Logics and Their Computational Properties. 1794-1800 2021 IJCAI https://doi.org/10.24963/ijcai.2021/247 conf/ijcai/2021 db/conf/ijcai/ijcai2021.html#Bernreiter0W21 Wolfgang Dvorák Matthias König 0002 Stefan Woltran Graph-Classes of Argumentation Frameworks with Collective Attacks. 3-17 2021 JELIA https://doi.org/10.1007/978-3-030-75775-5_1 conf/jelia/2021 db/conf/jelia/jelia2021.html#DvorakKW21 Wolfgang Dvorák Matthias König 0002 Stefan Woltran On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length. 671-675 2021 KR https://doi.org/10.24963/kr.2021/67 conf/kr/2021 db/conf/kr/kr2021.html#Dvorak0W21

Michael Bernreiter Jan Maly 0001 Stefan Woltran Choice Logics and Their Computational Properties. 2021 abs/2106.05052 CoRR https://arxiv.org/abs/2106.05052 db/journals/corr/corr2106.html#abs-2106-05052

Viktor Besin Markus Hecher Stefan Woltran Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs. 2021 abs/2108.03022 CoRR https://arxiv.org/abs/2108.03022 db/journals/corr/corr2108.html#abs-2108-03022

Wolfgang Dvorák Matthias König 0002 Johannes Peter Wallner Stefan Woltran Aspartix-V21. 2021 abs/2109.03166 CoRR https://arxiv.org/abs/2109.03166 db/journals/corr/corr2109.html#abs-2109-03166

Sarah Alice Gaggl Thomas Linsbichler Marco Maratea Stefan Woltran Design and results of the Second International Competition on Computational Models of Argumentation. 2020 279 Artif. Intell. https://doi.org/10.1016/j.artint.2019.103193 db/journals/ai/ai279.html#GagglLMW20

Wolfgang Dvorák Stefan Woltran Complexity of abstract argumentation under a claim-centric view. 103290 2020 285 Artif. Intell. https://doi.org/10.1016/j.artint.2020.103290 db/journals/ai/ai285.html#DvorakW20

Ricardo Gonçalves 0001 Matthias Knorr 0001 João Leite 0001 Stefan Woltran On the limits of forgetting in Answer Set Programming. 103307 2020 286 Artif. Intell. https://doi.org/10.1016/j.artint.2020.103307 db/journals/ai/ai286.html#GoncalvesKLW20

Martin Diller Atefeh Keshavarzi Zafarghandi Thomas Linsbichler Stefan Woltran Investigating subclasses of abstract dialectical frameworks. 191-219 2020 11 Argument Comput. 1-2 https://doi.org/10.3233/AAC-190481 db/journals/argcom/argcom11.html#DillerZLW20

Manuel Bichler Michael Morak Stefan Woltran lpopt: A Rule Optimization Tool for Answer Set Programming. 275-296 2020 177 Fundam. Informaticae 3-4 https://doi.org/10.3233/FI-2020-1990 db/journals/fuin/fuin177.html#BichlerMW20

Bernhard Bliem Michael Morak Marius Moldovan Stefan Woltran The Impact of Treewidth on Grounding and Solving of Answer Set Programs. 35-80 2020 67 J. Artif. Intell. Res. https://doi.org/10.1613/jair.1.11515 db/journals/jair/jair67.html#BliemMMW20

Michael Abseher Bernhard Bliem Günther Charwat Frederico Dusberger Stefan Woltran Computing secure sets in graphs using answer set programming. 837-862 2020 30 J. Log. Comput. 4 https://doi.org/10.1093/logcom/exv060 db/journals/logcom/logcom30.html#AbseherBCDW20

Wolfgang Dvorák Anna Rapberger Stefan Woltran On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs. 1063-1107 2020 30 J. Log. Comput. 5 https://doi.org/10.1093/logcom/exaa033 db/journals/logcom/logcom30.html#DvorakRW20

Gerhard Brewka Martin Diller Georg Heissenberger Thomas Linsbichler Stefan Woltran Solving Advanced Argumentation Problems with Answer Set Programming. 391-431 2020 20 Theory Pract. Log. Program. 3 https://doi.org/10.1017/S1471068419000474 db/journals/tplp/tplp20.html#BrewkaDHLW20

Manuel Bichler Michael Morak Stefan Woltran selp: A Single-Shot Epistemic Logic Program Solver. 435-455 2020 20 Theory Pract. Log. Program. 4 https://doi.org/10.1017/S1471068420000022 db/journals/tplp/tplp20.html#BichlerMW20

Markus Hecher Michael Morak Stefan Woltran Structural Decompositions of Epistemic Logic Programs. 2830-2837 2020 AAAI https://doi.org/10.1609/aaai.v34i03.5672 conf/aaai/2020 db/conf/aaai/aaai2020.html#HecherMW20 Stefan Woltran Computational Argumentation - Formal Models and Complexity Results (invited talk). 2 2020 CILC https://ceur-ws.org/Vol-2710/abstract-invited-2.pdf conf/cilc/2020 db/conf/cilc/cilc2020.html#Woltran20 Stefano Bistarelli Wolfgang Dvorák Carlo Taticchi Stefan Woltran Ranking-Based Semantics from the Perspective of Claims. 111-122 2020 COMMA https://doi.org/10.3233/FAIA200497 conf/comma/2020 db/conf/comma/comma2020.html#BistarelliDTW20 Wolfgang Dvorák Atefeh Keshavarzi Zafarghandi Stefan Woltran Expressiveness of SETAFs and Support-Free ADFs Under 3-Valued Semantics. 191-202 2020 COMMA https://doi.org/10.3233/FAIA200504 conf/comma/2020 db/conf/comma/comma2020.html#DvorakZW20 Wolfgang Dvorák Sarah Alice Gaggl Anna Rapberger Johannes Peter Wallner Stefan Woltran The ASPARTIX System Suite. 461-462 2020 COMMA https://doi.org/10.3233/FAIA200534 conf/comma/2020 db/conf/comma/comma2020.html#DvorakGRWW20 Wolfgang Dvorák Anna Rapberger Stefan Woltran On the Relation Between Claim-Augmented Argumentation Frameworks and Collective Attacks. 721-728 2020 ECAI https://doi.org/10.3233/FAIA200159 conf/ecai/2020 db/conf/ecai/ecai2020.html#DvorakRW20 Zeynep G. Saribatur Johannes Peter Wallner Stefan Woltran Explaining Non-Acceptability in Abstract Argumentation. 881-888 2020 ECAI https://doi.org/10.3233/FAIA200179 conf/ecai/2020 db/conf/ecai/ecai2020.html#SaribaturWW20 Wolfgang Dvorák Anna Rapberger Johannes Peter Wallner Stefan Woltran ASPARTIX-V19 - An Answer-Set Programming Based System for Abstract Argumentation. 79-89 2020 FoIKS https://doi.org/10.1007/978-3-030-39951-1_5 conf/foiks/2020 db/conf/foiks/foiks2020.html#DvorakRWW20 Michael Bernreiter Jan Maly 0001 Stefan Woltran Encoding Choice Logics in ASP. 2020 ICLP Workshops https://ceur-ws.org/Vol-2678/paper1.pdf conf/iclp/2020w db/conf/iclp/iclp2020w.html#BernreiterMW20 Markus Hecher Michael Morak Stefan Woltran Structural Decompositions of Epistemic Logic Programs. 2020 ICLP Workshops https://ceur-ws.org/Vol-2678/short1.pdf conf/iclp/2020w db/conf/iclp/iclp2020w.html#HecherMW20 Wolfgang Dvorák Anna Rapberger Stefan Woltran Argumentation Semantics under a Claim-centric View: Properties, Expressiveness and Relation to SETAFs. 341-350 2020 KR https://doi.org/10.24963/kr.2020/35 conf/kr/2020 db/conf/kr/kr2020.html#DvorakRW20 Johannes Klaus Fichte Markus Hecher Patrick Thier Stefan Woltran Exploiting Database Management Systems and Treewidth for Counting. 151-167 2020 PADL https://doi.org/10.1007/978-3-030-39197-3_10 conf/padl/2020 db/conf/padl/padl2019.html#FichteHTW20 Markus Hecher Patrick Thier Stefan Woltran Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. 343-360 2020 SAT https://doi.org/10.1007/978-3-030-51825-7_25 conf/sat/2020 db/conf/sat/sat2020.html#HecherTW20

Manuel Bichler Michael Morak Stefan Woltran selp: A Single-Shot Epistemic Logic Program Solver. 2020 abs/2001.01089 CoRR http://arxiv.org/abs/2001.01089 db/journals/corr/corr2001.html#abs-2001-01089

Johannes Klaus Fichte Markus Hecher Patrick Thier Stefan Woltran Exploiting Database Management Systems and Treewidth for Counting. 2020 abs/2001.04191 CoRR https://arxiv.org/abs/2001.04191 db/journals/corr/corr2001.html#abs-2001-04191

Markus Hecher Michael Morak Stefan Woltran Structural Decompositions of Epistemic Logic Programs. 2020 abs/2001.04219 CoRR https://arxiv.org/abs/2001.04219 db/journals/corr/corr2001.html#abs-2001-04219

Wolfgang Dvorák Atefeh Keshavarzi Zafarghandi Stefan Woltran Expressiveness of SETAFs and Support-Free ADFs under 3-valued Semantics. 2020 abs/2007.03581 CoRR https://arxiv.org/abs/2007.03581 db/journals/corr/corr2007.html#abs-2007-03581

Ringo Baumann Wolfgang Dvorák Thomas Linsbichler Stefan Woltran A general notion of equivalence for abstract argumentation. 379-410 2019 275 Artif. Intell. https://doi.org/10.1016/j.artint.2019.06.006 db/journals/ai/ai275.html#BaumannDLW19

Johannes Klaus Fichte Martin Kronegger Stefan Woltran A multiparametric view on answer set programming. 121-147 2019 86 Ann. Math. Artif. Intell. 1-3 https://doi.org/10.1007/s10472-019-09633-x db/journals/amai/amai86.html#FichteKW19

Flavio Ferrarotti Stefan Woltran Preface. 1-4 2019 87 Ann. Math. Artif. Intell. 1-2 https://doi.org/10.1007/s10472-019-09667-1 db/journals/amai/amai87.html#FerrarottiW19

Wolfgang Dvorák Jorge Fandinno Stefan Woltran On the expressive power of collective attacks. 191-230 2019 10 Argument Comput. 2 https://doi.org/10.3233/AAC-190457 db/journals/argcom/argcom10.html#DvorakFW19

Günther Charwat Stefan Woltran Expansion-based QBF Solving on Tree Decompositions. 59-92 2019 167 Fundam. Informaticae 1-2 https://doi.org/10.3233/FI-2019-1810 db/journals/fuin/fuin167.html#CharwatW19

Jan Maly 0001 Miroslaw Truszczynski Stefan Woltran Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? 1147-1197 2019 66 J. Artif. Intell. Res. https://doi.org/10.1613/jair.1.11879 db/journals/jair/jair66.html#MalyTW19

Wolfgang Faber 0001 Michael Morak Stefan Woltran On Uniform Equivalence of Epistemic Logic Programs. 826-840 2019 19 Theory Pract. Log. Program. 5-6 https://doi.org/10.1017/S1471068419000218 db/journals/tplp/tplp19.html#0001MW19

Wolfgang Dvorák Stefan Woltran Complexity of Abstract Argumentation under a Claim-Centric View. 2801-2808 2019 AAAI https://doi.org/10.1609/aaai.v33i01.33012801 conf/aaai/2019 db/conf/aaai/aaai2019.html#DvorakW19 Wolfgang Faber 0001 Michael Morak Stefan Woltran Strong Equivalence for Epistemic Logic Programs Made Easy. 2809-2816 2019 AAAI https://doi.org/10.1609/aaai.v33i01.33012809 conf/aaai/2019 db/conf/aaai/aaai2019.html#0001MW19 Ricardo Gonçalves 0001 Tomi Janhunen Matthias Knorr 0001 João Leite 0001 Stefan Woltran Forgetting in Modular Answer Set Programming. 2843-2850 2019 AAAI https://doi.org/10.1609/aaai.v33i01.33012843 conf/aaai/2019 db/conf/aaai/aaai2019.html#0001JKLW19 Adrian Haret Stefan Woltran Belief Revision Operators with Varying Attitudes Towards Initial Beliefs. 2019 IJCAI https://doi.org/10.24963/ijcai.2019/239 conf/ijcai/2019 db/conf/ijcai/ijcai2019.html#HaretW19 1726-1733 Gerhard Brewka Jörg Pührer Stefan Woltran Multi-valued GRAPPA. 85-101 2019 JELIA https://doi.org/10.1007/978-3-030-19570-0_6 conf/jelia/2019 db/conf/jelia/jelia2019.html#BrewkaPW19 Wolfgang Dvorák Matti Järvisalo Thomas Linsbichler Andreas Niskanen Stefan Woltran Preprocessing Argumentation Frameworks via Replacement Patterns. 116-132 2019 JELIA https://doi.org/10.1007/978-3-030-19570-0_8 conf/jelia/2019 db/conf/jelia/jelia2019.html#DvorakJLNW19 Wolfgang Dvorák Anna Rapberger Stefan Woltran Strong Equivalence for Argumentation Frameworks with Collective Attacks. 131-145 2019 KI https://doi.org/10.1007/978-3-030-30179-8_11 conf/ki/2019 db/conf/ki/ki2019.html#DvorakRW19 Marcello Balduccini Yuliya Lierler Stefan Woltran Logic Programming and Nonmonotonic Reasoning - 15th International Conference, LPNMR 2019, Philadelphia, PA, USA, June 3-7, 2019, Proceedings LPNMR Springer 2019 Lecture Notes in Computer Science 11481 978-3-030-20527-0 978-3-030-20528-7 https://doi.org/10.1007/978-3-030-20528-7 db/conf/lpnmr/lpnmr2019.html

Wolfgang Faber 0001 Michael Morak Stefan Woltran On Uniform Equivalence of Epistemic Logic Programs. 2019 abs/1907.10925 CoRR http://arxiv.org/abs/1907.10925 db/journals/corr/corr1907.html#abs-1907-10925

Sarah Alice Gaggl Thomas Linsbichler Marco Maratea Stefan Woltran Design and Results of the Second International Competition on Computational Models of Argumentation. 2019 abs/1909.00621 CoRR http://arxiv.org/abs/1909.00621 db/journals/corr/corr1909.html#abs-1909-00621

Gerhard Brewka Martin Diller Georg Heissenberger Thomas Linsbichler Stefan Woltran Solving Advanced Argumentation Problems with Answer Set Programming. 2019 abs/1912.02734 CoRR http://arxiv.org/abs/1912.02734 db/journals/corr/corr1912.html#abs-1912-02734

Sarah Alice Gaggl Thomas Linsbichler Marco Maratea Stefan Woltran Summary Report of the Second International Competition on Computational Models of Argumentation. 2018 39 AI Mag. 4 https://doi.org/10.1609/aimag.v39i4.2781 db/journals/aim/aim39.html#GagglLMW18 77-79

Bernhard Bliem Stefan Woltran Complexity of Secure Sets. 2909-2940 2018 80 Algorithmica 10 https://doi.org/10.1007/s00453-017-0358-5 https://www.wikidata.org/entity/Q55312596 db/journals/algorithmica/algorithmica80.html#BliemW18

Bernhard Bliem Stefan Woltran Equivalence between answer-set programs under (partially) fixed input. 277-295 2018 83 Ann. Math. Artif. Intell. 3-4 https://doi.org/10.1007/s10472-017-9567-5 https://www.wikidata.org/entity/Q59607521 db/journals/amai/amai83.html#BliemW18

Rémi Brochenin Thomas Linsbichler Marco Maratea Johannes Peter Wallner Stefan Woltran Abstract solvers for Dung's argumentation frameworks. 41-72 2018 9 Argument Comput. 1 https://doi.org/10.3233/AAC-170031 db/journals/argcom/argcom9.html#BrocheninLMWW18

Bernhard Bliem Stefan Woltran Defensive alliances in graphs of bounded treewidth. 334-339 2018 251 Discret. Appl. Math. https://doi.org/10.1016/j.dam.2018.04.001 db/journals/dam/dam251.html#BliemW18

Martin Diller Adrian Haret Thomas Linsbichler Stefan Rümmele Stefan Woltran An extension-based approach to belief revision in abstract argumentation. 395-423 2018 93 Int. J. Approx. Reason. https://doi.org/10.1016/j.ijar.2017.11.013 db/journals/ijar/ijar93.html#DillerHLRW18

James P. Delgrande Pavlos Peppas Stefan Woltran General Belief Revision. 29:1-29:34 2018 65 J. ACM 5 https://doi.org/10.1145/3203409 db/journals/jacm/jacm65.html#DelgrandePW18

Torsten Schaub Stefan Woltran Special Issue on Answer Set Programming. 101-103 2018 32 Künstliche Intell. 2-3 https://doi.org/10.1007/s13218-018-0554-8 db/journals/ki/ki32.html#SchaubW18

Torsten Schaub Stefan Woltran Answer set programming unleashed! 105-108 2018 32 Künstliche Intell. 2-3 https://doi.org/10.1007/s13218-018-0550-z db/journals/ki/ki32.html#SchaubW18a

Michael Abseher Bernhard Bliem Markus Hecher Marius Moldovan Stefan Woltran Dynamic Programming on Tree Decompositions with D-FLAT. 191-192 2018 32 Künstliche Intell. 2-3 https://doi.org/10.1007/s13218-018-0531-2 db/journals/ki/ki32.html#AbseherBHMW18

Vladimir Lifschitz Torsten Schaub Stefan Woltran Interview with Vladimir Lifschitz. 213-218 2018 32 Künstliche Intell. 2-3 https://doi.org/10.1007/s13218-018-0552-x db/journals/ki/ki32.html#LifschitzSW18

Gerhard Brewka Torsten Schaub Stefan Woltran Interview with Gerhard Brewka. 219-221 2018 32 Künstliche Intell. 2-3 https://doi.org/10.1007/s13218-018-0549-5 db/journals/ki/ki32.html#BrewkaSW18

Nadia Creignou Reinhard Pichler Stefan Woltran Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? 2018 14 Log. Methods Comput. Sci. 4 https://doi.org/10.23638/LMCS-14(4:10)2018 db/journals/lmcs/lmcs14.html#CreignouPW18

João Leite 0001 Tran Cao Son Paolo Torroni Stefan Woltran Preface to the Special Issue on Computational Logic in Multi-Agent Systems (CLIMA XIV). 475-476 2018 28 J. Log. Comput. 3 https://doi.org/10.1093/logcom/exv005 https://www.wikidata.org/entity/Q62696783 db/journals/logcom/logcom28.html#LeiteSTW18

Gerhard Brewka Hannes Strass Johannes Peter Wallner Stefan Woltran Weighted Abstract Dialectical Frameworks. 2018 AAAI https://doi.org/10.1609/aaai.v32i1.11545 conf/aaai/2018 db/conf/aaai/aaai2018.html#BrewkaSWW18 1779-1786 Jan Maly 0001 Stefan Woltran A New Logic for Jointly Representing Hard and Soft Constraints. 2018 PRUV@IJCAR https://ceur-ws.org/Vol-2157/paper1.pdf conf/cade/2018pruv db/conf/cade/pruv2018.html#MalyW18 Wolfgang Dvorák Alexander Greßler Stefan Woltran Evaluating SETAFs via Answer-Set Programming 10-21 2018 SAFA@COMMA https://ceur-ws.org/Vol-2171/paper_2.pdf conf/comma/2018safa db/conf/comma/safa2018.html#DvorakGW18 Wolfgang Dvorák Jorge Fandinno Stefan Woltran On the Expressive Power of Collective Attacks. 49-60 2018 COMMA https://doi.org/10.3233/978-1-61499-906-5-49 conf/comma/2018 db/conf/comma/comma2018.html#DvorakFW18 Martin Diller Atefeh Keshavarzi Zafarghandi Thomas Linsbichler Stefan Woltran Investigating Subclasses of Abstract Dialectical Frameworks. 61-72 2018 COMMA https://doi.org/10.3233/978-1-61499-906-5-61 conf/comma/2018 db/conf/comma/comma2018.html#DillerZLW18 Johannes Klaus Fichte Markus Hecher Stefan Woltran Markus Zisser Weighted Model Counting on the GPU by Exploiting Small Treewidth. 28:1-28:16 2018 ESA https://doi.org/10.4230/LIPIcs.ESA.2018.28 conf/esa/2018 db/conf/esa/esa2018.html#FichteHWZ18 Jan Maly 0001 Miroslaw Truszczynski Stefan Woltran Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided? 433-439 2018 IJCAI https://doi.org/10.24963/ijcai.2018/60 conf/ijcai/2018 db/conf/ijcai/ijcai2018.html#MalyTW18 Manuel Bichler Michael Morak Stefan Woltran Single-Shot Epistemic Logic Program Solving. 1714-1720 2018 IJCAI https://doi.org/10.24963/ijcai.2018/237 conf/ijcai/2018 db/conf/ijcai/ijcai2018.html#BichlerMW18 Nadia Creignou Adrian Haret Odile Papini Stefan Woltran Belief Update in the Horn Fragment. 1781-1787 2018 IJCAI https://doi.org/10.24963/ijcai.2018/246 conf/ijcai/2018 db/conf/ijcai/ijcai2018.html#CreignouHPW18 Adrian Haret Johannes Peter Wallner Stefan Woltran Two Sides of the Same Coin: Belief Revision and Enforcing Arguments. 1854-1860 2018 IJCAI https://doi.org/10.24963/ijcai.2018/256 conf/ijcai/2018 db/conf/ijcai/ijcai2018.html#HaretWW18 Thomas Linsbichler Marco Maratea Andreas Niskanen Johannes Peter Wallner Stefan Woltran Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving. 1905-1911 2018 IJCAI https://doi.org/10.24963/ijcai.2018/263 conf/ijcai/2018 db/conf/ijcai/ijcai2018.html#LinsbichlerMNWW18 Ricardo Gonçalves 0001 Tomi Janhunen Matthias Knorr 0001 João Leite 0001 Stefan Woltran Variable Elimination for DLP-Functions. 643-644 2018 KR https://aaai.org/ocs/index.php/KR/KR18/paper/view/18000 conf/kr/2018 db/conf/kr/kr2018.html#0001JKLW18 Johannes Klaus Fichte Markus Hecher Michael Morak Stefan Woltran Exploiting Treewidth for Projected Model Counting and Its Limits. 165-184 2018 SAT https://doi.org/10.1007/978-3-319-94144-8_11 conf/sat/2018 db/conf/sat/sat2018.html#FichteHMW18 Flavio Ferrarotti Stefan Woltran Foundations of Information and Knowledge Systems - 10th International Symposium, FoIKS 2018, Budapest, Hungary, May 14-18, 2018, Proceedings FoIKS Springer 2018 Lecture Notes in Computer Science 10833 978-3-319-90049-0 978-3-319-90050-6 https://doi.org/10.1007/978-3-319-90050-6 db/conf/foiks/foiks2018.html

Johannes Klaus Fichte Michael Morak Markus Hecher Stefan Woltran Exploiting Treewidth for Projected Model Counting and its Limits. 2018 abs/1805.05445 CoRR http://arxiv.org/abs/1805.05445 db/journals/corr/corr1805.html#abs-1805-05445

Gerhard Brewka Jörg Pührer Hannes Strass Johannes Peter Wallner Stefan Woltran Weighted Abstract Dialectical Frameworks: Extended and Revised Report. 2018 abs/1806.07717 CoRR http://arxiv.org/abs/1806.07717 db/journals/corr/corr1806.html#abs-1806-07717

Wolfgang Faber 0001 Michael Morak Stefan Woltran Strong Equivalence for Epistemic Logic Programs Made Easy (Extended Version). 2018 abs/1811.04800 CoRR http://arxiv.org/abs/1811.04800 db/journals/corr/corr1811.html#abs-1811-04800

Jan Maly 0001 Stefan Woltran Ranking Specific Sets of Objects. 255-265 2017 17 Datenbank-Spektrum 3 https://doi.org/10.1007/s13222-017-0264-7 https://www.wikidata.org/entity/Q59607703 db/journals/dbsk/dbsk17.html#MalyW17

Gerhard Brewka Stefan Ellmauthaler Hannes Strass Johannes Peter Wallner Stefan Woltran Abstract Dialectical Frameworks. An Overview. 2017 4 FLAP 8 http://www.collegepublications.co.uk/downloads/ifcolog00017.pdf db/journals/flap/flap4.html#BrewkaESWW17

Michael Abseher Nysret Musliu Stefan Woltran Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. 829-858 2017 58 J. Artif. Intell. Res. https://doi.org/10.1613/jair.5312 db/journals/jair/jair58.html#AbseherMW17

Bernhard Bliem Reinhard Pichler Stefan Woltran Implementing Courcelle's Theorem in a declarative framework for dynamic programming. 1067-1094 2017 27 J. Log. Comput. 4 https://doi.org/10.1093/logcom/exv089 db/journals/logcom/logcom27.html#BliemPW17

Adrian Haret Stefan Rümmele Stefan Woltran Merging in the Horn Fragment. 6:1-6:32 2017 18 ACM Trans. Comput. Log. 1 https://doi.org/10.1145/3043700 db/journals/tocl/tocl18.html#HaretRW17

Ricardo Gonçalves 0001 Matthias Knorr 0001 João Leite 0001 Stefan Woltran When you must forget: Beyond strong persistence when forgetting in answer set programming. 837-854 2017 17 Theory Pract. Log. Program. 5-6 https://doi.org/10.1017/S1471068417000382 https://www.wikidata.org/entity/Q62046413 db/journals/tplp/tplp17.html#GoncalvesKLW17

Gerhard Brewka Martin Diller Georg Heissenberger Thomas Linsbichler Stefan Woltran Solving Advanced Argumentation Problems with Answer-Set Programming. 1077-1083 2017 AAAI https://doi.org/10.1609/aaai.v31i1.10682 conf/aaai/2017 db/conf/aaai/aaai2017.html#BrewkaDHLW17 Günther Charwat Stefan Woltran Expansion-based QBF Solving on Tree Decompositions. 16-26 2017 RCRA@AI*IA https://ceur-ws.org/Vol-2011/paper2.pdf conf/aiia/2017rcra db/conf/aiia/rcra2017.html#CharwatW17 Jan Maly 0001 Stefan Woltran Ranking Specific Sets of Objects. 193-201 2017 BTW (Workshops) conf/btw/2017w db/conf/btw/btw2017w.html#MalyW17 https://dl.gi.de/handle/20.500.12116/915 Michael Abseher Nysret Musliu Stefan Woltran htd - A Free, Open-Source Framework for (Customized) Tree Decompositions and Beyond. 376-386 2017 CPAIOR https://doi.org/10.1007/978-3-319-59776-8_30 conf/cpaior/2017 db/conf/cpaior/cpaior2017.html#AbseherMW17 Ringo Baumann Wolfgang Dvorák Thomas Linsbichler Stefan Woltran A General Notion of Equivalence for Abstract Argumentation. 800-806 2017 IJCAI https://doi.org/10.24963/ijcai.2017/111 conf/ijcai/2017 db/conf/ijcai/ijcai2017.html#BaumannDLW17 Bernhard Bliem Marius Moldovan Michael Morak Stefan Woltran The Impact of Treewidth on ASP Grounding and Solving. 852-858 2017 IJCAI https://doi.org/10.24963/ijcai.2017/118 conf/ijcai/2017 db/conf/ijcai/ijcai2017.html#BliemMMW17 Markus Kröll Reinhard Pichler Stefan Woltran On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks. 1145-1152 2017 IJCAI https://doi.org/10.24963/ijcai.2017/159 conf/ijcai/2017 db/conf/ijcai/ijcai2017.html#KrollPW17 Johannes Klaus Fichte Markus Hecher Michael Morak Stefan Woltran DynASP2.5: Dynamic Programming on Tree Decompositions in Action. 17:1-17:13 2017 IPEC https://doi.org/10.4230/LIPIcs.IPEC.2017.17 conf/iwpec/2017 db/conf/iwpec/ipec2017.html#FichteHMW17 Adrian Haret Stefan Woltran Deviation in Belief Change on Fragments of Propositional Logic. 64-76 2017 DKB/KIK@KI https://ceur-ws.org/Vol-1928/paper6.pdf conf/ki/2017kik db/conf/ki/kik2017.html#HaretW17 Johannes Klaus Fichte Markus Hecher Michael Morak Stefan Woltran Answer Set Solving with Bounded Treewidth Revisited. 132-145 2017 LPNMR https://doi.org/10.1007/978-3-319-61660-5_13 conf/lpnmr/2017 db/conf/lpnmr/lpnmr2017.html#FichteHMW17 Johannes Klaus Fichte Martin Kronegger Stefan Woltran A Multiparametric View on Answer Set Programming. 2017 ASPOCP@LPNMR https://ceur-ws.org/Vol-1868/p8.pdf conf/lpnmr/2017aspocp db/conf/lpnmr/aspocp2017.html#FichteKW17

Johannes Klaus Fichte Markus Hecher Michael Morak Stefan Woltran Answer Set Solving with Bounded Treewidth Revisited. 2017 abs/1702.02890 CoRR http://arxiv.org/abs/1702.02890 db/journals/corr/corr1702.html#FichteHMW17

Johannes Klaus Fichte Markus Hecher Michael Morak Stefan Woltran DynASP2.5: Dynamic Programming on Tree Decompositions in Action. 2017 abs/1706.09370 CoRR http://arxiv.org/abs/1706.09370 db/journals/corr/corr1706.html#FichteHMW17a

Bernhard Bliem Stefan Woltran Defensive Alliances in Graphs of Bounded Treewidth. 2017 abs/1707.04251 CoRR http://arxiv.org/abs/1707.04251 db/journals/corr/corr1707.html#BliemW17

Ricardo Gonçalves 0001 Matthias Knorr 0001 João Leite 0001 Stefan Woltran When You Must Forget: beyond strong persistence when forgetting in answer set programming. 2017 abs/1707.05152 CoRR http://arxiv.org/abs/1707.05152 db/journals/corr/corr1707.html#0001KLW17

Nadia Creignou Reinhard Pichler Stefan Woltran Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? 2017 abs/1711.07786 CoRR http://arxiv.org/abs/1711.07786 db/journals/corr/corr1711.html#abs-1711-07786

Ringo Baumann Wolfgang Dvorák Thomas Linsbichler Christof Spanring Hannes Strass Stefan Woltran On rejected arguments and implicit conflicts: The hidden power of argumentation semantics. 244-284 2016 241 Artif. Intell. https://doi.org/10.1016/j.artint.2016.09.004 db/journals/ai/ai241.html#BaumannDLSSW16

Michael Abseher Martin Gebser Nysret Musliu Torsten Schaub Stefan Woltran Shift Design with Answer Set Programming. 1-25 2016 147 Fundam. Informaticae 1 https://doi.org/10.3233/FI-2016-1396 db/journals/fuin/fuin147.html#AbseherGMSW16

Bernhard Bliem Günther Charwat Markus Hecher Stefan Woltran D-FLAT<sup>2</sup>: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy. 27-61 2016 147 Fundam. Informaticae 1 https://doi.org/10.3233/FI-2016-1397 db/journals/fuin/fuin147.html#BliemCHW16

Ringo Baumann Stefan Woltran The role of self-attacking arguments in characterizations of equivalence notions. 1293-1313 2016 26 J. Log. Comput. 4 https://doi.org/10.1093/logcom/exu010 db/journals/logcom/logcom26.html#BaumannW16

Nadia Creignou Odile Papini Stefan Rümmele Stefan Woltran Belief Merging within Fragments of Propositional Logic. 20 2016 17 ACM Trans. Comput. Log. 3 https://doi.org/10.1145/2898436 db/journals/tocl/tocl17.html#CreignouPRW16

Manuel Bichler Michael Morak Stefan Woltran The power of non-ground rules in Answer Set Programming. 552-569 2016 16 Theory Pract. Log. Program. 5-6 https://doi.org/10.1017/S1471068416000338 db/journals/tplp/tplp16.html#BichlerMW16

Bernhard Bliem Günther Charwat Markus Hecher Stefan Woltran Subset Minimization in Dynamic Programming on Tree Decompositions. 2016 AAAI Workshop: Beyond NP http://www.aaai.org/ocs/index.php/WS/AAAIW16/paper/view/12562 conf/aaai/2016np db/conf/aaai/np2016.html#BliemCHW16 Stefan Woltran Towards Advanced Systems for Abstract Argumentation. 1-3 2016 SAFA@COMMA https://ceur-ws.org/Vol-1672/woltran.pdf conf/comma/2016safa db/conf/comma/safa2016.html#Woltran16 Sarah Alice Gaggl Thomas Linsbichler Marco Maratea Stefan Woltran Introducing the Second International Competition on Computational Models of Argumentation. 4-9 2016 SAFA@COMMA https://ceur-ws.org/Vol-1672/iccma17_cfp.pdf conf/comma/2016safa db/conf/comma/safa2016.html#GagglLMW16 Ringo Baumann Thomas Linsbichler Stefan Woltran Verifiability of Argumentation Semantics. 83-94 2016 COMMA https://doi.org/10.3233/978-1-61499-686-6-83 conf/comma/2016 db/conf/comma/comma2016.html#BaumannLW16 Bernhard Bliem Markus Hecher Stefan Woltran On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions. 107-118 2016 COMMA https://doi.org/10.3233/978-1-61499-686-6-107 conf/comma/2016 db/conf/comma/comma2016.html#BliemHW16 Georg Heissenberger Stefan Woltran GrappaVis - A System for Advanced Graph-Based Argumentation. 473-474 2016 COMMA https://doi.org/10.3233/978-1-61499-686-6-473 conf/comma/2016 db/conf/comma/comma2016.html#HeissenbergerW16 Adrian Haret Andreas Pfandler Stefan Woltran Beyond IC Postulates: Classification Criteria for Merging Operators. 372-380 2016 ECAI https://doi.org/10.3233/978-1-61499-672-9-372 conf/ecai/2016 db/conf/ecai/ecai2016.html#HaretPW16 Gerhard Brewka Jean-Guy Mailly Stefan Woltran Translation-Based Revision and Merging for Minimal Horn Reasoning. 734-742 2016 ECAI https://doi.org/10.3233/978-1-61499-672-9-734 conf/ecai/2016 db/conf/ecai/ecai2016.html#BrewkaMW16 Bernhard Bliem Sebastian Ordyniak Stefan Woltran Clique-Width and Directed Width Measures for Answer-Set Programming. 1105-1113 2016 ECAI https://doi.org/10.3233/978-1-61499-672-9-1105 conf/ecai/2016 db/conf/ecai/ecai2016.html#BliemOW16 Bernhard Bliem Stefan Woltran Equivalence Between Answer-Set Programs Under (Partially) Fixed Input. 95-111 2016 FoIKS https://doi.org/10.1007/978-3-319-30024-5_6 conf/foiks/2016 db/conf/foiks/foiks2016.html#BliemW16 Bernhard Bliem Benjamin Kaufmann Torsten Schaub Stefan Woltran ASP for Anytime Dynamic Programming on Tree Decompositions. 979-986 2016 IJCAI http://www.ijcai.org/Abstract/16/143 conf/ijcai/2016 db/conf/ijcai/ijcai2016.html#BliemKSW16 Paul E. Dunne Christof Spanring Thomas Linsbichler Stefan Woltran Investigating the Relationship between Argumentation Semantics via Signatures. 1051-1057 2016 IJCAI http://www.ijcai.org/Abstract/16/153 conf/ijcai/2016 db/conf/ijcai/ijcai2016.html#DunneSLW16 Adrian Haret Jean-Guy Mailly Stefan Woltran Distributing Knowledge into Simple Bases. 1109-1115 2016 IJCAI http://www.ijcai.org/Abstract/16/161 conf/ijcai/2016 db/conf/ijcai/ijcai2016.html#HaretMW16 Michael Abseher Marius Moldovan Stefan Woltran Providing Built-In Counters in a Declarative Dynamic Programming Environment. 3-16 2016 KI https://doi.org/10.1007/978-3-319-46073-4_1 conf/ki/2016 db/conf/ki/ki2016.html#AbseherMW16 Jérôme Delobelle Adrian Haret Sébastien Konieczny Jean-Guy Mailly Julien Rossit Stefan Woltran Merging of Abstract Argumentation Frameworks. 33-42 2016 KR http://www.aaai.org/ocs/index.php/KR/KR16/paper/view/12872 conf/kr/2016 db/conf/kr/kr2016.html#DelobelleHKMRW16 Massimiliano Giacomin Thomas Linsbichler Stefan Woltran On the Functional Completeness of Argumentation Semantics. 43-52 2016 KR http://www.aaai.org/ocs/index.php/KR/KR16/paper/view/12866 conf/kr/2016 db/conf/kr/kr2016.html#GiacominLW16 Manuel Bichler Michael Morak Stefan Woltran lpopt: A Rule Optimization Tool for Answer Set Programming. 114-130 2016 LOPSTR https://doi.org/10.1007/978-3-319-63139-4_7 conf/lopstr/2016 db/conf/lopstr/lopstr2016.html#BichlerMW16 Günther Charwat Stefan Woltran Dynamic Programming-based QBF Solving. 27-40 2016 QBF@SAT conf/sat/2016qbf db/conf/sat/qbf2016.html#CharwatW16

Ringo Baumann Thomas Linsbichler Stefan Woltran Verifiability of Argumentation Semantics. 2016 abs/1603.09502 CoRR http://arxiv.org/abs/1603.09502 db/journals/corr/corr1603.html#BaumannLW16

Adrian Haret Jean-Guy Mailly Stefan Woltran Distributing Knowledge into Simple Bases. 2016 abs/1603.09511 CoRR http://arxiv.org/abs/1603.09511 db/journals/corr/corr1603.html#HaretMW16

Bernhard Bliem Sebastian Ordyniak Stefan Woltran Clique-Width and Directed Width Measures for Answer-Set Programming. 2016 abs/1606.09449 CoRR http://arxiv.org/abs/1606.09449 db/journals/corr/corr1606.html#BliemOW16

Manuel Bichler Michael Morak Stefan Woltran The Power of Non-Ground Rules in Answer Set Programming. 2016 abs/1608.01856 CoRR http://arxiv.org/abs/1608.01856 db/journals/corr/corr1608.html#BichlerMW16

Manuel Bichler Michael Morak Stefan Woltran lpopt: A Rule Optimization Tool for Answer Set Programming. 2016 abs/1608.05675 CoRR http://arxiv.org/abs/1608.05675 db/journals/corr/corr1608.html#BichlerMW16a

Johannes Klaus Fichte Markus Hecher Michael Morak Stefan Woltran Counting Answer Sets via Dynamic Programming. 2016 abs/1612.07601 CoRR http://arxiv.org/abs/1612.07601 db/journals/corr/corr1612.html#FichteHMW16

Günther Charwat Wolfgang Dvorák Sarah Alice Gaggl Johannes Peter Wallner Stefan Woltran Methods for solving reasoning problems in abstract argumentation - A survey. 28-63 2015 220 Artif. Intell. https://doi.org/10.1016/j.artint.2014.11.008 https://www.wikidata.org/entity/Q28083532 db/journals/ai/ai220.html#CharwatDGWW15

Paul E. Dunne Wolfgang Dvorák Thomas Linsbichler Stefan Woltran Characteristics of multiple viewpoints in abstract argumentation. 153-178 2015 228 Artif. Intell. https://doi.org/10.1016/j.artint.2015.07.006 db/journals/ai/ai228.html#DunneDLW15

João Leite 0001 Tran Cao Son Paolo Torroni Stefan Woltran Applications of logical approaches to argumentation. 1-2 2015 6 Argument Comput. 1 https://doi.org/10.1080/19462166.2014.1003407 https://www.wikidata.org/entity/Q57977914 db/journals/argcom/argcom6.html#LeiteSTW15

Martin Diller Johannes Peter Wallner Stefan Woltran Reasoning in abstract dialectical frameworks using quantified Boolean formulas. 149-177 2015 6 Argument Comput. 2 https://doi.org/10.1080/19462166.2015.1036922 db/journals/argcom/argcom6.html#DillerWW15

Andreas Pfandler Reinhard Pichler Stefan Woltran The complexity of handling minimal solutions in logic-based abduction. 805-825 2015 25 J. Log. Comput. 3 https://doi.org/10.1093/logcom/exu053 db/journals/logcom/logcom25.html#PfandlerPW15

Sarah Alice Gaggl Norbert Manthey Alessandro Ronca Johannes Peter Wallner Stefan Woltran Improved answer-set programming encodings for abstract argumentation. 434-448 2015 15 Theory Pract. Log. Program. 4-5 https://doi.org/10.1017/S1471068415000149 db/journals/tplp/tplp15.html#GagglMRWW15

Johannes Klaus Fichte Miroslaw Truszczynski Stefan Woltran Dual-normal logic programs - the forgotten class. 495-510 2015 15 Theory Pract. Log. Program. 4-5 https://doi.org/10.1017/S1471068415000186 db/journals/tplp/tplp15.html#FichteTW15

Thomas Eiter Hannes Strass Miroslaw Truszczynski Stefan Woltran A Glimpse on Gerhard Brewka's Contributions to Artificial Intelligence. 1-16 2015 Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation https://doi.org/10.1007/978-3-319-14726-0_1 conf/birthday/2014brewka db/conf/birthday/brewka2014.html#EiterSTW14 Michael Abseher Frederico Dusberger Nysret Musliu Stefan Woltran Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning. 275-282 2015 IJCAI http://ijcai.org/Abstract/15/045 conf/ijcai/2015 db/conf/ijcai/ijcai2015.html#AbseherDMW15 Martin Diller Adrian Haret Thomas Linsbichler Stefan Rümmele Stefan Woltran An Extension-Based Approach to Belief Revision in Abstract Argumentation. 2926-2932 2015 IJCAI http://ijcai.org/Abstract/15/414 conf/ijcai/2015 db/conf/ijcai/ijcai2015.html#DillerHLRW15 Adrian Haret Stefan Rümmele Stefan Woltran Merging in the Horn Fragment. 3041-3047 2015 IJCAI http://ijcai.org/Abstract/15/429 conf/ijcai/2015 db/conf/ijcai/ijcai2015.html#HaretRW15 Andreas Pfandler Stefan Rümmele Johannes Peter Wallner Stefan Woltran On the Parameterized Complexity of Belief Revision. 3149-3155 2015 IJCAI http://ijcai.org/Abstract/15/444 conf/ijcai/2015 db/conf/ijcai/ijcai2015.html#PfandlerRWW15 Wolfgang Dvorák Matti Järvisalo Johannes Peter Wallner Stefan Woltran Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract). 4173-4177 2015 IJCAI http://ijcai.org/Abstract/15/590 conf/ijcai/2015 db/conf/ijcai/ijcai2015.html#DvorakJWW15 Massimiliano Giacomin Thomas Linsbichler Stefan Woltran On the Functional Completeness of Argumentation Semantics. 43-54 2015 DKB/KIK@KI https://ceur-ws.org/Vol-1444/paper4.pdf conf/ki/2015kik db/conf/ki/kik2015.html#GiacominLW15 Michael Abseher Martin Gebser Nysret Musliu Torsten Schaub Stefan Woltran Shift Design with Answer Set Programming. 32-39 2015 LPNMR https://doi.org/10.1007/978-3-319-23264-5_4 conf/lpnmr/2015 db/conf/lpnmr/lpnmr2015.html#AbseherGMSW15 Günther Charwat Stefan Woltran Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams. 213-227 2015 LPNMR https://doi.org/10.1007/978-3-319-23264-5_19 conf/lpnmr/2015 db/conf/lpnmr/lpnmr2015.html#CharwatW15 Stefan Woltran Dynamic Programming on Tree Decompositions in Practice - Some Lessons Learned. 22 2015 SYNASC https://doi.org/10.1109/SYNASC.2015.13 https://doi.ieeecomputersociety.org/10.1109/SYNASC.2015.13 conf/synasc/2015 db/conf/synasc/synasc2015.html#Woltran15 Rémi Brochenin Thomas Linsbichler Marco Maratea Johannes Peter Wallner Stefan Woltran Abstract Solvers for Dung's Argumentation Frameworks. 40-58 2015 TAFA https://doi.org/10.1007/978-3-319-28460-6_3 conf/tafa/2015 db/conf/tafa/tafa2015.html#BrocheninLMWW15 Thomas Linsbichler Christof Spanring Stefan Woltran The Hidden Power of Abstract Argumentation Semantics. 146-162 2015 TAFA https://doi.org/10.1007/978-3-319-28460-6_9 conf/tafa/2015 db/conf/tafa/tafa2015.html#LinsbichlerSW15 Bernhard Bliem Stefan Woltran Complexity of Secure Sets. 64-77 2015 WG https://doi.org/10.1007/978-3-662-53174-7_5 conf/wg/2015 db/conf/wg/wg2015.html#BliemW15 Thomas Eiter Hannes Strass Miroslaw Truszczynski Stefan Woltran Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation - Essays Dedicated to Gerhard Brewka on the Occasion of His 60th Birthday 2015 Springer Lecture Notes in Computer Science 9060 https://doi.org/10.1007/978-3-319-14726-0 978-3-319-14725-3 Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation db/conf/birthday/brewka2014.html

Johannes Klaus Fichte Miroslaw Truszczynski Stefan Woltran Dual-normal Logic Programs - the Forgotten Class. 2015 abs/1507.05388 CoRR http://arxiv.org/abs/1507.05388 db/journals/corr/corr1507.html#FichteTW15

Sarah Alice Gaggl Norbert Manthey Alessandro Ronca Johannes Peter Wallner Stefan Woltran Improved Answer-Set Programming Encodings for Abstract Argumentation. 2015 abs/1507.06689 CoRR http://arxiv.org/abs/1507.06689 db/journals/corr/corr1507.html#GagglMRWW15

Wolfgang Dvorák Matti Järvisalo Johannes Peter Wallner Stefan Woltran Complexity-sensitive decision procedures for abstract argumentation. 53-78 2014 206 Artif. Intell. https://doi.org/10.1016/j.artint.2013.10.001 db/journals/ai/ai206.html#DvorakJWW14

Gerhard Brewka Sylwia Polberg Stefan Woltran Generalizations of Dung Frameworks and Their Role in Formal Argumentation. 30-38 2014 29 IEEE Intell. Syst. 1 https://doi.org/10.1109/MIS.2013.122 http://doi.ieeecomputersociety.org/10.1109/MIS.2013.122 db/journals/expert/expert29.html#BrewkaPW14

Nadia Creignou Odile Papini Reinhard Pichler Stefan Woltran Belief revision within fragments of propositional logic. 427-449 2014 80 J. Comput. Syst. Sci. 2 https://doi.org/10.1016/j.jcss.2013.08.002 db/journals/jcss/jcss80.html#CreignouPPW14

Reinhard Pichler Stefan Rümmele Stefan Szeider Stefan Woltran Tractable answer-set programming with weight constraints: bounded treewidth is not enough. 141-164 2014 14 Theory Pract. Log. Program. 2 https://doi.org/10.1017/S1471068412000099 db/journals/tplp/tplp14.html#PichlerRSW14

Mario Alviano Wolfgang Faber 0001 Stefan Woltran Complexity of super-coherence problems in ASP. 339-361 2014 14 Theory Pract. Log. Program. 3 https://doi.org/10.1017/S147106841300001X db/journals/tplp/tplp14.html#AlvianoFW14

Martin Diller Johannes Peter Wallner Stefan Woltran Reasoning in Abstract Dialectical Frameworks Using Quantified Boolean Formulas. 241-252 2014 COMMA https://doi.org/10.3233/978-1-61499-436-7-241 conf/comma/2014 db/conf/comma/comma2014.html#DillerWW14 Wolfgang Dvorák Thomas Linsbichler Emilia Oikarinen Stefan Woltran Resolution-Based Grounded Semantics Revisited. 269-280 2014 COMMA https://doi.org/10.3233/978-1-61499-436-7-269 conf/comma/2014 db/conf/comma/comma2014.html#DvorakLOW14 Ringo Baumann Wolfgang Dvorák Thomas Linsbichler Hannes Strass Stefan Woltran Compact Argumentation Frameworks. 69-74 2014 ECAI https://doi.org/10.3233/978-1-61499-419-0-69 conf/ecai/2014 db/conf/ecai/ecai2014.html#BaumannDLSW14 Gerhard Brewka Stefan Woltran GRAPPA: A Semantical Framework for Graph-Based Argument Processing. 153-158 2014 ECAI https://doi.org/10.3233/978-1-61499-419-0-153 conf/ecai/2014 db/conf/ecai/ecai2014.html#BrewkaW14 Nadia Creignou Odile Papini Stefan Rümmele Stefan Woltran Belief merging within fragments of propositional logic. 231-236 2014 ECAI https://doi.org/10.3233/978-1-61499-419-0-231 conf/ecai/2014 db/conf/ecai/ecai2014.html#CreignouPRW14 Michael Abseher Bernhard Bliem Günther Charwat Frederico Dusberger Markus Hecher Stefan Woltran The D-FLAT System for Dynamic Programming on Tree Decompositions. 558-572 2014 JELIA https://doi.org/10.1007/978-3-319-11558-0_39 conf/jelia/2014 db/conf/jelia/jelia2014.html#AbseherBCDHW14 Paul E. Dunne Wolfgang Dvorák Thomas Linsbichler Stefan Woltran Characteristics of Multiple Viewpoints in Abstract Argumentation. 2014 KR http://www.aaai.org/ocs/index.php/KR/KR14/paper/view/7871 conf/kr/2014 db/conf/kr/kr2014.html#DunneDLW14 Dragan Doder Stefan Woltran Probabilistic Argumentation Frameworks - A Logical Approach. 134-147 2014 SUM https://doi.org/10.1007/978-3-319-11508-5_12 conf/sum/2014 db/conf/sum/sum2014.html#DoderW14 Madalina Croitoru Sebastian Rudolph Stefan Woltran Christophe Gonzales Graph Structures for Knowledge Representation and Reasoning - Third International Workshop, GKR 2013, Beijing, China, August 3, 2013. Revised Selected Papers 2014 Springer Lecture Notes in Computer Science 8323 https://doi.org/10.1007/978-3-319-04534-4 978-3-319-04533-7 GKR db/conf/gkr/gkr2013.html

Tomi Janhunen Emilia Oikarinen Hans Tompits Stefan Woltran Modularity Aspects of Disjunctive Stable Models. 2014 abs/1401.3484 CoRR http://arxiv.org/abs/1401.3484 db/journals/corr/corr1401.html#JanhunenOTW14

Wolfgang Dvorák Stefan Woltran On the Intertranslatability of Argumentation Semantics. 2014 abs/1401.3895 CoRR http://arxiv.org/abs/1401.3895 db/journals/corr/corr1401.html#DvorakW14

Nadia Creignou Odile Papini Stefan Rümmele Stefan Woltran Belief merging within fragments of propositional logic. 2014 abs/1404.6445 CoRR http://arxiv.org/abs/1404.6445 db/journals/corr/corr1404.html#CreignouPRW14

Ringo Baumann Wolfgang Dvorák Thomas Linsbichler Hannes Strass Stefan Woltran Compact Argumentation Frameworks. 2014 abs/1404.7734 CoRR http://arxiv.org/abs/1404.7734 db/journals/corr/corr1404.html#BaumannDLSW14

Bernhard Bliem Stefan Woltran Complexity of Secure Sets. 2014 abs/1411.6549 CoRR http://arxiv.org/abs/1411.6549 db/journals/corr/corr1411.html#BliemW14

Paul E. Dunne Wolfgang Dvorák Stefan Woltran Parametric properties of ideal semantics. 1-28 2013 202 Artif. Intell. https://doi.org/10.1016/j.artint.2013.06.004 db/journals/ai/ai202.html#DunneDW13

Wolfgang Faber 0001 Miroslaw Truszczynski Stefan Woltran Strong Equivalence of Qualitative Optimization Problems. 351-391 2013 47 J. Artif. Intell. Res. https://doi.org/10.1613/jair.3991 db/journals/jair/jair47.html#FaberTW13

Thomas Eiter Michael Fink 0001 Jörg Pührer Hans Tompits Stefan Woltran Model-based recasting in answer-set programming. 75-104 2013 23 J. Appl. Non Class. Logics 1-2 https://doi.org/10.1080/11663081.2013.799318 db/journals/jancl/jancl23.html#EiterFPTW13

Sarah Alice Gaggl Stefan Woltran The cf2 argumentation semantics revisited. 925-949 2013 23 J. Log. Comput. 5 https://doi.org/10.1093/logcom/exs011 db/journals/logcom/logcom23.html#GagglW13

Reinhard Pichler Axel Polleres Sebastian Skritek Stefan Woltran Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries. 351-393 2013 4 Semantic Web 4 https://doi.org/10.3233/SW-2012-0076 https://www.wikidata.org/entity/Q120984746 db/journals/semweb/semweb4.html#PichlerPSW13

James P. Delgrande Torsten Schaub Hans Tompits Stefan Woltran A Model-Theoretic Approach to Belief Change in Answer Set Programming. 14:1-14:46 2013 14 ACM Trans. Comput. Log. 2 https://doi.org/10.1145/2480759.2480766 db/journals/tocl/tocl14.html#DelgrandeSTW13

Wolfgang Faber 0001 Miroslaw Truszczynski Stefan Woltran Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence. 2013 AAAI https://doi.org/10.1609/aaai.v27i1.8593 conf/aaai/2013 db/conf/aaai/aaai2013.html#FaberTW13 297-303 Sylwia Polberg Johannes Peter Wallner Stefan Woltran Admissibility in the Abstract Dialectical Framework. 102-118 2013 CLIMA https://doi.org/10.1007/978-3-642-40624-9_7 conf/clima/2013 db/conf/clima/clima2013.html#PolbergWW13 Johannes Peter Wallner Georg Weissenbacher Stefan Woltran Advanced SAT Techniques for Abstract Argumentation. 138-154 2013 CLIMA https://doi.org/10.1007/978-3-642-40624-9_9 https://www.wikidata.org/entity/Q62040443 conf/clima/2013 db/conf/clima/clima2013.html#WallnerWW13 Anthony Hunter Stefan Woltran Structural Properties for Deductive Argument Systems. 278-289 2013 ECSQARU https://doi.org/10.1007/978-3-642-39091-3_24 conf/ecsqaru/2013 db/conf/ecsqaru/ecsqaru2013.html#HunterW13 Gerhard Brewka Hannes Strass Stefan Ellmauthaler Johannes Peter Wallner Stefan Woltran Abstract Dialectical Frameworks Revisited. 2013 IJCAI http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6551 http://ijcai.org/Abstract/13/125 conf/ijcai/2013 db/conf/ijcai/ijcai2013.html#BrewkaSEWW13 803-809 Nadia Creignou Reinhard Pichler Stefan Woltran Do Hard SAT-Related Reasoning Tasks Become Easier in the Krom Fragment? 2013 IJCAI http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6622 http://ijcai.org/Abstract/13/128 conf/ijcai/2013 db/conf/ijcai/ijcai2013.html#CreignouPW13 824-831 Bernhard Bliem Reinhard Pichler Stefan Woltran Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem. 28-40 2013 IPEC https://doi.org/10.1007/978-3-319-03898-8_4 conf/iwpec/2013 db/conf/iwpec/ipec2013.html#BliemPW13 Thomas Ambroz Günther Charwat Andreas Jusits Johannes Peter Wallner Stefan Woltran ARVis: Visualizing Relations between Answer Sets. 73-78 2013 LPNMR https://doi.org/10.1007/978-3-642-40564-8_8 conf/lpnmr/2013 db/conf/lpnmr/lpnmr2013.html#AmbrozCJWW13 James P. Delgrande Pavlos Peppas Stefan Woltran AGM-Style Belief Revision of Logic Programs under Answer Set Semantics. 264-276 2013 LPNMR https://doi.org/10.1007/978-3-642-40564-8_27 conf/lpnmr/2013 db/conf/lpnmr/lpnmr2013.html#DelgrandePW13 João Leite 0001 Tran Cao Son Paolo Torroni Leon van der Torre Stefan Woltran Computational Logic in Multi-Agent Systems - 14th International Workshop, CLIMA XIV, Corunna, Spain, September 16-18, 2013. Proceedings 2013 Springer Lecture Notes in Computer Science 8143 https://doi.org/10.1007/978-3-642-40624-9 https://www.wikidata.org/entity/Q57977921 978-3-642-40623-2 CLIMA db/conf/clima/clima2013.html

Günther Charwat Johannes Peter Wallner Stefan Woltran Utilizing ASP for Generating and Visualizing Argumentation Frameworks http://arxiv.org/abs/1301.1388 2013 CoRR abs/1301.1388 db/journals/corr/corr1301.html#abs-1301-1388

Wolfgang Dvorák Reinhard Pichler Stefan Woltran Towards fixed-parameter tractable algorithms for abstract argumentation. 1-37 2012 186 Artif. Intell. https://doi.org/10.1016/j.artint.2012.03.005 db/journals/ai/ai186.html#DvorakPW12

Bernhard Bliem Michael Morak Stefan Woltran D-FLAT: Declarative problem solving using tree decompositions and answer-set programming. 445-464 2012 12 Theory Pract. Log. Program. 4-5 https://doi.org/10.1017/S1471068412000129 db/journals/tplp/tplp12.html#BliemMW12

Ringo Baumann Gerhard Brewka Wolfgang Dvorák Stefan Woltran Parameterized Splitting: A Simple Modification-Based Approach. 57-71 2012 Correct Reasoning https://doi.org/10.1007/978-3-642-30743-0_5 conf/birthday/2012lifschitz db/conf/birthday/lifschitz2012.html#BaumannBDW12 Martin Lackner Reinhard Pichler Stefan Rümmele Stefan Woltran Multicut on Graphs of Bounded Clique-Width. 115-126 2012 COCOA https://doi.org/10.1007/978-3-642-31770-5_11 conf/cocoa/2012 db/conf/cocoa/cocoa2012.html#LacknerPRW12 Michael Morak Stefan Woltran Preprocessing of Complex Non-Ground Rules in Answer Set Programming. 247-258 2012 ICLP (Technical Communications) https://doi.org/10.4230/LIPIcs.ICLP.2012.247 conf/iclp/2012 db/conf/iclp/iclp2012.html#MorakW12 Nadia Creignou Odile Papini Reinhard Pichler Stefan Woltran Belief Revision within Fragments of Propositional Logic. 2012 KR http://www.aaai.org/ocs/index.php/KR/KR12/paper/view/4512 conf/kr/2012 db/conf/kr/kr2012.html#CreignouPPW12 Wolfgang Dvorák Matti Järvisalo Johannes Peter Wallner Stefan Woltran Complexity-Sensitive Decision Procedures for Abstract Argumentation. 2012 KR http://www.aaai.org/ocs/index.php/KR/KR12/paper/view/4508 conf/kr/2012 db/conf/kr/kr2012.html#DvorakJWW12 Wolfgang Faber 0001 Miroslaw Truszczynski Stefan Woltran Strong Equivalence of Qualitative Optimization Problems. 2012 KR http://www.aaai.org/ocs/index.php/KR/KR12/paper/view/4518 conf/kr/2012 db/conf/kr/kr2012.html#FaberTW12 Michael Morak Nysret Musliu Reinhard Pichler Stefan Rümmele Stefan Woltran Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. 130-144 2012 LION https://doi.org/10.1007/978-3-642-34413-8_10 conf/lion/2012 db/conf/lion/lion2012.html#MorakMPRW12 Wolfgang Dvorák Stefan Szeider Stefan Woltran Abstract Argumentation via Monadic Second Order Logic. 85-98 2012 SUM https://doi.org/10.1007/978-3-642-33362-0_7 conf/sum/2012 db/conf/sum/sum2012.html#DvorakSW12 Bart Verheij Stefan Szeider Stefan Woltran Computational Models of Argument - Proceedings of COMMA 2012, Vienna, Austria, September 10-12, 2012 2012 IOS Press Frontiers in Artificial Intelligence and Applications 245 978-1-61499-110-6 http://www.booksonline.iospress.nl/Content/View.aspx?piid=32171 COMMA db/conf/comma/comma2012.html

Reinhard Pichler Stefan Rümmele Stefan Szeider Stefan Woltran Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough http://arxiv.org/abs/1204.3040 2012 CoRR abs/1204.3040 db/journals/corr/corr1204.html#abs-1204-3040

Bernhard Bliem Michael Morak Stefan Woltran D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming http://arxiv.org/abs/1210.1931 2012 CoRR abs/1210.1931 db/journals/corr/corr1210.html#abs-1210-1931

Mario Alviano Wolfgang Faber 0001 Stefan Woltran Complexity of super-coherence problems in ASP http://arxiv.org/abs/1212.5895 2012 CoRR abs/1212.5895 db/journals/corr/corr1212.html#abs-1212-5895

Emilia Oikarinen Stefan Woltran Characterizing strong equivalence for argumentation frameworks. 1985-2009 2011 175 Artif. Intell. 14-15 https://doi.org/10.1016/j.artint.2011.06.003 https://www.wikidata.org/entity/Q56551823 db/journals/ai/ai175.html#OikarinenW11

Marcello Balduccini Stefan Woltran Special issue on answer set programming. 105-106 2011 24 AI Commun. 2 https://doi.org/10.3233/AIC-2011-0497 db/journals/aicom/aicom24.html#BalducciniW11

Nadia Creignou Johannes Schmidt 0001 Michael Thomas 0001 Stefan Woltran Complexity of logic-based argumentation in Post's framework. 107-129 2011 2 Argument Comput. 2-3 https://doi.org/10.1080/19462166.2011.629736 db/journals/argcom/argcom2.html#Creignou0TW11

Wolfgang Dvorák Stefan Woltran On the Intertranslatability of Argumentation Semantics. 445-475 2011 41 J. Artif. Intell. Res. https://doi.org/10.1613/jair.3318 db/journals/jair/jair41.html#DvorakW11

Wolfgang Faber 0001 Stefan Woltran Manifold Answer-Set Programs and Their Applications. 44-63 2011 Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning https://doi.org/10.1007/978-3-642-20832-4_4 conf/birthday/2011gelfond db/conf/birthday/gelfond2011.html#FaberW11 Mario Alviano Wolfgang Faber 0001 Stefan Woltran Complexity of Super-Coherence Problems in Answer Set Programming. 131-145 2011 CILC https://ceur-ws.org/Vol-810/paper-l08.pdf conf/cilc/2011 db/conf/cilc/cilc2011.html#AlvianoFW11 Sarah Alice Gaggl Stefan Woltran Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets. 38-49 2011 ECSQARU https://doi.org/10.1007/978-3-642-22152-1_4 conf/ecsqaru/2011 db/conf/ecsqaru/ecsqaru2011.html#GagglW11 Michael Morak Nysret Musliu Reinhard Pichler Stefan Rümmele Stefan Woltran A New Tree-Decomposition Based Algorithm for Answer Set Programming. 916-918 2011 ICTAI https://doi.org/10.1109/ICTAI.2011.154 https://doi.ieeecomputersociety.org/10.1109/ICTAI.2011.154 conf/ictai/2011 db/conf/ictai/ictai2011.html#MorakMPRW11 Gerhard Brewka Paul E. Dunne Stefan Woltran Relating the Semantics of Abstract Dialectical Frameworks and Standard AFs. 780-785 2011 IJCAI https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-137 conf/ijcai/2011 db/conf/ijcai/ijcai2011.html#BrewkaDW11 Wolfgang Dvorák Paul E. Dunne Stefan Woltran Parametric Properties of Ideal Semantics. 851-856 2011 IJCAI https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-148 conf/ijcai/2011 db/conf/ijcai/ijcai2011.html#DvorakDW11 Wolfgang Dvorák Sarah Alice Gaggl Johannes Peter Wallner Stefan Woltran Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems. 114-133 2011 INAP/WLP https://doi.org/10.1007/978-3-642-41524-1_7 conf/inap/2011 db/conf/inap/inap2011.html#DvorakGWW11 Wolfgang Dvorák Michael Morak Clemens Nopp Stefan Woltran dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation. 259-268 2011 INAP/WLP https://doi.org/10.1007/978-3-642-41524-1_14 conf/inap/2011 db/conf/inap/inap2011.html#DvorakMNW11

Wolfgang Dvorák Michael Morak Clemens Nopp Stefan Woltran dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation http://arxiv.org/abs/1108.4804 2011 CoRR abs/1108.4804 db/journals/corr/corr1108.html#abs-1108-4804

Wolfgang Dvorák Sarah Alice Gaggl Johannes Peter Wallner Stefan Woltran Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems http://arxiv.org/abs/1108.4942 2011 CoRR abs/1108.4942 db/journals/corr/corr1108.html#abs-1108-4942

Wolfgang Faber 0001 Miroslaw Truszczynski Stefan Woltran Strong Equivalence of Qualitative Optimization Problems http://arxiv.org/abs/1112.0791 2011 CoRR abs/1112.0791 db/journals/corr/corr1112.html#abs-1112-0791

Uwe Egly Sarah Alice Gaggl Stefan Woltran Answer-set programming encodings for argumentation frameworks. 147-177 2010 1 Argument Comput. 2 https://doi.org/10.1080/19462166.2010.486479 db/journals/argcom/argcom1.html#EglyGW10

Wolfgang Dvorák Stefan Woltran Complexity of semi-stable and stage semantics in argumentation frameworks. 425-430 2010 110 Inf. Process. Lett. 11 https://doi.org/10.1016/j.ipl.2010.04.005 db/journals/ipl/ipl110.html#DvorakW10

Gerhard Brewka Miroslaw Truszczynski Stefan Woltran Representing Preferences Among Sets. 2010 AAAI https://doi.org/10.1609/aaai.v24i1.7584 conf/aaai/2010 db/conf/aaai/aaai2010.html#BrewkaTW10 273-278 Reinhard Pichler Axel Polleres Sebastian Skritek Stefan Woltran Minimising RDF Graphs under Rules and Constraints Revisited. 2010 AMW https://ceur-ws.org/Vol-619/paper4.pdf conf/amw/2010 db/conf/amw/amw2010.html#PichlerPSW10 Reinhard Pichler Stefan Rümmele Stefan Woltran Multicut Algorithms via Tree Decompositions. 167-179 2010 CIAC https://doi.org/10.1007/978-3-642-13073-1_16 conf/ciac/2010 db/conf/ciac/ciac2010.html#PichlerRW10 Stefan Woltran Strong Equivalence in Argumentation. 14 2010 CLIMA https://doi.org/10.1007/978-3-642-14977-1_4 conf/clima/2010 db/conf/clima/clima2010.html#Woltran10 Wolfgang Dvorák Stefan Szeider Stefan Woltran Reasoning in Argumentation Frameworks of Bounded Clique-Width. 219-230 2010 COMMA https://doi.org/10.3233/978-1-60750-619-5-219 conf/comma/2010 db/conf/comma/comma2010.html#DvorakSW10 Sarah Alice Gaggl Stefan Woltran cf2 Semantics Revisited. 243-254 2010 COMMA https://doi.org/10.3233/978-1-60750-619-5-243 conf/comma/2010 db/conf/comma/comma2010.html#GagglW10 Stefan Woltran Equivalence between Extended Datalog Programs - A Brief Survey. 106-119 2010 Datalog https://doi.org/10.1007/978-3-642-24206-9_7 conf/datalog/2010 db/conf/datalog/datalog2010.html#Woltran10 Reinhard Pichler Stefan Woltran The Complexity of Handling Minimal Solutions in Logic-Based Abduction. 895-900 2010 ECAI https://doi.org/10.3233/978-1-60750-606-5-895 conf/ecai/2010 db/conf/ecai/ecai2010.html#PichlerW10 Nadia Creignou Johannes Schmidt 0001 Michael Thomas 0001 Stefan Woltran Sets of Boolean Connectives That Make Argumentation Easier. 117-129 2010 JELIA https://doi.org/10.1007/978-3-642-15675-5_12 conf/jelia/2010 db/conf/jelia/jelia2010.html#CreignouSTW10 Michael Morak Reinhard Pichler Stefan Rümmele Stefan Woltran A Dynamic-Programming Based ASP-Solver. 369-372 2010 JELIA https://doi.org/10.1007/978-3-642-15675-5_34 conf/jelia/2010 db/conf/jelia/jelia2010.html#MorakPRW10 Gerhard Brewka Stefan Woltran Abstract Dialectical Frameworks. 2010 KR http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1294 conf/kr/2010 db/conf/kr/kr2010.html#BrewkaW10 Wolfgang Dvorák Reinhard Pichler Stefan Woltran Towards Fixed-Parameter Tractable Algorithms for Argumentation. 2010 KR http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1331 conf/kr/2010 db/conf/kr/kr2010.html#DvorakPW10 Emilia Oikarinen Stefan Woltran Characterizing Strong Equivalence for Argumentation Frameworks. 2010 KR http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1332 conf/kr/2010 db/conf/kr/kr2010.html#OikarinenW10 Reinhard Pichler Stefan Rümmele Stefan Szeider Stefan Woltran Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. 2010 KR http://aaai.org/ocs/index.php/KR/KR2010/paper/view/1368 conf/kr/2010 db/conf/kr/kr2010.html#PichlerRSW10 Reinhard Pichler Stefan Rümmele Stefan Woltran Counting and Enumeration Problems with Bounded Treewidth. 387-404 2010 LPAR (Dakar) https://doi.org/10.1007/978-3-642-17511-4_22 conf/lpar/2010d db/conf/lpar/lpar2010d.html#PichlerRW10 Reinhard Pichler Axel Polleres Sebastian Skritek Stefan Woltran Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries. 133-148 2010 RR https://doi.org/10.1007/978-3-642-15918-3_11 https://www.wikidata.org/entity/Q58049452 conf/rr/2010 db/conf/rr/rr2010.html#PichlerPSW10

Philippe Besnard Anthony Hunter Stefan Woltran Encoding deductive argumentation in quantified Boolean formulae. 1406-1423 2009 173 Artif. Intell. 15 https://doi.org/10.1016/j.artint.2009.06.006 db/journals/ai/ai173.html#BesnardHW09

Uwe Egly Martina Seidl Stefan Woltran A solver for QBFs in negation normal form. 38-79 2009 14 Constraints An Int. J. 1 https://doi.org/10.1007/s10601-008-9055-y db/journals/constraints/constraints14.html#EglySW09

Tomi Janhunen Emilia Oikarinen Hans Tompits Stefan Woltran Modularity Aspects of Disjunctive Stable Models. 813-857 2009 35 J. Artif. Intell. Res. https://doi.org/10.1613/jair.2810 db/journals/jair/jair35.html#JanhunenOTW09

David Pearce 0001 Hans Tompits Stefan Woltran Characterising equilibrium logic and nested logic programs: Reductions and complexity<sup>, </sup>. 565-616 2009 9 Theory Pract. Log. Program. 5 https://doi.org/10.1017/S147106840999010X db/journals/tplp/tplp9.html#PearceTW09

Miroslaw Truszczynski Stefan Woltran Relativized hyperequivalence of logic programs for modular programming. 781-819 2009 9 Theory Pract. Log. Program. 6 https://doi.org/10.1017/S1471068409990159 db/journals/tplp/tplp9.html#TruszczynskiW09

James P. Delgrande Torsten Schaub Hans Tompits Stefan Woltran Merging Logic Programs under Answer Set Semantics. 160-174 2009 ICLP https://doi.org/10.1007/978-3-642-02846-5_17 conf/iclp/2009 db/conf/iclp/iclp2009.html#DelgrandeSTW09 Michael Jakl Reinhard Pichler Stefan Woltran Answer-Set Programming with Bounded Treewidth. 816-822 2009 IJCAI http://ijcai.org/Proceedings/09/Papers/140.pdf conf/ijcai/2009 db/conf/ijcai/ijcai2009.html#JaklPW09 Wolfgang Faber 0001 Stefan Woltran Manifold Answer-Set Programs for Meta-reasoning. 115-128 2009 LPNMR https://doi.org/10.1007/978-3-642-04238-6_12 conf/lpnmr/2009 db/conf/lpnmr/lpnmr2009.html#FaberW09 Reinhard Pichler Stefan Rümmele Stefan Woltran Belief Revision with Bounded Treewidth. 250-263 2009 LPNMR https://doi.org/10.1007/978-3-642-04238-6_22 conf/lpnmr/2009 db/conf/lpnmr/lpnmr2009.html#PichlerRW09 Johannes Oetsch Martina Seidl Hans Tompits Stefan Woltran ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions. 382-395 2009 LPNMR https://doi.org/10.1007/978-3-642-04238-6_32 conf/lpnmr/2009 db/conf/lpnmr/lpnmr2009.html#OetschSTW09 Wolfgang Dvorák Georg Gottlob Reinhard Pichler Stefan Woltran Alternation as a programming paradigm. 61-72 2009 PPDP https://doi.org/10.1145/1599410.1599419 https://www.wikidata.org/entity/Q59259591 conf/ppdp/2009 db/conf/ppdp/ppdp2009.html#DvorakGPW09

David Pearce 0001 Hans Tompits Stefan Woltran Characterising equilibrium logic and nested logic programs: Reductions and complexity http://arxiv.org/abs/0906.2228 2009 CoRR abs/0906.2228 db/journals/corr/corr0906.html#abs-0906-2228

Miroslaw Truszczynski Stefan Woltran Relativized hyperequivalence of logic programs for modular programming http://arxiv.org/abs/0907.4128 2009 CoRR abs/0907.4128 db/journals/corr/corr0907.html#abs-0907-4128

James P. Delgrande Torsten Schaub Hans Tompits Stefan Woltran A general approach to belief change in answer set programming http://arxiv.org/abs/0912.5511 2009 CoRR abs/0912.5511 db/journals/corr/corr0912.html#abs-0912-5511

Miroslaw Truszczynski Stefan Woltran Hyperequivalence of logic programs with respect to supported models. 331-365 2008 53 Ann. Math. Artif. Intell. 1-4 https://doi.org/10.1007/s10472-009-9119-8 db/journals/amai/amai53.html#TruszczynskiW08

Stefan Woltran A common view on strong, uniform, and other notions of equivalence in answer-set programming. 217-234 2008 8 Theory Pract. Log. Program. 2 https://doi.org/10.1017/S1471068407003250 db/journals/tplp/tplp8.html#Woltran08

Miroslaw Truszczynski Stefan Woltran Hyperequivalence of Logic Programs with Respect to Supported Models. 560-565 2008 AAAI conf/aaai/2008 db/conf/aaai/aaai2008.html#TruszczynskiW08 http://www.aaai.org/Library/AAAI/2008/aaai08-089.php Reinhard Pichler Axel Polleres Fang Wei 0001 Stefan Woltran dRDF: Entailment for Domain-Restricted RDF. 200-214 2008 ESWC https://doi.org/10.1007/978-3-540-68234-9_17 https://www.wikidata.org/entity/Q58049466 conf/esws/2008 db/conf/esws/eswc2008.html#PichlerPWW08 Martin Gebser Torsten Schaub Hans Tompits Stefan Woltran Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets. 24-41 2008 conf/foiks/2008 FoIKS https://doi.org/10.1007/978-3-540-77684-0_5 db/conf/foiks/foiks2008.html#GebserSTW08 Jörg Pührer Hans Tompits Stefan Woltran Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence. 561-575 2008 ICLP https://doi.org/10.1007/978-3-540-89982-2_47 conf/iclp/2008 db/conf/iclp/iclp2008.html#PuhrerTW08 Miroslaw Truszczynski Stefan Woltran Relativized Hyperequivalence of Logic Programs for Modular Programming. 576-590 2008 ICLP https://doi.org/10.1007/978-3-540-89982-2_48 conf/iclp/2008 db/conf/iclp/iclp2008.html#TruszczynskiW08 Uwe Egly Sarah Alice Gaggl Stefan Woltran ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming. 734-738 2008 ICLP https://doi.org/10.1007/978-3-540-89982-2_67 conf/iclp/2008 db/conf/iclp/iclp2008.html#EglyGW08 Miroslaw Truszczynski Stefan Woltran Hyperequivalence of Programs and Operators. 2008 ISAIM http://isaim2008.unl.edu/PAPERS/SS1-AI+Logic/MTruszczynski-ss1.pdf conf/isaim/2008 db/conf/isaim/isaim2008.html#TruszczynskiW08 James P. Delgrande Torsten Schaub Hans Tompits Stefan Woltran Belief Revision of Logic Programs under Answer Set Semantics. 411-421 2008 KR conf/kr/2008 db/conf/kr/kr2008.html#DelgrandeSTW08 http://www.aaai.org/Library/KR/2008/kr08-040.php Wolfgang Faber 0001 Hans Tompits Stefan Woltran Notions of Strong Equivalence for Logic Programs with Ordered Disjunction. 433-443 2008 KR conf/kr/2008 db/conf/kr/kr2008.html#FaberTW08 http://www.aaai.org/Library/KR/2008/kr08-042.php Michael Jakl Reinhard Pichler Stefan Rümmele Stefan Woltran Fast Counting with Bounded Treewidth. 436-450 2008 LPAR https://doi.org/10.1007/978-3-540-89439-1_31 conf/lpar/2008 db/conf/lpar/lpar2008.html#JaklPRW08

Thomas Eiter Wolfgang Faber 0001 Michael Fink 0001 Stefan Woltran Complexity results for answer set programming with bounded predicate arities and implications. 123-165 2007 51 Ann. Math. Artif. Intell. 2-4 https://doi.org/10.1007/s10472-008-9086-5 db/journals/amai/amai51.html#EiterFFW07

Thomas Eiter Michael Fink 0001 Stefan Woltran Semantical characterizations and complexity of equivalences in answer set programming. 2007 8 ACM Trans. Comput. Log. 3 https://doi.org/10.1145/1243996.1244000 db/journals/tocl/tocl8.html#EiterFW07 17

Johannes Oetsch Hans Tompits Stefan Woltran Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. 458-464 2007 conf/aaai/2007 AAAI db/conf/aaai/aaai2007.html#OetschTW07 http://www.aaai.org/Library/AAAI/2007/aaai07-072.php Thomas Eiter Michael Fink 0001 Hans Tompits Stefan Woltran Complexity Results for Checking Equivalence of Stratified Logic Programs. 330-335 2007 conf/ijcai/2007 IJCAI http://ijcai.org/Proceedings/07/Papers/051.pdf db/conf/ijcai/ijcai2007.html#EiterFTW07 Martin Brain Martin Gebser Jörg Pührer Torsten Schaub Hans Tompits Stefan Woltran Debugging ASP Programs by Means of ASP. 31-43 2007 conf/lpnmr/2007 LPNMR https://doi.org/10.1007/978-3-540-72200-7_5 db/conf/lpnmr/lpnmr2007.html#BrainGPSTW07 Michael Fink 0001 Reinhard Pichler Hans Tompits Stefan Woltran Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains. 123-135 2007 conf/lpnmr/2007 LPNMR https://doi.org/10.1007/978-3-540-72200-7_12 db/conf/lpnmr/lpnmr2007.html#FinkPTW07 Martin Gebser Torsten Schaub Hans Tompits Stefan Woltran Alternative Characterizations for Program Equivalence under Answer-Set Semantics: Preliminary Report. 2007 CENT https://ceur-ws.org/Vol-265/CENT2007-paper5.pdf conf/lpnmr/2007cent db/conf/lpnmr/cent2007.html#GebserSTW07 Tomi Janhunen Emilia Oikarinen Hans Tompits Stefan Woltran Modularity Aspects of Disjunctive Stable Models. 175-187 2007 conf/lpnmr/2007 LPNMR https://doi.org/10.1007/978-3-540-72200-7_16 db/conf/lpnmr/lpnmr2007.html#JanhunenOTW07 David Pearce 0001 Hans Tompits Stefan Woltran Relativised Equivalence in Equilibrium Logic and its Applications to Prediction and Explanation: Preliminary Report. 2007 CENT https://ceur-ws.org/Vol-265/CENT2007-paper6.pdf conf/lpnmr/2007cent db/conf/lpnmr/cent2007.html#PearceTW07 Stefan Woltran A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming. 2007 CENT https://ceur-ws.org/Vol-265/CENT2007-paper3.pdf conf/lpnmr/2007cent db/conf/lpnmr/cent2007.html#Woltran07 Johannes Oetsch Martina Seidl Hans Tompits Stefan Woltran Testing Relativised Uniform Equivalence under Answer-Set Projection in the System ccT. 241-246 2007 INAP/WLP https://doi.org/10.1007/978-3-642-00675-3_16 conf/wlp/2007 db/conf/wlp/wlp2007.html#OetschSTW07 Martin Gebser Jörg Pührer Torsten Schaub Hans Tompits Stefan Woltran spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics. 247-252 2007 INAP/WLP https://doi.org/10.1007/978-3-642-00675-3_17 conf/wlp/2007 db/conf/wlp/wlp2007.html#GebserPSTW07 David Pearce 0001 Axel Polleres Agustín Valverde Stefan Woltran Proceedings of the LPNMR'07 Workshop on Correspondence and Equivalence for Nonmonotonic Theories (CENT2007), Tempe, AZ, USA, May 14, 2007 CENT CEUR-WS.org CEUR Workshop Proceedings 265 2007 https://ceur-ws.org/Vol-265 https://nbn-resolving.org/urn:nbn:de:0074-265-5 db/conf/lpnmr/cent2007.html

Stefan Woltran A Common View on Strong, Uniform, and Other Notions of Equivalence in Answer-Set Programming http://arxiv.org/abs/0712.0948 2007 CoRR abs/0712.0948 db/journals/corr/corr0712.html#abs-0712-0948

Uwe Egly Stefan Woltran Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas. 133-144 2006 COMMA http://www.booksonline.iospress.nl/Content/View.aspx?piid=1934 conf/comma/2006 db/conf/comma/comma2006.html#EglyW06 Uwe Egly Martina Seidl Stefan Woltran A Solver for QBFs in Nonprenex Form. 477-481 2006 conf/ecai/2006 ECAI db/conf/ecai/ecai2006.html#EglySW06 Thomas Eiter Patrick Traxler Stefan Woltran An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs. 477-480 2006 conf/jelia/2006 JELIA https://doi.org/10.1007/11853886_41 db/conf/jelia/jelia2006.html#EiterTW06 Johannes Oetsch Martina Seidl Hans Tompits Stefan Woltran ccT: A Correspondence-Checking Tool for Logic Programs Under the Answer-Set Semantics. 502-505 2006 conf/jelia/2006 JELIA https://doi.org/10.1007/11853886_47 db/conf/jelia/jelia2006.html#OetschSTW06 Thomas Eiter Michael Fink 0001 Hans Tompits Patrick Traxler Stefan Woltran Replacements in Non-Ground Answer-Set Programming. 340-351 2006 conf/kr/2006 KR db/conf/kr/kr2006.html#EiterFTTW06 http://www.aaai.org/Library/KR/2006/kr06-036.php Thomas Eiter Michael Fink 0001 Hans Tompits Patrick Traxler Stefan Woltran Replacements in Non-Ground Answer-Set Programming. 145-153 2006 conf/wlp/2006 WLP http://www.kr.tuwien.ac.at/wlp06/24-final.ps.gz db/conf/wlp/wlp2006.html#EiterFTTW06 Johannes Oetsch Martina Seidl Hans Tompits Stefan Woltran A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results. 200-205 2006 conf/wlp/2006 WLP http://www.kr.tuwien.ac.at/wlp06/S01-final.ps.gz db/conf/wlp/wlp2006.html#OetschSTW06 Michael Fink 0001 Hans Tompits Stefan Woltran 20th Workshop on Logic Programming, Vienna, Austria, February 22--24, 2006 INFSYS Research Report 1843-06-02 WLP Technische Universität Wien, Austria 2006 db/conf/wlp/wlp2006.html http://www.kr.tuwien.ac.at/wlp06/proceedings.html

Uwe Egly Reinhard Pichler Stefan Woltran On deciding subsumption problems. 255-294 2005 43 Ann. Math. Artif. Intell. 1 https://doi.org/10.1007/s10472-005-0434-4 db/journals/amai/amai43.html#EglyPW05

Thomas Eiter Michael Fink 0001 Hans Tompits Stefan Woltran Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case. 695-700 2005 conf/aaai/2005 AAAI db/conf/aaai/aaai2005.html#EiterFTW05 http://www.aaai.org/Library/AAAI/2005/aaai05-109.php Hans Tompits Stefan Woltran Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. 2005 conf/asp/2005 Answer Set Programming https://ceur-ws.org/Vol-142/page115.pdf db/conf/asp/asp2005.html#TompitsW05 Philippe Besnard Torsten Schaub Hans Tompits Stefan Woltran Representing Paraconsistent Reasoning via Quantified Propositional Logic. 84-118 https://doi.org/10.1007/978-3-540-30597-2_4 2005 conf/dagstuhl/2005into Inconsistency Tolerance db/conf/dagstuhl/into2005.html#BesnardSTW05 Hans Tompits Stefan Woltran Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. 189-203 2005 conf/iclp/2005 ICLP https://doi.org/10.1007/11562931_16 db/conf/iclp/iclp2005.html#TompitsW05 Thomas Eiter Hans Tompits Stefan Woltran On Solution Correspondences in Answer-Set Programming. 97-102 2005 conf/ijcai/2005 IJCAI http://ijcai.org/Proceedings/05/Papers/1177.pdf db/conf/ijcai/ijcai2005.html#EiterTW05

Thomas Eiter Michael Fink 0001 Stefan Woltran Semantical Characterizations and Complexity of Equivalences in Answer Set Programming http://arxiv.org/abs/cs/0502078 2005 CoRR abs/cs/0502078 db/journals/corr/corr0502.html#abs-cs-0502078

James P. Delgrande Torsten Schaub Hans Tompits Stefan Woltran On Computing Belief Change Operations using Quantified Boolean Formulas. 801-826 2004 14 J. Log. Comput. 6 https://doi.org/10.1093/logcom/14.6.801 db/journals/logcom/logcom14.html#DelgrandeSTW04

Thomas Linke Hans Tompits Stefan Woltran On Acyclic and Head-Cycle Free Nested Logic Programs. 225-239 https://doi.org/10.1007/978-3-540-27775-0_16 2004 conf/iclp/2004 ICLP db/conf/iclp/iclp2004.html#LinkeTW04 Stefan Woltran Characterizations for Relativized Notions of Equivalence in Answer Set Programming. 161-173 https://doi.org/10.1007/978-3-540-30227-8_16 2004 conf/jelia/2004 JELIA db/conf/jelia/jelia2004.html#Woltran04 Thomas Eiter Wolfgang Faber 0001 Michael Fink 0001 Gerald Pfeifer Stefan Woltran Complexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. 377-387 2004 conf/kr/2004 KR db/conf/kr/kr2004.html#EiterFFPW04 http://www.aaai.org/Library/KR/2004/kr04-040.php Thomas Eiter Michael Fink 0001 Hans Tompits Stefan Woltran On Eliminating Disjunctions in Stable Logic Programming. 447-458 2004 conf/kr/2004 KR db/conf/kr/kr2004.html#EiterFTW04 http://www.aaai.org/Library/KR/2004/kr04-047.php Thomas Eiter Michael Fink 0001 Hans Tompits Stefan Woltran Simplifying Logic Programs Under Uniform and Strong Equivalence. 87-99 https://doi.org/10.1007/978-3-540-24609-1_10 2004 conf/lpnmr/2004 LPNMR db/conf/lpnmr/lpnmr2004.html#EiterFTW04 Vladimir Sarsakov Torsten Schaub Hans Tompits Stefan Woltran nlp: A Compiler for Nested Logic Programming. 361-364 https://doi.org/10.1007/978-3-540-24609-1_35 2004 conf/lpnmr/2004 LPNMR db/conf/lpnmr/lpnmr2004.html#SarsakovSTW04 Thomas Linke Hans Tompits Stefan Woltran On acyclic and head-cycle free nested logic programs. 267-275 2004 conf/nmr/2004 NMR http://www.pims.math.ca/science/2004/NMR/papers/paper35.pdf db/conf/nmr/nmr2004.html#LinkeTW04 Thomas Eiter Wolfgang Faber 0001 Michael Fink 0001 Gerald Pfeifer Stefan Woltran Complexity of Answer Set Checking and Bounded Predicate Arities for Non-ground Answer Set Programming. 2003 conf/asp/2003 Answer Set Programming https://ceur-ws.org/Vol-78/asp03-final-eiter-compl.pdf db/conf/asp/asp2003.html#EiterFFPW03 Thomas Eiter Michael Fink 0001 Hans Tompits Stefan Woltran Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation. 2003 conf/asp/2003 Answer Set Programming https://ceur-ws.org/Vol-78/asp03-final-eiter-elim.pdf db/conf/asp/asp2003.html#EiterFTW03 Philippe Besnard Torsten Schaub Hans Tompits Stefan Woltran Paraconsistent Logics for Reasoning via Quantified Boolean Formulas, II: Circumscribing Inconsistent Theories. 528-539 https://doi.org/10.1007/978-3-540-45062-7_43 2003 conf/ecsqaru/2003 ECSQARU db/conf/ecsqaru/ecsqaru2003.html#BesnardSTW03 Uwe Egly Martina Seidl Hans Tompits Stefan Woltran Michael Zolda Comparing Different Prenexing Strategies for Quantified Boolean Formulas. 214-228 https://doi.org/10.1007/978-3-540-24605-3_17 2003 conf/sat/2003 SAT db/conf/sat/sat2003.html#EglySTWZ03 David Pearce 0001 Vladimir Sarsakov Torsten Schaub Hans Tompits Stefan Woltran A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report. 405-420 2002 conf/iclp/2002 ICLP https://doi.org/10.1007/3-540-45619-8_28 db/conf/iclp/iclp2002.html#PearceSSTW02 Philippe Besnard Torsten Schaub Hans Tompits Stefan Woltran Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. 320-331 2002 conf/jelia/2002 JELIA https://doi.org/10.1007/3-540-45757-7_27 db/conf/jelia/jelia2002.html#BesnardSTW02 David Pearce 0001 Vladimir Sarsakov Torsten Schaub Hans Tompits Stefan Woltran A polynomial translation of logic programs with nested expressions into disjunctive logic programs: preliminary report. 57-66 2002 conf/nmr/2002 NMR db/conf/nmr/nmr2002.html#PearceSSTW02 Philippe Besnard Torsten Schaub Hans Tompits Stefan Woltran Paraconsistent Reasoning via Quantified Boolean Formulas, I: Axiomatising Signed Systems. 1-15 2002 conf/pcl/2002 Paraconsistent Computational Logic https://arxiv.org/abs/cs/0207084 db/conf/pcl/pcl2002.html#BesnardSTW02 Thomas Eiter Volker Klotz Hans Tompits Stefan Woltran Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks. 100-114 2002 conf/tableaux/2002 TABLEAUX https://doi.org/10.1007/3-540-45616-3_8 db/conf/tableaux/tableaux2002.html#EiterKTW02

David Pearce 0001 Vladimir Sarsakov Torsten Schaub Hans Tompits Stefan Woltran A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report https://arxiv.org/abs/cs/0207071 2002 CoRR cs.AI/0207071 db/journals/corr/corr0207.html#cs-AI-0207071

Uwe Egly Thomas Eiter Volker Klotz Hans Tompits Stefan Woltran Computing Stable Models with Quantified Boolean Formulas: Some Experimental Results. 2001 conf/asp/2001 Answer Set Programming http://www.cs.nmsu.edu/~tson/ASP2001/28.ps db/conf/asp/asp2001.html#EglyEKTW01 James P. Delgrande Torsten Schaub Hans Tompits Stefan Woltran On Computing Solutions to Belief Change Scenarios. 510-521 2001 conf/ecsqaru/2001 ECSQARU https://doi.org/10.1007/3-540-44652-4_45 db/conf/ecsqaru/ecsqaru2001.html#DelgrandeSTW01 David Pearce 0001 Hans Tompits Stefan Woltran Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. 306-320 https://doi.org/10.1007/3-540-45329-6_31 2001 conf/epia/2001 EPIA db/conf/epia/epia2001.html#PearceTW01 Uwe Egly Thomas Eiter Hans Tompits Stefan Woltran Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas. 417-422 2000 conf/aaai/2000 AAAI/IAAI db/conf/aaai/aaai2000.html#EglyETW00 http://www.aaai.org/Library/AAAI/2000/aaai00-064.php Uwe Egly Thomas Eiter Volker Klotz Hans Tompits Stefan Woltran Experimental Evaluation of the Disjunctive Logic Programming Module of the System QUIP. 113-122 2000 conf/wlp/2000-2 WLP db/conf/wlp/wlp2000-2.html#EglyEKTW00 Uwe Egly Thomas Eiter Hans Tompits Stefan Woltran Implementing Default Reasoning Using Quantified Boolean Formulae. 223-228 2000 conf/wlp/2000 WLP db/conf/wlp/wlp2000.html#EglyETW00

Uwe Egly Thomas Eiter Hans Tompits Stefan Woltran QUIP - A Tool for Computing Nonmonotonic Reasoning Tasks https://arxiv.org/abs/cs/0003037 2000 CoRR cs.AI/0003037 db/journals/corr/corr0003.html#cs-AI-0003037

Michael Abseher Mario Alviano Thomas Ambroz Marcello Balduccini Ringo Baumann Alexander Beiser Michael Bernreiter Viktor Besin Philippe Besnard Manuel Bichler Stefano Bistarelli Bernhard Bliem Martin Brain Gerhard Brewka Rémi Brochenin Giovanni Buraglio Günther Charwat Augusto B. Corrêa Nadia Creignou Madalina Croitoru James P. Delgrande Jérôme Delobelle Martin Diller Yannis Dimopoulos Dragan Doder Paul E. Dunne Frederico Dusberger Wolfgang Dvorák Uwe Egly Thomas Eiter Stefan Ellmauthaler Wolfgang Faber 0001 Jorge Fandinno Flavio Ferrarotti Johannes Klaus Fichte Michael Fink 0001 Sarah Alice Gaggl Martin Gebser Massimiliano Giacomin Ricardo Gonçalves 0001 Christophe Gonzales Georg Gottlob Alexander Greßler Adrian Haret Markus Hecher Georg Heissenberger Malte Helmert Anthony Hunter Michael Jakl Tomi Janhunen Matti Järvisalo Andreas Jusits Benjamin Kaufmann Volker Klotz Peter Knees Matthias Knorr 0001 Sébastien Konieczny Matthias König 0002 Markus Kröll Martin Kronegger Martin Lackner João Leite 0001 Yuliya Lierler Vladimir Lifschitz Thomas Linke Thomas Linsbichler Anela Lolic Davide M. LongoDavide Mario Longo Jean-Guy Mailly Jan Maly 0001 Norbert Manthey Marco Maratea Marius Moldovan Michael Morak Nysret Musliu Oliviero Nardi Julia Neidhardt Andreas Niskanen Martin Nöllenburg Clemens Nopp Johannes Oetsch Emilia Oikarinen Sebastian Ordyniak Odile Papini David Pearce 0001 Pavlos Peppas Andreas Pfandler Gerald Pfeifer Reinhard Pichler Christian Pirker Sylwia Polberg Axel Polleres Florian Pommerening Erich Prem Jörg Pührer Anna Rapberger Tjitze Rienstra Alessandro Ronca Julien Rossit Sebastian Rudolph Stefan Rümmele Zeynep G. Saribatur Vladimir Sarsakov Torsten Schaub André Schidler Johannes Schmidt 0001 Martina Seidl Sebastian Skritek Tran Cao Son Christof Spanring Hannes Strass Stefan Szeider Carlo Taticchi Patrick Thier Michael Thomas 0001 Hans Tompits Leon van der TorreLeendert van der Torre Paolo Torroni Patrick Traxler Miroslaw Truszczynski Markus Ulbricht 0001 Kaan Unalan Agustín Valverde Bart Verheij Concepción Vidal Johannes Peter Wallner Fang Wei-KleinerFang Wei 0001 Georg Weissenbacher Hannes Werthner Jules Wulms Atefeh Keshavarzi Zafarghandi Markus Zisser Michael Zolda