Pages that link to "Item:Q1677447"
From MaRDI portal
The following pages link to The first international competition on computational models of argumentation: results and analysis (Q1677447):
Displayed 14 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)
- Verification in incomplete argumentation frameworks (Q668774) (← links)
- The first international competition on computational models of argumentation: results and analysis (Q1677447) (← links)
- Evaluation of argument strength in attack graphs: foundations and semantics (Q2060740) (← links)
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving (Q2124467) (← links)
- Incremental computation for structured argumentation over dynamic DeLP knowledge bases (Q2238730) (← links)
- Design and results of the second international competition on computational models of argumentation (Q2287197) (← links)
- How we designed winning algorithms for abstract argumentation and which insight we attained (Q2289004) (← links)
- A general notion of equivalence for abstract argumentation (Q2321336) (← links)
- On checking skeptical and ideal admissibility in abstract argumentation frameworks (Q2419797) (← links)
- Using Graph Convolutional Networks for Approximate Reasoning with Abstract Argumentation Frameworks: A Feasibility Study (Q3297798) (← links)
- New stochastic local search approaches for computing preferred extensions of abstract argumentation (Q5145445) (← links)
- A logical encoding for \(k\)-\(m\)-realization of extensions in abstract argumentation (Q6179525) (← links)