AGGREGATION OF SYMBOLIC POSSIBILISTIC KNOWLEDGE BASES FROM THE POSTULATE POINT OF VIEW
Keywords:aggregation, hierarchical aggregation, impossibility distribution, symbolic possibilistic logic, postulate point of view.
Aggregation of knowledge bases in the propositional language was soon investigated and the requirements of aggregation processes of propositional knowledge bases basically are unified within the community of researchers and applicants. Aggregation of standard possibilistic knowledge bases where the weight of propositional formulas being numeric has also been investigated and applied in building the intelligent systems, in multi-criterion decision-making processes as well as in decision-making processes implemented by many people.
Symbolic possibilistic logic (SPL for short) where the weight of the propositional formulas is symbols was proposed, and recently it was proven that SPL is soundness and completeness. In order to apply SPL in building intelligent systems as well as in decision-making processes, it is necessary to solve the problem of aggregation of symbolic possibilistic knowledge bases (SPK bases for short). This problem has not been researched so far.
The purpose of this paper is to investigate aggregation processes of SPK bases from the postulate point of view in propositional language. These processes are implemented via impossibility distributions defined from SPK bases. Characteristics of merging operators, including hierarchical merging operators, of symbolic impossibility distributions (SIDs for short) from the postulate point of view will be shown in the paper.
Baral C., Kraus S. & Minker J., “Combining multiple knowledge bases”, IEEE Trans. on Knowl. And Data Eng., 3:208-220, June 1991.
Benferhat S., Dubois D., Kaci S., & Prade H., “Possibilistic merging and distance-based fusion of propositional information”, Annals of Mathematics and Artificial Intelligence, 34:217-252, March 2002.
Benferhat S. & Kaci S., “Fusion of possibilistic knowledge bases from a postulate point of view”, International Journal of Approximate Reasoning, 33, 255–285, 2003.
Cayrol C., Dubois D. & Touazi P., “Symbolic possibilistic logic: completeness and inference methods”, Journal of Logic and Computation, Volume 28, Issue 1, Pages 219–244, 2018.
D. Dubois, J. Lang, and H. Prade., “Dealing with multi-source information in possibilistic logic”, In Proceedings of the European Conference on Artificial Intelligence, pp. 38–42, 1992.
Dubois D., Lang J. & Prade H., “Possibilistic logic”, In Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, D. Gabbay, C. Hogger, J. Robinson, and D. Nute, eds, pp. 439–513. Oxford University Press, 1994.
Dubois D., Prade P. & Schockaert S., “Generalized possibilistic logic: Foundations and applications to qualitative reasoning about uncertainty”, Artificial Intelligence, DOI: 10.1016/j.artint.2017.08.001.
Dung P.M. “On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning”, Logic Programming and n-Person Games. Artif. Intell. 77(2): 321-358, 1995.
Hieu T.T, Thanh N.N., Bao V.Q., “Axiomatic Characterization of Belief Merging by Negotiation. Multimedia Tools and Applications”, DOI: 10.1007/s11042-012-1136-7, 2012.
Hieu T.T, Bao V.Q. “An Axiomatic Model for Merging Stratified Belief Bases by Negotiation”, Lecture Notes in Computer Science 7653, 174-184, 2012.
Konieczny S. & Perez R.P., “On the logic of merging”, in Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR_98), Trento, 1998, pp. 488–498, 1998.
Konieczny S. & Pérez P.R., “Merging information under constraints: a logical framework”, Journal of Logic and Computation, 12(5):773-808, 2002.
Konieczny S. Belief base merging as a game. Journal of Applied Non-Classical Logics, 14(3):275-294, 2004.
Lin J., “Aggregation of weighted knowledge bases”, Artif. Intell., 83:363-378, June 1996.
Thanh D.V., “Hierarchical Aggregation of Possibility Distributions”, Proceedings of the National Centre for Science and Technology. Tom 9, No 1, 29-41, 1997.
Thanh D.V., “A releationship between the probalilistic logic and the posibilistic logic”, Computer and Artificial Intelligence, Vol.17, 1998, No.1, 51-68, 1998.
Thanh D.V., “Aggregation of Possibility distributions via Probabilistic Logic Model, Advances in Natural Sciences. Tom 1, N 2, 89-96, 2000.
Thanh D. V., "Aggregation of possibility distributions and aggregation operators", Computer Science and Cybernetics, National Center for Science and Technology, Vol. 12, No. 3, 47-63, 1996 (in Vietnamese).
Zhang D. A logic-based axiomatic model of bargaining. Artif. Intell., 174:1307- 1322, November 2010.
How to Cite
License1. We hereby assign copyright of our article (the Work) in all forms of media, whether now known or hereafter developed, to the Journal of Computer Science and Cybernetics. We understand that the Journal of Computer Science and Cybernetics will act on my/our behalf to publish, reproduce, distribute and transmit the Work.
2. This assignment of copyright to the Journal of Computer Science and Cybernetics is done so on the understanding that permission from the Journal of Computer Science and Cybernetics is not required for me/us to reproduce, republish or distribute copies of the Work in whole or in part. We will ensure that all such copies carry a notice of copyright ownership and reference to the original journal publication.
3. We warrant that the Work is our results and has not been published before in its current or a substantially similar form and is not under consideration for another publication, does not contain any unlawful statements and does not infringe any existing copyright.
4. We also warrant that We have obtained the necessary permission from the copyright holder/s to reproduce in the article any materials including tables, diagrams or photographs not owned by me/us.