A Logic of Graded Possibility and Certainty Coping with Partial Inconsistency

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The proposed semantics is based on fuzzy sets of interpretations. It is tolerant to partial inconsistency. Satisfiability is extended from interpretations to fuzzy sets of interpretations, each fuzzy set representing a possibility distribution describing what is known about the state of the world. A possibilistic knowledge base is then viewed as a set of possibility distributions that satisfy it. The refutation method of automated deduction in possibilistic logic, based on previously introduced generalized resolution principle is proved to be sound and complete with respect to the proposed semantics, including the case of partial inconsistency.

[1]  Enrique H. Ruspini,et al.  On the semantics of fuzzy logic , 1991, Int. J. Approx. Reason..

[2]  G. L. S. Shackle,et al.  Decision Order and Time in Human Affairs , 1962 .

[3]  Robert Stalnaker.  A Theory of Conditionals , 2019, Knowledge and Conditionals.

[4]  Didier Dubois,et al.  Resolution principles in possibilistic logic , 1990, Int. J. Approx. Reason..

[5]  Marialuisa N. McAllister.  Possibility Theory: An Approach to Computerized Processing of Uncertainty (Didier Dubois and Henri Prade with the collaboration o f Henri Farreny, Roger Martin-Clouaire, and Claudette Testemale; E. F. Handing, trans.) , 1992, SIAM Rev..

[6]  Nils J. Nilsson,et al.  Probabilistic Logic * , 2022 .

[7]  Didier Dubois,et al.  Theorem Proving Under Uncertainty - A Possibility Theory-based Approach , 1987, IJCAI.

[8]  Didier Dubois,et al.  Handling uncertain knowledge in an ATMS using possibilistic logic , 1991 .

[9]  Wolfgang Spohn,et al.  Ordinal Conditional Functions: A Dynamic Theory of Epistemic States , 1988 .

[10]  Didier Dubois,et al.  Possibility Theory - An Approach to Computerized Processing of Uncertainty , 1988 .

[11]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[12]  Jérôme Lang.  Logique possibiliste : aspects formels, deduction automatique, et applications , 1991 .

[13]  Y. Shoham.  Reasoning About Change: Time and Causation from the Standpoint of Artificial Intelligence , 1987 .

[14]  Didier Dubois,et al.  Necessity Measures and the Resolution Principle , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[15]  Jérôme Lang.  Semantic Evaluation in Possibilistic Logic, Application to Min-Max Discrete Optimisation Problems , 1990, IPMU.

[16]  P G rdenfors,et al.  Knowledge in flux: modeling the dynamics of epistemic states , 1988 .

[17]  Didier Dubois,et al.  Possibilistic Logic, Preferential Models, Non-monotonicity and Related Issues , 1991, IJCAI.

[18]  G. L. S. Shackle,et al.  Decision Order and Time in Human Affairs , 1962 .

[19]  R R Yager,et al.  Using Approximate Reasoning to Represent Default Knowledge , 1987, Artif. Intell..

[20]  Didier Dubois,et al.  In Search of a Modal System for Possibility Theory , 1988, ECAI.

[21]  Didier Dubois,et al.  Towards Possibilistic Logic Programming , 1991, ICLP.

[22]  Arie Tzvieli.  Possibility theory: An approach to computerized processing of uncertainty , 1990, J. Am. Soc. Inf. Sci..

[23]  Didier Dubois,et al.  Epistemic Entrenchment and Possibilistic Logic , 1991, Artif. Intell..