Theorem Proving Under Uncertainty - A Possibility Theory-based Approach
Proceedings of the Tenth International Joint Conference on Artificial Intelligence. Reasoning. Pages 984-985.
Abstract
In this paper an extension of the resolution principle to uncertain clauses is proposed. Uncertainty 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 (w~h 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.
@inproceedings{ijcai1987p202,
title = {Theorem Proving Under Uncertainty - A Possibility Theory-based Approach},
author = {Dubois, Didier and Lang, Jérôme and Prade, Henri},
booktitle = {Proceedings of the Tenth International Joint Conference on
Artificial Intelligence, {IJCAI-87}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John McDermott},
pages = {984--985},
year = {1987},
note = {Reasoning},
url = {https://ijcai.org/proceedings/1987/202},
}
TY - CPAPER TI - Theorem Proving Under Uncertainty - A Possibility Theory-based Approach AU - Dubois, Didier AU - Lang, Jérôme AU - Prade, Henri T2 - Proceedings of the Tenth International Joint Conference on Artificial Intelligence, IJCAI-87 PB - International Joint Conferences on Artificial Intelligence PY - 1987 SP - 984 EP - 985 UR - https://ijcai.org/proceedings/1987/202 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
