The following pages link to Semi-stable semantics (Q3165758):
Displaying 30 items.
- Looking-ahead in backtracking algorithms for abstract argumentation (Q324699) (← links)
- On rejected arguments and implicit conflicts: the hidden power of argumentation semantics (Q334820) (← links)
- Normal and strong expansion equivalence for argumentation frameworks (Q359982) (← links)
- Abstract argument games via modal logic (Q484918) (← links)
- Characteristics of multiple viewpoints in abstract argumentation (Q896434) (← links)
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory (Q898737) (← links)
- Classical logic, argument and dialectic (Q1711878) (← links)
- An extension-based approach to belief revision in abstract argumentation (Q1726407) (← links)
- Restricted semantics for default reasoning (Q1757453) (← links)
- A generalized proof-theoretic approach to logical argumentation based on hypersequents (Q2021565) (← links)
- Simple contrapositive assumption-based argumentation. II: Reasoning with preferences (Q2060783) (← links)
- Ensuring reference independence and cautious monotony in abstract argumentation (Q2069060) (← links)
- Structured argumentation dynamics. Undermining attacks in default justification logic (Q2075383) (← links)
- Graded labellings for abstract argumentation (Q2105593) (← links)
- Simple contrapositive assumption-based argumentation frameworks (Q2191233) (← links)
- Design and results of the second international competition on computational models of argumentation (Q2287197) (← links)
- Probabilistic abstract argumentation frameworks, a possible world view (Q2300457) (← links)
- Normality, non-contamination and logical depth in classical natural deduction (Q2307304) (← links)
- Logical argumentation by dynamic proof systems (Q2424889) (← links)
- A QBF-based formalization of abstract argumentation semantics (Q2446545) (← links)
- A general approach to extension-based semantics in abstract argumentation (Q2680804) (← links)
- Conflict-Tolerant Semantics for Argumentation Frameworks (Q2915055) (← links)
- On the Complexity of Probabilistic Abstract Argumentation Frameworks (Q2946762) (← links)
- On a paraconsistentization functor in the category of consequence structures (Q4586164) (← links)
- Improved answer-set programming encodings for abstract argumentation (Q4592988) (← links)
- Range-based argumentation semantics as two-valued models (Q4593079) (← links)
- Admissibility in Probabilistic Argumentation (Q5094045) (← links)
- Paracoherent Answer Set Semantics meets Argumentation Frameworks (Q5108496) (← links)
- A claim-centric perspective on abstract argumentation semantics: claim-defeat, principles, and expressiveness (Q6066787) (← links)
- A postulate-driven study of logical argumentation (Q6136108) (← links)
