Symbolic Possibilistic Logic: Completeness and Inference Methods
This paper studies the extension of possibilistic logic to the case when weights attached to formulas are symbolic and stand for variables that lie in a totally ordered scale, and only partial knowledge is available on the relative strength of these weights. A proof of the soundness and the completeness of this logic according to the relative certainty semantics in the sense of necessity measures is provided. Based on this result, two syntactic inference methods are presented. The first one calculates the necessity degree of a possibilistic formula using the notion of minimal inconsistent sub-base. A second method is proposed that takes inspiration from the concept of ATMS. Notions introduced in that area, such as nogoods and labels, are used to calculate the necessity degree of a possibilistic formula. A comparison of the two methods is provided, as well as a comparison with the original version of symbolic possibilistic logic.
- 1.Dubois, D., Lang, J., Prade, H.: Possibilistic logic. In: Gabbay, D., Hogger, C., Robinson, J., Nute, D. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 439–513. Oxford University Press, Oxford (1994)Google Scholar
- 2.Dubois, D., Prade, H.: Possibility theory: qualitative and quantitative aspects. In: Smets, P. (ed.) Handbook on Defeasible Reasoning and Uncertainty Management Systems. Quantified Representation of Uncertainty and Imprecision, vol. 1, pp. 169–226. Kluwer Academic Publ., Dordrecht (1998)Google Scholar
- 3.Dubois, D., Prade, H.: Possibilistic logic - an overview. In: Gabbay, D., Siekmann, J., Woods, J., (eds.): Computational Logic. Handbook of the History of Logic. vol. 9, pp. 283–342. Elsevier (2014)Google Scholar
- 4.Benferhat, S., Prade, H.: Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic. In: Kaelbling, L.P., Saffiotti, A., (eds.): IJCAI, pp. 1281–1286 Professional Book Center (2005)Google Scholar
- 6.Benferhat, S., Lagrue, S., Papini, O.: A possibilistic handling of partially ordered information. In: Proceedings 19th Conference on Uncertainty in Artificial Intelligence UAI 2003, pp. 29–36 (2003)Google Scholar
- 13.De Kleer, J.: A general labeling algorithm for assumption-based truth maintenance. AAAI 88, 188–192 (1988)Google Scholar