Logical representation and fusion of prioritized information based on guaranteed possibility measures: Application to the distance-based merging of classical bases

Artificial Intelligence

Volumn 148, Issue 1-2, 2003, Pages 291-333

  Benferhat, Salem ^a   Kaci, Souhila ^b  

^a UNIVERSITÉ D'ARTOIS   (France)

^b IRIT   (France)

Author keywords

Fusion; Guaranteed possibility measure; Possibility theory

Indexed keywords

LOGIC PROGRAMMING; NUMERICAL METHODS; THEOREM PROVING;

POSSIBILITY THEORY;

KNOWLEDGE ENGINEERING;

EID: 0041629011     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(03)00025-0     Document Type: Article

References (42)

1. De Baets B., Tsiporkova E., Mesiar R. Conditioning in possibility theory with strict order norms. Fuzzy Sets and Systems. 106:1999;221-229.
2. Benferhat S., Dubois D., Kaci S., Prade H. Encoding information fusion in possibilistic logic: A general framework for rational syntactic merging. Proc. 14th European Conference on Artificial Intelligence (ECAI'00), Berlin. 2000;3-7.
3. Benferhat S., Dubois D., Kaci S., Prade H. Bipolar representation and fusion of preferences in the possibilistic logic framework. Proc. 8th International Conference on Principle of Knowledge Representation and Reasoning (KR'02), Toulouse, France. 2002;158-169.
4. Benferhat S., Dubois D., Prade H. From semantic to syntactic approaches to information combination in possibilistic logic. Aggregation and Fusion of Imperfect Information. 1997;141-151 Physica Verlag.
5. Benferhat S., Dubois D., Prade H. Towards a possibilistic logic handling of preferences. Appl. Intelligence. 14:2001;303-317.
6. Benferhat S., Dubois D., Prade H., Williams M. A practical approach to fusing and revising prioritized belief bases. Proc. 9th Portuguese Conference on Artificial Intelligence (EPIA'99). Lecture Notes in Artificial Intelligence. 1695:1999;222-236 Springer, Berlin.
7. Benferhat S., Kaci S. A possibilistic logic handling of strong preferences. Proc. Internat. Fuzzy Systems Association (IFSA'01). 2001;962-967.
8. Bison P., Chemello G., Sossai C., Trainito G. A possibilistic approach to sensor fusion in mobile robotics. Proc. 2nd Euromicro Workshop on Advanced Mobile Robots (Eurobot'97), Brescia, Italy. 1997;73-79.
9. Bossu G., Siegel P. Saturation, nonmonotonic reasoning and the closed-world assumption. Artificial Intelligence. 25:(1):1985;13-63.
10. Cadoli M., Donini F.M. A survey on knowledge compilation. AI Comm. 10:1997;137-150.
11. Cholvy L. Reasoning about merging information. Handbook of Defeasible Reasoning and Uncertainty Management Systems, Vol. 3. 1998;233-263 Kluwer, Boston, MA.
12. De Cooman G. Possibility theory II: Conditional possibility. Internat. J. Gen. Syst. 25:(4):1997;325-351.
13. Dalal M. Investigations into a theory of knowledge base revision: Preliminary report. Proc. AAAI-88, St. Paul, MN. 1988;475-479.
14. Darwiche A. Compilation knowledge into decomposable negation normal form. Proc. IJCAI-99, Stockholm, Sweden. 1999;284-289.
15. Darwiche A. On the tractable counting of theory models and its application to belief revision and truth maintenance. Workshop of Non-Monotonic Reasoning, Breckenridge, CO. 2000.
16. Dupin de Saint-Cyr F., Lang J., Schiex T. Penalty logic and its link with Dempster-Shofer theory. Proc. 10th International Conference on Uncertainty in Artificial Intelligence (UAI'94), Seattle, WA. 1994;204-211 Morgan Kaufmann, San Mateo, CA.
17. Dubois D., Hajek P., Prade H. Knowledge-driven versus data-driven logics. J. Logic Language Inform. 9:2000;65-89.
18. Dubois D., Lang J., Prade H. Theorem-proving under uncertainty - A possibility theory-based approach. Proc. IJCAI-87, Milan, Italy. 1987;984-986.
19. Dubois D., Lang J., Prade H. Possibilistic logic. Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3. 1994;439-513 Oxford University Press, Oxford.
20. Dubois D., Prade H. Epistemic entrenchment and possibilistic logic. Artificial Intelligence. 50:1991;223-239.
21. Dubois D., Prade H. Possibility theory as a basis for preference propagation in automated reasoning. Proc. International Conference on Fuzzy Systems (FUZZ-IEEE'92), San Diego, CA. 1992;821-832.
22. Dubois D., Prade H. Possibility theory and data fusion in poorly informed environments. Control Engineering Practice. 2:(5):1994;811-823.
23. Dubois D., Prade H., Smets P. New semantics for quantitative possibility theory. Proc. 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'01), Toulouse. Lecture Notes in Artificial Intelligence. 2001;410-421 Springer, Berlin.
24. Eiter T., Gottlob G. On the complexity of prepositional knowledge base revision, updates, and counterfactuals. Artificial Intelligence. 57:(2-3):1992;227-270.
25. Konieczny S., Pino Pérez R. On the logic of merging. Proc. 6th International Conference on Principles of Knowledge Representation and Reasoning (KR'98), Trento, Italy. 1998;488-498.
26. Konieczny S., Pino Pérez R. Merging with integrity constraints. Proc. 5th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'99). 1999;233-244.
27. Lafage C., Lang J. Logical representation of preferences for group decision making. Cohn T., Giunchiglia F., Selman B. Proc. 7th International Conference on Principles of Knowledge Representation and Reasoning (KR'00), Breckenridge, CO. 2000;457-468.
28. Lang J. Possibilistic logic: Complexity and algorithms. Handbook of Defeasible Reasoning and Uncertainty Management Systems, Vol. 5. 2000;179-220 Kluwer, Boston, MA.
29. Lin J. Integration of weighted knowledge bases. Artificial Intelligence. 83:1996;363-378.
30. Lin J., Mendelzon A. Merging databases under constraints. Internat. J. Cooperative Inform. Syst. 7:(1):1998;55-76.
31. Marquis P. Knowledge compilation using theory prime implicates. Proc. IJCAI-95, Montreal, Quebec. 1995;837-843.
32. Moulin H. Axioms of Cooperative Decision Making. 1988;Wiley, New York.
33. Pinkas G. Propositional nonmonotonic reasoning and inconsistency in symmetric neural networks. Proc. IJCAI-91, Sydney, Australia. 1991;525-530.
34. Revesz P.Z. On the semantics of theory change: Arbitration between old and new information. Proc. 12th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Databases. 1993;71-92.
35. Revesz P.Z. On the semantics of arbitration. Internat. J. Algebra and Comput. 7:(2):1997;133-160.
36. Selman B., Kautz H. Knowledge compilation and theory approximation. J. ACM. 43:(2):1996;193-224.
37. Shoham Y. Reasoning about Change. 1988;MIT Press, Cambridge, MA.
38. Spohn W. Ordinal conditional functions: A dynamic theory of epistemic states. Causation in Decision, Belief Change, and Statistics, Vol. 2. 1988;105-134 Kluwer, Boston, MA.
39. van der Torre L., Weydert E. Parameters for utilitarian desires in a qualitative decision theory. Appl. Intelligence. 14:2001;285-301.
40. Yager R.R. On the completion of qualitative possibility means. IEEE Trans. Fuzzy Systems. 1:(3):1993;184-194.
41. Yager R.R. On the inclusion of importances in owa aggregation. Yager R., Kacprzyk J. The Ordered Weighted Averaging Operators. Theory and Applications. 1997;41-59.
42. Zadeh L. Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems. 1:1978;3-28.