|
|
|
|
A possibilistic handling of partially ordered information
Salem Benferhat, Sylvain Lagrue, Odile Papini
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:
Pages: 29-36
PS Link:
PDF Link: /papers/03/p29-benferhat.pdf
BibTex:
@INPROCEEDINGS{Benferhat03,
AUTHOR = "Salem Benferhat
and Sylvain Lagrue and Odile Papini",
TITLE = "A possibilistic handling of partially ordered information",
BOOKTITLE = "Proceedings of the Nineteenth Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-03)",
PUBLISHER = "Morgan Kaufmann",
ADDRESS = "San Francisco, CA",
YEAR = "2003",
PAGES = "29--36"
}
|
|
