Johannes Peter Wallner

Orcid: 0000-0002-3051-1966

Affiliations:
  • TU Graz, Graz, Austria
  • University of Helsinki, HIIT / Department of Computer Science, Finland (former)
  • TU Wien, Vienna, Austria (former)


According to our database1, Johannes Peter Wallner authored at least 64 papers between 2011 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Argumentative Reasoning in ASPIC+ under Incomplete Information.
Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

Argumentation Frameworks Induced by Assumption-based Argumentation: Relating Size and Complexity.
Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, 2023

Ranking-based Semantics for Assumption-based Argumentation.
Proceedings of the 9th Workshop on Formal and Cognitive Reasoning co-located with the 46th German Conference on Artificial Intelligence (KI 2023), 2023

Reasoning in Assumption-Based Argumentation Using Tree-Decompositions.
Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

2022
Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving.
Artif. Intell., 2022

Argumentation Frameworks Induced by Assumption-Based Argumentation: Relating Size and Complexity.
Proceedings of the 20th International Workshop on Non-Monotonic Reasoning, 2022

Representing Abstract Dialectical Frameworks with Binary Decision Diagrams.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2022

Computing Stable Conclusions under the Weakest-Link Principle in the ASPIC+ Argumentation Formalism.
Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, 2022

Algorithms for Reasoning in a Default Logic Instantiation of Assumption-Based Argumentation.
Proceedings of the Computational Models of Argument, 2022

ADF-BDD: An ADF Solver Based on Binary Decision Diagrams.
Proceedings of the Computational Models of Argument, 2022

Strongly Accepting Subframeworks: Connecting Abstract and Structured Argumentation.
Proceedings of the Computational Models of Argument, 2022

An Axiomatic Approach to Revising Preferences.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Harnessing Incremental Answer Set Solving for Reasoning in Assumption-Based Argumentation.
Theory Pract. Log. Program., 2021

Declarative Algorithms and Complexity Results for Assumption-Based Argumentation.
J. Artif. Intell. Res., 2021

Enforcement in Formal Argumentation.
FLAP, 2021

An AGM Approach to Revising Preferences.
CoRR, 2021

Aspartix-V21.
CoRR, 2021

Existential Abstraction on Argumentation Frameworks via Clustering.
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, 2021

Strong Explanations in Abstract Argumentation.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

Ranking Sets of Defeasible Elements in Preferential Approaches to Structured Argumentation: Postulates, Relations, and Characterizations.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Structural constraints for dynamic operators in abstract argumentation.
Argument Comput., 2020

An Answer Set Programming Approach to Argumentative Reasoning in the ASPIC+ Framework.
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.
Proceedings of the Foundations of Information and Knowledge Systems, 2020

Explaining Non-Acceptability in Abstract Argumentation.
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.
Proceedings of the Computational Models of Argument, 2020

Labelling-based Algorithms for SETAFs.
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.
Proceedings of the Computational Models of Argument, 2020

Proportional Belief Merging.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Synthesizing Argumentation Frameworks from Examples.
J. Artif. Intell. Res., 2019

On the complexity of inconsistency measurement.
Artif. Intell., 2019

Manipulating Skeptical and Credulous Consequences When Merging Beliefs.
Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

Reasoning over Assumption-Based Argumentation Frameworks via Direct Answer Set Programming Encodings.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Weighted Abstract Dialectical Frameworks: Extended and Revised Report.
CoRR, 2018

Abstract solvers for Dung's argumentation frameworks.
Argument Comput., 2018

Extension Enforcement under Grounded Semantics in Abstract Argumentation.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Two Sides of the Same Coin: Belief Revision and Enforcing Arguments.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Weighted Abstract Dialectical Frameworks.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation.
J. Artif. Intell. Res., 2017

Foundations of Implementations for Formal Argumentation.
FLAP, 2017

Abstract Dialectical Frameworks. An Overview.
FLAP, 2017

From Structured to Abstract Argumentation: Assumption-Based Acceptance via AF Reasoning.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2017

2016
Some Complexity Results on Inconsistency Measurement.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Implicit Hitting Set Algorithms for Reasoning Beyond NP.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016

Pakota: A System for Enforcement in Abstract Argumentation.
Proceedings of the Logics in Artificial Intelligence - 15th European Conference, 2016

Optimal Status Enforcement in Abstract Argumentation.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Improved answer-set programming encodings for abstract argumentation.
Theory Pract. Log. Program., 2015

Reasoning in abstract dialectical frameworks using quantified Boolean formulas.
Argument Comput., 2015

Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory.
Artif. Intell., 2015

Methods for solving reasoning problems in abstract argumentation - A survey.
Artif. Intell., 2015

On the Parameterized Complexity of Belief Revision.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Complexity-Sensitive Decision Procedures for Abstract Argumentation (Extended Abstract).
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Reduction-Based Approaches to Implement Modgil's Extended Argumentation Frameworks.
Proceedings of the Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation, 2015

2014
Complexity-sensitive decision procedures for abstract argumentation.
Artif. Intell., 2014

2013
On the relation between SPARQL1.1 and Answer Set Programming.
J. Appl. Non Class. Logics, 2013

Utilizing ASP for Generating and Visualizing Argumentation Frameworks
CoRR, 2013

VCWC: A Versioning Competition Workflow Compiler.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2013

ARVis: Visualizing Relations between Answer Sets.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2013


Abstract Dialectical Frameworks Revisited.
Proceedings of the IJCAI 2013, 2013

Advanced SAT Techniques for Abstract Argumentation.
Proceedings of the Computational Logic in Multi-Agent Systems, 2013

Admissibility in the Abstract Dialectical Framework.
Proceedings of the Computational Logic in Multi-Agent Systems, 2013

2012
Evaluating Abstract Dialectical Frameworks with ASP.
Proceedings of the Computational Models of Argument, 2012

2011
Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems.
Proceedings of the Applications of Declarative Programming and Knowledge Management, 2011


  Loading...