A Weighted Bipolar Argumentation Framework and its ASP-based Implementation
summary
Proposes a formal Weighted Bipolar Argumentation Framework that treats attacks and supports equally, assigns weights to both arguments and relations, and defines minimum-penalty preferred extensions as sets minimizing the sum of violated weights. Implements reasoning as the tool ASPWBART by encoding the decomposition into ASP with Clingo-style weak constraints to compute optimal answer sets. Reports performance: solving in seconds for ~100,000 argument+relation items and about one minute for problems on the order of millions, with much larger instances becoming slow.
AI-written summary · about
chapters (11)
- 0:00Weighted bipolar argumentation intro
- 2:39Motivation and objectives
- 3:22Background on argumentation
- 5:39Framework definition
- 7:30Expressiveness comparison
- 9:16Universality evaluation
- 11:05Abrona Mod case study
- 12:51Reasoning tool implementation
- 16:05Efficiency evaluation
- 17:52Conclusions and future work
- 19:23Q&A on weights
related talks
21mWeighted Context-Free-Language Ordered Binary Decision Diagrams
28mWeighted programming: a programming paradigm for specifying mathematical models
19mPanel: Compilation Frameworks
30mA Novel EGs-Based Framework for Systematic Propositional-Formula Simplification
13mInteractive Bit Vector Reasoning using Verified Bitblasting
16mA Rhetorical Framework for Programming Language Evaluation
29mCertifying Complexity Analysis
01h 02mTheory and Control