## Possibilistic Logic: Complexity and Algorithms (1997)

Citations: | 22 - 0 self |

### BibTeX

@MISC{Lang97possibilisticlogic:,

author = {Jérôme Lang},

title = {Possibilistic Logic: Complexity and Algorithms},

year = {1997}

}

### Years of Citing Articles

### OpenURL

### Abstract

Possibilistic logic is a logic for reasoning with uncertain and partially inconsistent knowledge bases. Its standard version consists in ranking propositional formulas according to their certainty or priority level, by assigning them lower bounds of necessity values. We give a survey of automated deduction techniques for standard possibilistic logic, together with complexity results. We focus on the extensions of resolution (Section 3) and of the Davis and Putnam procedure (Section 4). In Section 5 we consider extended versions and variants of possibilistic logic. We conclude by listing the related research topics, the applicative impact of this work and further research issues. 1 Introduction Possibilistic logic is a logic of uncertainty tailored for reasoning under incomplete and partially inconsistent knowledge. At the syntactical level it handles formulae of propositional or firstorder classical logic, to which are attached lower bounds of so-called degrees of necessity and possib...