Abstract
This short paper intends to provide an introduction to possibilistic logic, a logic with weighted formulas, to its various capabilities and to its potential applications. Possibilistic logic, initially proposed in [11], see also Léa Sombé [26] for an introduction, can be viewed as an important fragment of Zadeh[32]’ s possibility distribution-based theory of approximate reasoning, put in a logical form. Possibilistic logic also relies on an ordering relation reflecting the relative certainty of the formulas in the knowledge base. As it will be seen, its semantics is based on a possibility distribution which is nothing but a convenient encoding of a preference relation a la Shoham[29], between interpretations. This kind of semantics should not be confused with the similarity relation-based semantics recently proposed by Ruspini[28] for fuzzy logics which rather extends the idea of interchangeable interpretations in a coarsened universe, e.g. Fariñas del Cerro and Orlowska[17], and which corresponds to another issue.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baldwin J.F.: Support logic programming. International Journal of Intelligent Systems 1:73–104, (1986).
Chatalic P., Froidevaux, C.: Graded logics: a framework for uncertain and defeasible knowledge. in Methodologies for Intelligent Systems (eds) Z.W. Ras, M. Zemankova, Lecture Notes in Artificial Intelligence, Vol. 542, Springer Verlag, (1991).
Da Costa N.C.A.: Calculus propositionnels pour les systèmes formels inconsistants. Compte Rendu Acad. des Sciences (Paris), 257:3790–3792, (1963).
Dubois D., Lang. J, Prade, H.: Theorem-proving under uncertainty A possibilistic theory-based approach. Proceedings of 10th International Joint Conference on Artificial Intelligence, Milano, Italy, 984–986, (1987).
Dubois D., Lang, J., Prade, H.: Automated reasoning using possibilistic logic: semantics, belief revision, variable certainty weights. Proceedings 5th Workshop on Uncertainty in AI, Windsor, Ont., 81–87, (1989).
Dubois D., Lang, J., Prade, H.: Handling uncertain knowledge in an ATMS using possibilistic logic. in: Methodologies for Intelligent Systems 5 (eds) Z.W. Ras, M. Zemankova, M.L. Emrich, North-Holland, Amsterdam, 252–259, (1990).
Dubois D., Lang, J., Prade, H.: Fuzzy sets in approximate reasoning — Part 2: Logical approaches. Fuzzy Sets and Systems, 25th Anniversary Memorial Volume, 40:203–244, (1991).
Dubois D., Lang, J., Prade, H.: Towards possibilistic logic programming. Proceedings 8th International. Conf. on Logic Programming (ICLP'91), Paris, June 25–28, MIT Press, Cambridge, Mass., (1991).
Dubois D., Lang, J., Prade, H.: Inconsistency in possibilistic knowledge bases — To live or not live with it. in: Fuzzy Logic for the Management of Uncertainty (L.A. Zadeh, J. Kacprzyk, eds.), Wiley, pp 335–351, (1992).
Dubois D., Lang, J., Prade, H.: A possibilistic assumption-based truth maintenance system with uncertain justifications, and its application to belief revision. Proceedings ECAI Workshop on Truth-Maintenance Systems, Stockholm, Lecture Notes in Computer Sciences, no. 515, Springer Verlag (J.P. Martins, M. Reinfrank, eds.), 87–106, (1991).
Dubois D., Prade H.: Necessity measures and the resolution principle. IEEE Trans.on Systems, Man and Cybernetics 17:474–478, (1987).
Dubois D., Prade H.: Resolution principles in possibilistic logic. International Journal of Approximate Reasoning 4(1): 1–21, (1990).
Dubois D., Prade H.: Epistemic entrenchment and possibilistic logic. in: Tech. Report IRIT/90-2/R, IRIT, Univ. P. Sabatier, Toulouse, France, (1990). Artificial Intelligence, (50) pp 223–239, 1991.
Dubois D., Prade H.: Fuzzy sets in approximate reasoning — Part 1: Inference with possibility distributions. Fuzzy Sets and Systems, 25th Anniversary Memorial Volume 40:143–202, (1991).
Dubois D., Prade. H.: Possibilistic logic, preference models, non-monotonicity and related issues. Proceedings of the 12th International Joint Conference on Artificial Intelligence, Sydney, Australia, Aug. 24–30, pp 419–424, (1991).
Dubois D., Prade. H.: Belief revision and possibility theory. in: Belief Revision (ed) P. Gärdenfors, Cambridge University Press, pp 142–182, (1992).
Fariras del Cerro L., Orlowska, E.: DAL-A logic for data analysis. Theoretical Comp. Sci. 36: 251–264, (1985).
Froidevaux C., Grossetète C.: Graded default theories for uncertainty. Proceedings of the 9th European Conference on Artificial Intelligence (ECAI-90), 6–10, (1990), 283–288.
Gärdenfors P.: Knowledge in Flux — Modeling the Dynamics of Epistemic States. The MIT Press, Cambridge, (1988).
Jackson P.: Possibilistic prime implicates and their use in abduction. Research Note, McDonnell Douglas Research Lab., St Louis, MO, (1991).
Kraus S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence 44(1–2):134–207, (1990).
Lang J.: Semantic evaluation in possibilistic logic. in: Uncertainty in Knowledge Bases (B. Bouchon-Meunier, R.R. Yager, L.A. Zadeh, eds.), Lecture Notes in Computer Science, Vol. 521, Springer Verlag, 260–268, (1991).
Lang J.: Possibilistic logic as a logical framework for min-max discrete optimisation problems and prioritized constraints. in: Fundamentals of Artificial Intelligence Research (P. Jorrand, J. Kelemen, eds.), Lecture Notes in Artificial Intelligence, Vol. 535, Springer Verlag, 112–126, (1991).
Lang J., Dubois. D., Prade, H.: A logic of graded possibility and certainty coping with partial inconsistency. Proceedings 7th Conference on Uncertainty in AI, Morgan Kaufmann, (1990).
Larsen H.L., Nonfjall, H.: Modeling in the design of a KBS validation system. Proceedings 3rd International Fuzzy Systems Assoc. (IFSA), (1989), 341–344.
Lèa Sombé, Besnard, P., Cordier, M., Dubois, D., Fariras, C., del Cerro, Froidevaux, C.,Moinard, Y., Prade, H. Schwind, L., Siegel, D.: Reasoning Under Incomplete Information in Artificial Intelligence: A Comparison of Formalisms Using a Single Example. Wiley, New York, (1990).
Makinson D., Gärdenfors, P.: Relation between the logic of theory change and non-monotonic logic. in: The Logic of Theory Change (eds) A. Fuhrmann, M. Morreau, Lecture Notes in Computer Sciences, no. 465, Springer Verlag, 185–205, (1991).
Ruspini E.H.: On the semantics of fuzzy logic. International Journal of Approximate Reasoning 5:45–88, (1991).
Shoham Y.: Reasoning About Change — Time and Causation from the Standpoint of Artificial Intelligence. MIT Press, Cambridge, Mass., (1988).
Yager, R.R., Larsen, H.L.: On discovering potential inconsistencies in validating uncertain knowledge bases by reflecting on the input. Tech. Rep. #MII-1001, Iona College, New Rochelle, N.Y., (1990).
Zadeh L. A.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems 1:3–28, (1978).
Zadeh L.A.: A theory of approximate reasoning. in: Machine Intelligence 9 (eds) J.E. Hayes, D. Michie, L.I. Mikulich, Elsevier, New York, 149–194, (1979).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dubois, D., Lang, J., Prade, H. (1994). Handling uncertainty, context, vague predicates, and partial inconsistency in possibilistic logic. In: Driankov, D., Eklund, P.W., Ralescu, A.L. (eds) Fuzzy Logic and Fuzzy Control. IJCAI 1991. Lecture Notes in Computer Science, vol 833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58279-7_18
Download citation
DOI: https://doi.org/10.1007/3-540-58279-7_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58279-3
Online ISBN: 978-3-540-48602-2
eBook Packages: Springer Book Archive