Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

KSEM
2010
Springer

favoriteEmaildiscussreport

171views Theoretical Computer Science» more KSEM 2010»

A Comparison of Merging Operators in Possibilistic Logic

13 years 3 months ago

A Comparison of Merging Operators in Possibilistic Logic

Download www.cs.qub.ac.uk

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.

Guilin Qi, Weiru Liu, David A. Bell

Real-time Traffic

KSEM 2010 | Operators | Possibilistic Merging Operators | Propositional Merging Operators | Theoretical Computer Science |

claim paper

Related Content

» Ordered Belief Fusion in Possibilistic Logic

» Multiple Semirevision in Possibilistic Logic

» A Modelbased Approach for Merging Prioritized Knowledge Bases in Possibilistic Logic

» A splitcombination approach to merging knowledge bases in possibilistic logic

» A Levelbased Approach to Computing Warranted Arguments in Possibilistic Defeasible Logic P...

» ArgumentBased Expansion Operators in Possibilistic Defeasible Logic Programming Characteri...

» Merging FirstOrder Knowledge Using Dilation Operators

» On Warranted Inference in Possibilistic Defeasible Logic Programming

» Symmetries in Natural Language Syntax and Semantics The LambekGrishin Calculus

Post Info
More Details (n/a)

Added	29 Jan 2011
Updated	29 Jan 2011
Type	Journal
Year	2010
Where	KSEM
Authors	Guilin Qi, Weiru Liu, David A. Bell

Comments (0)