AGGREGATION OF SYMBOLIC POSSIBILISTIC KNOWLEDGE BASES FROM THE POSTULATE POINT OF VIEW
Authors:
- Thanh Do VanTVThanh Do Van
- Thi Thanh Luu LeTLThi Thanh Luu Le
Open Access
- 27 February 2020
- journal article
- research article
- Published by Publishing House for Science and Technology, Vietnam Academy of Science and Technology (Publications) in Journal of Computer Science and Cybernetics
- Vol. 36 (1) , 17-32
Abstract
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.Keywords
This publication has 9 references indexed in Scilit:
- Symbolic possibilistic logic: completeness and inference methodsJournal of Logic and Computation, 2018
- Generalized possibilistic logic: Foundations and applications to qualitative reasoning about uncertaintyArtificial Intelligence, 2017
- Axiomatic characterization of belief merging by negotiationMultimedia Tools and Applications, 2012
- An Axiomatic Model for Merging Stratified Belief Bases by Negotiation2012
- A logic-based axiomatic model of bargainingArtificial Intelligence, 2010
- Fusion of possibilistic knowledge bases from a postulate point of viewInternational Journal of Approximate Reasoning, 2003
- Possibilistic Merging and Distance-Based Fusion of Propositional InformationAnnals of Mathematics and Artificial Intelligence, 2002
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person gamesArtificial Intelligence, 1995
- Combining multiple knowledge basesIEEE Transactions on Knowledge and Data Engineering, 1991