Open AccessAGGREGATION OF SYMBOLIC POSSIBILISTIC KNOWLEDGE BASES FROM THE POSTULATE POINT OF VIEW
Author(s) -
Đỗ Văn Thành,
Thi Thanh Luu Le
Publication year - 2020
Publication title -
journal of computer science and cybernetics (vietnam academy of science and technology)/journal of computer science and cybernetics
Language(s) - English
Resource type - Journals
eISSN - 2815-5939
pISSN - 1813-9663
DOI - 10.15625/1813-9663/36/1/13188
Subject(s) - impossibility , soundness , propositional calculus , completeness (order theory) , computer science , point (geometry) , propositional formula , propositional variable , possibility theory , theoretical computer science , mathematics , artificial intelligence , programming language , mathematical analysis , geometry , political science , fuzzy set , intermediate logic , law , description logic , fuzzy logic
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.