A comparison of merging operators in possibilistic logic.

Guilin Qi, Weiru Liu, David Bell

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

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.
Original languageEnglish
Title of host publicationProceedings of the 4th International Conference on Knowledge Science, Engineering & Management (KSEM'10)
PublisherSpringer
Pages39-50
Number of pages12
Publication statusPublished - Sept 2010
Event4th International Conference on Knowledge Science, Engineering & Management (KSEM'10), - Belfast, United Kingdom
Duration: 01 Sept 201001 Sept 2010

Conference

Conference4th International Conference on Knowledge Science, Engineering & Management (KSEM'10),
Country/TerritoryUnited Kingdom
CityBelfast
Period01/09/201001/09/2010

Bibliographical note

ISSN: 978-3-642-15279-5

Fingerprint

Dive into the research topics of 'A comparison of merging operators in possibilistic logic.'. Together they form a unique fingerprint.

Cite this