Pages that link to "Item:Q2269506"
From MaRDI portal
The following pages link to Complete extensions in argumentation coincide with 3-valued stable models in logic programming (Q2269506):
Displayed 18 items.
- Approximating operators and semantics for abstract dialectical frameworks (Q490444) (← links)
- Theory of semi-instantiation in abstract argumentation (Q528522) (← links)
- Complexity of abstract argumentation under a claim-centric view (Q785236) (← links)
- Semantic-based construction of arguments: an answer set programming approach (Q899190) (← links)
- Conflict-free and conflict-tolerant semantics for constrained argumentation frameworks (Q901144) (← links)
- On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation (Q1711893) (← links)
- Fibring argumentation frames (Q2269514) (← links)
- A logical account of formal argumentation (Q2269515) (← links)
- Annotation theories over finite graphs (Q2269516) (← links)
- Design and results of the second international competition on computational models of argumentation (Q2287197) (← links)
- On the equivalence between logic programming semantics and argumentation semantics (Q2344367) (← links)
- A QBF-based formalization of abstract argumentation semantics (Q2446545) (← links)
- Range-based argumentation semantics as two-valued models (Q4593079) (← links)
- Abduction in argumentation frameworks (Q4685530) (← links)
- Paracoherent Answer Set Semantics meets Argumentation Frameworks (Q5108496) (← links)
- On the Equivalence Between Abstract Dialectical Frameworks and Logic Programs (Q5108512) (← links)
- On the Semantics of Abstract Argumentation Frameworks: A Logic Programming Approach (Q5140009) (← links)
- A General Framework for Stable Roommates Problems using Answer Set Programming (Q5140025) (← links)