{"type":"ScholarlyArticle","title":"Theorem Proving Under Uncertainty - A Possibility Theory-based Approach","authors":[{"name":"Didier Dubois","slug":"didier-dubois","given":"Didier","family":"Dubois","affiliation":""},{"name":"Jérôme Lang","slug":"jerome-lang","given":"Jérôme","family":"Lang","affiliation":""},{"name":"Henri Prade","slug":"henri-prade","given":"Henri","family":"Prade","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1987/202","pdf":"https://ijcai.org/proceedings/1987/0202.pdf","markdown":"https://ijcai.org/proceedings/1987/202.md","bibtex":"https://ijcai.org/proceedings/1987/bibtex/202","volume":{"slug":"1987","title":"Proceedings of the Tenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1987","url":"https://ijcai.org/proceedings/1987/","year":1987,"location":"Milan, Italy","dates":"","editors":"John McDermott","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Reasoning","track":"Reasoning","number":202,"pages":{"first":984,"last":985},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}