- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
The paper looks at the problem of dealing with non-transitive preferences that arise in multi-criteria comparison methods. It defines a preference-based argumentation approach, where the preference relation is based on pair-wise comparison: the criterion on which two arguments differ most decides. It's demonstrated that this may lead to defeat cycles (e.g. a directed 3-cycle with no non-empty extension) that no preorder-based framework can induce. All this is then modelled in the ASPIC+ formalism, which is shown to work even with non-transitive preferences.
Critical strengths
The paper deals with a potentially interesting problem (intransitive preferences) and takes a formal rigorous approach supported by rationality postulates.
Critical weaknesses
The main weakness of this paper is its presentation. I find the writing style very unpleasant. The impression I get is that the authors relied on an LLM to compress an originally much longer text into something that fits the page limit. It appears that compactness was favored over clarity. Overall, the paper is dense and hard to understand. Many of the results (theorems/propositions/corollaries) are provided without proper motivation or explanation. Theorems and propositions are very wordy, and nearly impossible to check for correctness. I furthermore have serious doubts about whether the format (i.e. a conference paper with the given page limit) is the right form for this work. I also have doubts about the relevance of the paper with respect to the theme of the conference and I think it would fit much better at a KR/argumentation venue.
Questions for authors
none
3 comments
Dear Reviewer kdmw,
Thanks for your time and effort in reviewing our work. Your comments are valuable to improve the quality of it. As the author-reviewer discussion period will end in about 2 days, we gently request that you read the rebuttal and check whether your concerns are addressed. Thanks again for your time and help in improving the quality of this paper.
Regards from the authors.
Anymore concern?
As we approach the end of the rebuttal period, we would appreciate knowing whether our responses and the updates to the manuscript have addressed your concerns. If so, we would be grateful if you could reconsider your rating in light of these changes. We remain available to address any remaining questions or concerns. Thank you in advance for your consideration.
Response to kdmw
Thank you for highlighting the difficulty of following the presentation. We have reduced the density of the main text and made the learning question and contribution boundaries more explicit.
Presentation changes
Relevance to learning and representation
The paper asks what fixed-utility preference models cannot represent, how much accuracy that restriction can cost on a given comparison set, and when a more flexible learned comparator helps. The revised experiments compare against the closest salient-feature model and generic pairwise alternatives on five datasets. The argumentation component then studies conditions under which cyclic comparisons can be used without violating closure and consistency.
The revised paper does not claim that the unrestricted learned comparator inherits those guarantees, or that its empirical gains are uniform. It also replaces the disputed Theorem 6(a), states the assumptions explicitly, and provides the revised proof and source definitions for inspection.