ON THE USE OF SYNTACTIC POSSIBILISTIC FUSION FOR COMPUTING POSSIBILISTIC QUALITATIVE DECISION

Salem Benferhat, Faiza Haned-Khellaf, Aicha Mokhtari, Ismahane Zeddigha

Abstract

This paper describes the use of syntactical data fusion to computing possibilistic qualitative decisions. More precisely qualitative possibilistic decisions can be viewed as a data fusion problem of two particular possibility distributions (or possibilistic knowledge bases): the first one representing the beliefs of an agent and the second one representing the qualitative utility. The proposed algorithm computes a pessimistic optimal decisions based on data fusion techniques. We show that the computation of optimal decisions is equivalent to computing an inconsistency degree of possibilistic bases representing the fusion of agent’s beliefs and agent’s preferences.

References

  1. Benferhat, S., Dubois, D., and Prade, H. (1997). From semantic to syntactic approaches to information combination in possibilistic logic. Aggregation and Fusion of Imperfect Information, Physica Verlag, pages 141- 151.
  2. Berre, D. (2000). Autour de SAT : le calcul d'impliquants P-restreints algorithmes et applications. PhD thesis, universit Paul Sabatier Toulouse.
  3. Dubois, D., Berre, D. L., Prade, H., and Sabaddin, R. (1999). Using possibilistic logic for modeling qualitative decision : Atms based algorithms. In Fundamenta Informaticae, 37:1-30.
  4. Dubois, D., Berre, D. L., Prade, H., and Sabbadin, R. (1998). Logical representation and computation of optimal decisions in a qualitative setting. In AAAI-98, pages 588-593.
  5. Dubois, D., Lang, J., and Prade, H. (1994a). Automated reasoning using possibilistic logic: Semantics, belief revision, and variable certainty weights. In IEEE Trans. On knowledge and Data Enginneering, pages 64-69.
  6. Dubois, D., Lang, J., and Prade, H. (1994b). Possibilistic logic. In Handbook of Logic in Artificial Intelligence and Logic Programming, (D. Gabbay et al., eds, 3, Oxford University Press:pages 439-513.
  7. Dubois, D. and Prade, H. (1995). Possibility theory as a basis for qualitative decision theory. In 14th International Joint Conference on Artificial Intelligence (IJCAI'95), Montral, pages 1924-1930.
  8. Dubois, D., Prade, H., and Sabbadin, R. (1997). A possibilistic logic machinery for qualitative decision. In In : Proc. AAAI97 Spring Symposium Series (Qualitative Preferences in Deliberation and Practical Reasoning), pages 47-54, Standford University.
  9. Kleer, J. D. (1986a). An assumption-based tms. Artificial Intelligence Jounral, 28:127-162.
  10. Kleer, J. D. (1986b). Extending the atms. Artificial Intelligence Jounral, 28:163-196.
Download


Paper Citation


in Harvard Style

Benferhat S., Haned-Khellaf F., Mokhtari A. and Zeddigha I. (2008). ON THE USE OF SYNTACTIC POSSIBILISTIC FUSION FOR COMPUTING POSSIBILISTIC QUALITATIVE DECISION . In Proceedings of the Third International Conference on Software and Data Technologies - Volume 1: ICSOFT, ISBN 978-989-8111-51-7, pages 356-359. DOI: 10.5220/0001880403560359


in Bibtex Style

@conference{icsoft08,
author={Salem Benferhat and Faiza Haned-Khellaf and Aicha Mokhtari and Ismahane Zeddigha},
title={ON THE USE OF SYNTACTIC POSSIBILISTIC FUSION FOR COMPUTING POSSIBILISTIC QUALITATIVE DECISION},
booktitle={Proceedings of the Third International Conference on Software and Data Technologies - Volume 1: ICSOFT,},
year={2008},
pages={356-359},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001880403560359},
isbn={978-989-8111-51-7},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Third International Conference on Software and Data Technologies - Volume 1: ICSOFT,
TI - ON THE USE OF SYNTACTIC POSSIBILISTIC FUSION FOR COMPUTING POSSIBILISTIC QUALITATIVE DECISION
SN - 978-989-8111-51-7
AU - Benferhat S.
AU - Haned-Khellaf F.
AU - Mokhtari A.
AU - Zeddigha I.
PY - 2008
SP - 356
EP - 359
DO - 10.5220/0001880403560359