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.

Cite

Text

Belahcène et al. "Comparing Options with Argument Schemes Powered by Cancellation." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/213

Markdown

[Belahcène et al. "Comparing Options with Argument Schemes Powered by Cancellation." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/belahcene2019ijcai-comparing/) doi:10.24963/IJCAI.2019/213

BibTeX

@inproceedings{belahcene2019ijcai-comparing,
  title     = {{Comparing Options with Argument Schemes Powered by Cancellation}},
  author    = {Belahcène, Khaled and Labreuche, Christophe and Maudet, Nicolas and Mousseau, Vincent and Ouerdane, Wassila},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2019},
  pages     = {1537-1543},
  doi       = {10.24963/IJCAI.2019/213},
  url       = {https://mlanthology.org/ijcai/2019/belahcene2019ijcai-comparing/}
}