A possibilistic handling of partially ordered information
Artificial Intelligence
2012-12-12 v1
Abstract
In a standard possibilistic logic, prioritized information are encoded by means of weighted knowledge base. This paper proposes an extension of possibilistic logic for dealing with partially ordered information. We Show that all basic notions of standard possibilitic logic (sumbsumption, syntactic and semantic inference, etc.) have natural couterparts when dealing with partially ordered information. We also propose an algorithm which computes possibilistic conclusions of a partial knowledge base of a partially ordered knowlege base.
Keywords
Cite
@article{arxiv.1212.2450,
title = {A possibilistic handling of partially ordered information},
author = {Salem Benferhat and Sylvain Lagrue and Odile Papini},
journal= {arXiv preprint arXiv:1212.2450},
year = {2012}
}
Comments
Appears in Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence (UAI2003)