For the four main preference-based reductions under complete semantics, the inverse problem of existence of a suitable preference relation is solvable in polynomial time in most cases.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the Existence of an Inverse Solution for Preference-Based Reductions in Argumentation
For the four main preference-based reductions under complete semantics, the inverse problem of existence of a suitable preference relation is solvable in polynomial time in most cases.