Merging Uncertain Knowledge Bases in a Possibilistic Logic Framework

01/30/2013
by   Salem Benferhat, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/15/2012

Merging Knowledge Bases in Possibilistic Logic by Lexicographic Aggregation

Belief merging is an important but difficult problem in Artificial Intel...
research
03/13/2013

Lattice-Based Graded Logic: a Multimodal Approach

Experts do not always feel very, comfortable when they have to give prec...
research
10/23/2019

Knowledge of Uncertain Worlds: Programming with Logical Constraints

Programming with logic for sophisticated applications must deal with rec...
research
09/16/2002

Reasoning about Evolving Nonmonotonic Knowledge Bases

Recently, several approaches to updating knowledge bases modeled as exte...
research
06/05/2023

Connecting Proof Theory and Knowledge Representation: Sequent Calculi and the Chase with Existential Rules

Chase algorithms are indispensable in the domain of knowledge base query...
research
08/30/2023

Benchmarking for Integrating Logic Rules with Everything Else

Integrating logic rules with other language features is increasingly sou...
research
01/23/2013

Possibilistic logic bases and possibilistic graphs

Possibilistic logic bases and possibilistic graphs are two different fra...

Please sign up or login with your details

Forgot password? Click here to reset