Base Score Extraction Functions convert user preferences into base scores for Bipolar Argumentation Frameworks, producing Quantitative Bipolar Argumentation Frameworks usable with existing gradual semantics tools, including an algorithm and robotics evaluation.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.AI 2verdicts
UNVERDICTED 2representative citing papers
Contestable AI needs dynamic processes enabled by computational argumentation instead of static models.
citing papers explorer
-
From User Preferences to Base Score Extraction Functions in Gradual Argumentation (with Appendix)
Base Score Extraction Functions convert user preferences into base scores for Bipolar Argumentation Frameworks, producing Quantitative Bipolar Argumentation Frameworks usable with existing gradual semantics tools, including an algorithm and robotics evaluation.
-
Contestable AI needs Computational Argumentation
Contestable AI needs dynamic processes enabled by computational argumentation instead of static models.