pith. sign in

arxiv: 1301.7359 · v1 · pith:YAF2N2BSnew · submitted 2013-01-30 · 💻 cs.AI

Merging Uncertain Knowledge Bases in a Possibilistic Logic Framework

classification 💻 cs.AI
keywords possibilisticlogiccombinationknowledgerulesbasesframeworklanguage
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.