The following pages link to Markus Ulbricht (Q2096594):
Displaying 15 items.
- Disambiguation of weighted tree automata (Q2096595) (← links)
- Ambiguity hierarchies for weighted tree automata (Q2117674) (← links)
- Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility (Q2163881) (← links)
- Strong explanations for nonmonotonic reasoning (Q2185462) (← links)
- Handling and measuring inconsistency in non-monotonic logics (Q2211858) (← links)
- Repairing non-monotonic knowledge bases (Q2296703) (← links)
- Strong inconsistency (Q2321259) (← links)
- Measuring Inconsistency in Answer Set Programs (Q2835905) (← links)
- Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility (Q5094077) (← links)
- If Nothing Is Accepted -- Repairing Argumentation Frameworks (Q5207045) (← links)
- (Q5226733) (← links)
- Ambiguity Hierarchies for Weighted Tree Automata (Q6070750) (← links)
- On dynamics in structured argumentation formalisms (Q6488791) (← links)
- Equivalence in argumentation frameworks with a claim-centric view: classical results with novel ingredients (Q6488795) (← links)
- On the expressive power of assumption-based argumentation (Q6545528) (← links)
