Revising Possibilistic Knowledge Bases via Compatibility Degrees

Possibilistic logic is a weighted logic for dealing with incomplete and uncertain information by assigning weights to propositional formulas. A possibilistic knowledge base (KB) is a finite set of such formulas. The problem of revising a possibilistic KB by possibilistic formula is not new. However, existing approaches are limited in two ways. Firstly, they suffer from the so-called drowning effect. Secondly, they handle certain and uncertain formulas separately and most only handle certain inputs. In this paper, we propose a unified approach that caters for revision by both certain and uncertain inputs and relieves the drowning effect. The approach is based on a refined inconsistency degree function called compatibility degree which provides a unifying framework (called cd-revision) for defining specific revision operators for possibilistic KBs. Our definition leads to an algorithm for computing the result of the proposed revision. The revision operators defined in cd-revision possess some desirable properties including those from classic belief revision and some others that are specific to possibilistic revision. We also show that several major revision operators for possibilistic, stratified and prioritised KBs can be embedded in cd-revision.

[1]  Peter Gärdenfors,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[2]  Bernhard Nebel,et al.  Belief Revision and Default Reasoning: Syntax-Based Approaches , 1991, KR.

[3]  Martine De Cock,et al.  Possible and Necessary Answer Sets of Possibilistic Answer Set Programs , 2012, 2012 IEEE 24th International Conference on Tools with Artificial Intelligence.

[4]  Weiru Liu,et al.  A framework for managing uncertain inputs: An axiomization of rewarding , 2011, Int. J. Approx. Reason..

[5]  Guilin Qi,et al.  A Semantic Approach for Iterated Revision in Possibilistic Logic , 2008, AAAI.

[6]  Salem Benferhat,et al.  Syntactic Computation of Hybrid Possibilistic Conditioning under Uncertain Inputs , 2013, IJCAI.

[7]  Didier Dubois,et al.  A synthetic view of belief revision with uncertain inputs in the framework of possibility theory , 1997, Int. J. Approx. Reason..

[8]  Martine De Cock,et al.  Semantics for possibilistic answer set programs: Uncertain rules versus rules with uncertain conclusions , 2014, Int. J. Approx. Reason..

[9]  Bernhard Nebel,et al.  How Hard is it to Revise a Belief Base , 1996 .

[10]  Salem Benferhat,et al.  Hybrid Possibilistic Conditioning for Revision under Weighted Inputs , 2012, ECAI.

[11]  Hirofumi Katsuno,et al.  Propositional Knowledge Base Revision and Minimal Change , 1991, Artif. Intell..

[12]  Didier Dubois,et al.  A Framework for Iterated Belief Revision Using Possibilistic Counterparts to Jeffrey's Rule , 2010, Fundam. Informaticae.

[13]  Henri Prade,et al.  A Practical Approach to Revising Prioritized Knowledge Bases , 2002, Stud Logica.

[14]  H. Prade,et al.  Possibilistic logic , 1994 .

[15]  Didier Dubois,et al.  Inconsistency Management and Prioritized Syntax-Based Entailment , 1993, IJCAI.

[16]  Gerhard Brewka,et al.  Preferred Subtheories: An Extended Logical Framework for Default Reasoning , 1989, IJCAI.

[17]  Didier Dubois,et al.  Generalized Possibilistic Logic , 2011, SUM.

[18]  Guilin Qi,et al.  Conflict-Based Belief Revision Operators in Possibilistic Logic , 2012, AAAI.