Wolfgang Dvorák

Proceedings of the 7th Workshop on Advances in Argumentation in Artificial Intelligence (AI^3 2023) co-located with the 22nd International Conference of the Italian Association for Artificial Intelligence (AIxIA 2023), 2023

2022

Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility.

[BibT_eX]

[DOI]

Markus Ulbricht

Atefeh Keshavarzi Zafarghandi

J. Artif. Intell. Res., 2022

The Effect of Preferences in Abstract Argumentation Under a Claim-Centric View.

[BibT_eX]

[DOI]

Proceedings of the 20th International Workshop on Non-Monotonic Reasoning, 2022

Rediscovering Argumentation Principles Utilizing Collective Attacks.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, 2022

How Complex Is the Strong Admissibility Semantics for Abstract Dialectical Frameworks?

[BibT_eX]

[DOI]

Rineke Verbrugge

Bart Verheij

Proceedings of the Computational Models of Argument, 2022

Non-Admissibility in Abstract Argumentation.

[BibT_eX]

[DOI]

Tjitze Rienstra

Leendert van der Torre

Proceedings of the Computational Models of Argument, 2022

Deletion-Backdoors for Argumentation Frameworks with Collective Attacks.

[BibT_eX]

[DOI]

Proceedings of the Fourth International Workshop on Systems and Algorithms for Formal Argumentation co-located with the 9th International Conference on Computational Models of Argument (COMMA 2022), 2022

Treewidth for Argumentation Frameworks with Collective Attacks.

[BibT_eX]

[DOI]

Proceedings of the Computational Models of Argument, 2022

Abstract Argumentation with Conditional Preferences.

[BibT_eX]

[DOI]

Michael Bernreiter

Proceedings of the Computational Models of Argument, 2022

Tractable Abstract Argumentation via Backdoor-Treewidth.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Joint Attacks and Accrual in Argumentation Frameworks.

[BibT_eX]

[DOI]

FLAP, 2021

Aspartix-V21.

[BibT_eX]

[DOI]

CoRR, 2021

Algorithms and conditional lower bounds for planning problems.

[BibT_eX]

[DOI]

Artif. Intell., 2021

Symbolic Time and Space Tradeoffs for Probabilistic Verification.

[BibT_eX]

[DOI]

Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Graph-Classes of Argumentation Frameworks with Collective Attacks.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence - 17th European Conference, 2021

2020

On the different types of collective attacks in abstract argumentation: equivalence results for SETAFs.

[BibT_eX]

[DOI]

J. Log. Comput., 2020

Complexity of abstract argumentation under a claim-centric view.

[BibT_eX]

[DOI]

Artif. Intell., 2020

Argumentation Semantics under a Claim-centric View: Properties, Expressiveness and Relation to SETAFs.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

ASPARTIX-V19 - An Answer-Set Programming Based System for Abstract Argumentation.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Information and Knowledge Systems, 2020

On the Relation Between Claim-Augmented Argumentation Frameworks and Collective Attacks.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Computing Strongly Admissible Sets.

[BibT_eX]

[DOI]

Proceedings of the Computational Models of Argument, 2020

Labelling-based Algorithms for SETAFs.

[BibT_eX]

[DOI]

Proceedings of the Third International Workshop on Systems and Algorithms for Formal Argumentation co-located with the 8th International Conference on Computational Models of Argument (COMMA 2020), 2020

The ASPARTIX System Suite.

[BibT_eX]

[DOI]

Proceedings of the Computational Models of Argument, 2020

Ranking-Based Semantics from the Perspective of Claims.

[BibT_eX]

[DOI]

Proceedings of the Computational Models of Argument, 2020

2019

On the expressive power of collective attacks.

[BibT_eX]

[DOI]

Jorge Fandinno

Argument Comput., 2019

A general notion of equivalence for abstract argumentation.

[BibT_eX]

[DOI]

Artif. Intell., 2019

Strong Equivalence for Argumentation Frameworks with Collective Attacks.

[BibT_eX]

[DOI]

Proceedings of the KI 2019: Advances in Artificial Intelligence, 2019

Preprocessing Argumentation Frameworks via Replacement Patterns.

[BibT_eX]

[DOI]

Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs.

[BibT_eX]

[DOI]

Proceedings of the 30th International Conference on Concurrency Theory, 2019

2018

Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.

[BibT_eX]

[DOI]

Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Evaluating SETAFs via Answer-Set Programming

[BibT_eX]

[DOI]

Alexander Greßler

Proceedings of the Second International Workshop on Systems and Algorithms for Formal Argumentation (SAFA 2018) co-located with the 7th International Conference on Computational Models of Argument (COMMA 2018), 2018

2017

Welfare Maximization with Friends-of-Friends Network Externalities.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2017

Comparing the expressiveness of argumentation semantics.

[BibT_eX]

[DOI]

Christof Spanring

J. Log. Comput., 2017

Computational Problems in Formal Argumentation and their Complexity.

[BibT_eX]

[DOI]

Paul E. Dunne

FLAP, 2017

Maximizing a Submodular Function with Viability Constraints.

[BibT_eX]

[DOI]

David P. Williamson

Algorithmica, 2017

Improved Set-Based Symbolic Algorithms for Parity Games.

[BibT_eX]

[DOI]

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2016

Stage semantics and the SCC-recursive schema for argumentation semantics.

[BibT_eX]

[DOI]

J. Log. Comput., 2016

Preferred semantics as socratic discussion.

[BibT_eX]

[DOI]

Martin W. A. Caminada

Srdjan Vesic

J. Log. Comput., 2016

On rejected arguments and implicit conflicts: The hidden power of argumentation semantics.

[BibT_eX]

[DOI]

Artif. Intell., 2016

Conditionally Optimal Algorithms for Generalized Büchi Games.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction.

[BibT_eX]

[DOI]

Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

2015

On the equivalence between logic programming semantics and argumentation semantics.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2015

On the Difference between Assumytion-Based Argumentation and Abstract Argumentation.

[BibT_eX]

[DOI]

FLAP, 2015

Characteristics of multiple viewpoints in abstract argumentation.

[BibT_eX]

[DOI]

Artif. Intell., 2015

Methods for solving reasoning problems in abstract argumentation - A survey.

[BibT_eX]

[DOI]

Günther Charwat

Artif. Intell., 2015

Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract).

[BibT_eX]

[DOI]

Matti Järvisalo

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Reduction-Based Approaches to Implement Modgil's Extended Argumentation Frameworks.

[BibT_eX]

[DOI]

Thomas Linsbichler

Proceedings of the Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation, 2015

2014

Complexity-sensitive decision procedures for abstract argumentation.

[BibT_eX]

[DOI]

Matti Järvisalo

Artif. Intell., 2014

Limiting Price Discrimination when Selling Products with Positive Network Externalities.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

Online Ad Assignment with an Ad Exchange.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

Compact Argumentation Frameworks.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Resolution-Based Grounded Semantics Revisited.

[BibT_eX]

[DOI]

Proceedings of the Computational Models of Argument, 2014

2013

Parametric properties of ideal semantics.

[BibT_eX]

[DOI]

Paul E. Dunne

Artif. Intell., 2013

2012

Technical Note: Exploring Σ^P_2 / Π^P_2-hardness for Argumentation Problems with fixed distance to tractable classes

[BibT_eX]

[DOI]

CoRR, 2012

Towards fixed-parameter tractable algorithms for abstract argumentation.

[BibT_eX]

[DOI]

Reinhard Pichler

Artif. Intell., 2012

Augmenting tractable fragments of abstract argumentation.

[BibT_eX]

[DOI]

Sebastian Ordyniak

Stefan Szeider

Artif. Intell., 2012

Abstract Argumentation via Monadic Second Order Logic.

[BibT_eX]

[DOI]

Stefan Szeider

Proceedings of the Scalable Uncertainty Management - 6th International Conference, 2012

Computationale Aspekte der Abstrakten Argumentation.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2012, 2012

Computational Aspects of cf2 and stage2 Argumentation Semantics.

[BibT_eX]

[DOI]

Proceedings of the Computational Models of Argument, 2012

dynPARTIX 2.0 - Dynamic Programming Argumentation Reasoning Tool.

[BibT_eX]

[DOI]

Günther Charwat

Proceedings of the Computational Models of Argument, 2012

Parameterized Splitting: A Simple Modification-Based Approach.

[BibT_eX]

[DOI]

Proceedings of the Correct Reasoning, 2012

Computational Aspects of Abstract Argumentation.

[BibT_eX]

[DOI]

PhD thesis, 2012

2011

On the Intertranslatability of Argumentation Semantics.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2011

On the Complexity of Computing the Justification Status of an Argument.

[BibT_eX]

[DOI]

Proceedings of the Theorie and Applications of Formal Argumentation, 2011

dynPARTIX - A Dynamic Programming Reasoner for Abstract Argumentation.

[BibT_eX]

[DOI]

Proceedings of the Applications of Declarative Programming and Knowledge Management, 2011

Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems.

[BibT_eX]

[DOI]

Proceedings of the Applications of Declarative Programming and Knowledge Management, 2011

2010

Complexity of semi-stable and stage semantics in argumentation frameworks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Towards Fixed-Parameter Tractable Algorithms for Argumentation.

[BibT_eX]

[DOI]

Reinhard Pichler

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

Reasoning in Argumentation Frameworks of Bounded Clique-Width.

[BibT_eX]

[DOI]

Stefan Szeider