Abstract
AbstractIn this paper, we compare some important merging operators in possibilistic logic. We first introduce semantic merging operators and adaptive merging operators in possibilistic logic. We then propose an approach to evaluating the discriminating power of these merging operators. After that, we analyze the computational complexity of these possibilistic merging operators. Finally, we consider the compatibility of possibilistic merging operators with propositional merging operators.KeywordsClassical LogicPossibility DistributionArgumentation FrameworkPossibilistic LogicPolynomial HierarchyThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
