A comparison of merging operators in possibilistic logic.


Autoria(s): Qi, Guilin; Liu, Weiru; Bell, David
Data(s)

01/09/2010

Resumo

In this paper, we compare merging operators in possibilistic logic. We rst propose an approach to evaluating the discriminating power of a merging operator. After that, we analyze the computational complexity of existing possibilistic merging operators. Finally, we consider the compatibility of possibilistic merging operators with propositional merging operators.

Identificador

http://pure.qub.ac.uk/portal/en/publications/a-comparison-of-merging-operators-in-possibilistic-logic(72328a7d-6c80-4cd4-8ee9-8f8d4989b3d6).html

http://www.scopus.com/inward/record.url?scp=78049400981&partnerID=8YFLogxK

Idioma(s)

eng

Publicador

Springer

Direitos

info:eu-repo/semantics/restrictedAccess

Fonte

Qi , G , Liu , W & Bell , D 2010 , A comparison of merging operators in possibilistic logic. in Proceedings of the 4th International Conference on Knowledge Science, Engineering & Management (KSEM'10) . Springer , pp. 39-50 , 4th International Conference on Knowledge Science, Engineering & Management (KSEM'10), Belfast , United Kingdom , 1-1 September .

Tipo

contributionToPeriodical