Merging uncertain knowledge bases in a possibilistic logic framework

Authors:
Salem Benferhat;Claudio Sossai
Affiliations:
IRIT-UPS, Toulouse Cedex, France;Ladseb-CNR, Padova PD, Italy
Venue:
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Year:
1998

Citing 6
Cited 2

Linear logic

Theoretical Computer Science
Data fusion in robotics and machine intelligence

Data fusion in robotics and machine intelligence
Possibilistic logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Logic-Based Sensor Fusion for Localization

CIRA '97 Proceedings of the 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation
How to infer from inconsistent beliefs without revising

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
An algebraic semantics for possibilistic logic

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence

Towards Possibilistic Decision Functions with Minimum-Based Sugeno Integrals

SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Reasoning with multiple-source information in a possibilistic logic framework

Information Fusion

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of merging uncertain information in the framework of possibilistic logic. It presents several syntactic combination rules to merge possibilistic knowledge bases, provided by different sources, into a new possibilistic knowledge base. These combination rules are first described at the meta-level outside the language of possibilistic logic. Next, an extension of possibilistic logic, where the combination rules are inside the language, is proposed. A proof system in a sequent form, which is sound and complete with respect to the possibilistic logic semantics, is given.