Comparing options with argument schemes powered by cancellation

Abstract : We introduce a way of reasoning about preferences represented as pairwise comparative statements , based on a very simple yet appealing principle: cancelling out common values across statements. We formalize and streamline this procedure with argument schemes. As a result, any conclusion drawn by means of this approach comes along with a justification. It turns out that the statements which can be inferred through this process form a proper preference relation. More precisely, it corresponds to a necessary preference relation under the assumption of additive utilities. We show the inference task can be performed in polynomial time in this setting, but that finding a minimal length explanation is NP-complete.
Document type :
Conference papers
Complete list of metadatas

Cited literature [7 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02133034
Contributor : Nicolas Maudet <>
Submitted on : Tuesday, August 27, 2019 - 1:26:07 PM
Last modification on : Tuesday, October 15, 2019 - 6:54:07 AM

File

ijcai19-BelahceneEtAl.pdf
Files produced by the author(s)

Identifiers

Citation

Khaled Belahcene, Christophe Labreuche, Nicolas Maudet, Vincent Mousseau, Wassila Ouerdane. Comparing options with argument schemes powered by cancellation. 28th International Joint Conference on Artificial Intelligence (IJCAI-19), Aug 2019, Macao, Macau SAR China. pp.1537-1543, ⟨10.24963/ijcai.2019/213⟩. ⟨hal-02133034⟩

Share

Metrics

Record views

83

Files downloads

28