A Possibilistic Handling of Partially Ordered Information
Abstract
In standard possibilistic logic, prioritized information are encoded by means of weighted knowledge bases. This paper proposes an extension of possibilistic logic to deal with partially ordered information which can be viewed as a family of possibilistic knowledge bases. We show that all basic notions of possibilistic logic have natural counterparts when dealing with partially ordered information. Furthermore, we propose an algorithm which computes plausible conclusions of a partially ordered knowledge base.
Cite
Text
Benferhat et al. "A Possibilistic Handling of Partially Ordered Information." Conference on Uncertainty in Artificial Intelligence, 2003.Markdown
[Benferhat et al. "A Possibilistic Handling of Partially Ordered Information." Conference on Uncertainty in Artificial Intelligence, 2003.](https://mlanthology.org/uai/2003/benferhat2003uai-possibilistic/)BibTeX
@inproceedings{benferhat2003uai-possibilistic,
title = {{A Possibilistic Handling of Partially Ordered Information}},
author = {Benferhat, Salem and Lagrue, Sylvain and Papini, Odile},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2003},
pages = {29-36},
url = {https://mlanthology.org/uai/2003/benferhat2003uai-possibilistic/}
}