A possibilistic handling of partially ordered information

Authors:
Salem Benferhat;Sylvain Lagrue;Odile Papini
Affiliations:
CRIL, CNRS Universiti. d'Artois, Lens Cedex, France;SOMEI/PRAXITEC/SIS, Marseille, France;SIS, UniversitC de Toulon et du Var, La Garde cedex, France
Venue:
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Year:
2002

Citing 7
Cited 0

Extending the ATMS

Artificial Intelligence
Timed possibilistic logic

Fundamenta Informaticae - Special issue: logics for artificial intelligence
Possibilistic logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Management of Preferences in Assumption-Based Reasoning

IPMU '92 Proceedings of the 4th International Conference on Processing and Management of Uncertainty in Knowledge-Based Systems: Advanced Methods in Artificial Intelligence
Defining relative likelihood in partially-ordered preferential structures

Journal of Artificial Intelligence Research
Inconsistency management and prioritized syntax-based entailment

IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Plausibility measures: a general approach for representing uncertainty

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

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.