Pages that link to "Item:Q360248"
From MaRDI portal
The following pages link to Toward incremental computation of argumentation semantics: a decomposition-based approach (Q360248):
Displaying 13 items.
- On the input/output behavior of argumentation frameworks (Q464629) (← links)
- The first international competition on computational models of argumentation: results and analysis (Q1677447) (← links)
- On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation (Q1711893) (← links)
- Augmenting tractable fragments of abstract argumentation (Q1761284) (← links)
- A forward propagation algorithm for the computation of the semantics of argumentation frameworks (Q2028734) (← links)
- Incremental computation for structured argumentation over dynamic DeLP knowledge bases (Q2238730) (← links)
- Towards a general theory of decomposability in abstract argumentation (Q2695514) (← links)
- On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics (Q5145833) (← links)
- I don’t care, I don’t know … I know too much! On Incompleteness and Undecidedness in Abstract Argumentation (Q5172620) (← links)
- Partial semantics of argumentation: basic properties and empirical (Q5300581) (← links)
- Credulous acceptance in high-order argumentation frameworks with necessities: an incremental approach (Q6579305) (← links)
- Evidence-based argumentation and its incremental semantics (Q6622382) (← links)
- Constrained derivation in assumption-based argumentation (Q6630208) (← links)
