Name
Affiliation
Papers
MARKUS ULBRICHT
Univ Leipzig, Dept Comp Sci, Leipzig, Germany
21
Collaborators
Citations 
PageRank 
14
1
7.10
Referers 
Referees 
References 
2
46
24
Title
Citations
PageRank
Year
Recursion in Abstract Argumentation is Hard - On the Complexity of Semantics Based on Weak Admissibility00.342022
Equivalence in Argumentation Frameworks with a Claim-Centric View - Classical Results with Novel Ingredients.00.342022
Shedding new light on the foundations of abstract argumentation: Modularization and weak admissibility00.342022
On Cycles, Attackers and Supporters - A Contribution to The Investigation of Dynamics in Abstract Argumentation.00.342021
Comparing Weak Admissibility Semantics to their Dung-style Counterparts (Extended Abstract).00.342021
Ambiguity Hierarchies for Weighted Tree Automata.00.342021
Choices and their Consequences - Explaining Acceptable Sets in Abstract Argumentation Frameworks.00.342021
Behavioral Model of Dot-Product Engine Implemented with 1T1R Memristor Crossbar Including Assessment00.342021
Strong Explanations In Abstract Argumentation00.342021
Recursion In Abstract Argumentation Is Hard - On The Complexity Of Semantics Based On Weak Admissibility00.342021
Revisiting The Foundations Of Abstract Argumentation - Semantics Based On Weak Admissibility And Weak Defense00.342020
Comparing Weak Admissibility Semantics to their Dung-style Counterparts - Reduct, Modularization, and Strong Equivalence in Abstract Argumentation.00.342020
Handling and measuring inconsistency in non-monotonic logics.00.342020
Repairing Non-monotonic Knowledge Bases.00.342019
If Nothing Is Accepted -- Repairing Argumentation Frameworks00.342019
Strong Explanations for Nonmonotonic Reasoning.00.342019
Strong inconsistency.00.342019
Measuring Strong Inconsistency.00.342018
If Nothing Is Accepted - Repairing Argumentation Frameworks.00.342018
Strong Inconsistency in Nonmonotonic Reasoning.00.342017
Measuring Inconsistency in Answer Set Programs.10.342016