On Consensus Extraction
Abstract
Computing a consensus is a key task in various AI areas, ranging from belief fusion, social choice, negotiation, etc. In this work, we define consensus operators as functions that deliver parts of the set-theoretical union of the information sources (inpropositional logic) to be reconciled, such that no source is logically contradicted. We also investigate different notions of maximality related to these consensuses. From a computational point of view, we propose a generic problem transformation that leads to a method that proves experimentally efficient very often, even for large conflicting sources to be reconciled. PDF
Cite
Text
Grégoire et al. "On Consensus Extraction." International Joint Conference on Artificial Intelligence, 2016.Markdown
[Grégoire et al. "On Consensus Extraction." International Joint Conference on Artificial Intelligence, 2016.](https://mlanthology.org/ijcai/2016/gregoire2016ijcai-consensus/)BibTeX
@inproceedings{gregoire2016ijcai-consensus,
title = {{On Consensus Extraction}},
author = {Grégoire, Éric and Konieczny, Sébastien and Lagniez, Jean-Marie},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2016},
pages = {1095-1101},
url = {https://mlanthology.org/ijcai/2016/gregoire2016ijcai-consensus/}
}