Theorem proving under uncertainty: a possibility theory-based approach

Authors:
Didier Dubois;Jerome Lang;Henri Prade
Affiliations:
L.S.I., Universite P. Sabatier, Toulouse Cedex, France;L.S.I., Universite P. Sabatier, Toulouse Cedex, France;L.S.I., Universite P. Sabatier, Toulouse Cedex, France
Venue:
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
Year:
1987

Citing 4
Cited 3

A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
Fuzzy Logic and the Resolution Principle

Journal of the ACM (JACM)
Symbolic Logic and Mechanical Theorem Proving

Symbolic Logic and Mechanical Theorem Proving
Fuzzy Sets and Systems: Theory and Applications

Fuzzy Sets and Systems: Theory and Applications

Lattice-based graded logic: a multimodal approach

UAI'92 Proceedings of the Eighth international conference on Uncertainty in artificial intelligence
A logic of graded possibility and certainty coping with partial inconsistency

UAI'91 Proceedings of the Seventh conference on Uncertainty in Artificial Intelligence
On the combination of logical and probabilistic models for information analysis

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper an extension of the resolution principle to uncertain clauses is proposed. Uncertainly is here estimated in terms of necessity measures introduced in the framework of possibility theory. A refutation method using a linear strategy is presented. It makes use of an ordered search method (with a non-additive evaluation function) in order to produce an optimal refutation, which enables us to obtain the greatest possible lower bound for the necessity measure attached to the clause to prove. An illustrative example is given. Further extensions of the proposed approach, especially to cope with inconsistent sets of clauses, are mentioned.