Abstract
Propositional possibilistic logic is a logic of uncertainty in which the notion of inconsistency is gradual, each interpretation having a compatibility degree with the uncertain available knowledge. We present here an algorithm for the search of the best interpretation of a set of uncertain clauses (i.e., the most compatible with it), which is an extension to possibilistic logic of semantic evaluation (based on the Davis and Putnam procedure). Possibilistic logic is also a general framework for translating discrete "min-max" optimisation problems (some examples of such problems are discussed).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Davis M., Putnam H. (1960) A computing procedure for quantification theory. J. of the Assoc. for Computing Machinery, 7, 201–215.
Dubois D., Prade H. (1980) Fuzzy Sets and Systems: Theory and Applications. Mathematics in Science and Engineering Series, Vol. 144, Academic Press, New York.
Dubois D., Prade H. (1987) Necessity measures and the resolution principle. IEEE Trans. Systems, Man and Cybernetics, 17, 474–478.
Dubois D., Lang J., Prade H. (1987) Theorem proving under uncertainty — A possibility theory-based approach. Proc. 10th Inter. Joint Conf. on Artificial Intelligence, Milano, 984–986.
Dubois D., Prade H. (1988) (with the collaboration of Farreny H., Martin-Clouaire R., Testemale C.) Possibility theory: an Approach to Computerized Processing of Uncertainty, Plenum Press, New York.
Dubois D., Lang J., Prade H. (1989) Automated reasoning using posibilistic logic: semantics, non-monotonocity and variable certainty weights. Proc. 5th Workshop on Uncertainty in Artificial Intelligence, Windsor (Canada), Aug. 18–20, 81–87.
Dubois D., Lang J., Prade H. (1990a) POSLOG: an inference system based on possibilistic logic. Proc. in National Fuzzy Information Processing Society Congress, 1990, to appear.
Dubois D., Lang J., Prade H. (1990b) Fuzzy sets in automated reasoning: logical approaches. Fuzzy Sets and Systems, to appear.
Jeannicot S., Oxusoff L., Rauzy A. (1988) Evaluation sémantique: une propriété de coupure pour rendre efficace la procédure de Davis et Putnam. Revue d'Intelligence Artificielle, 2(1), 41–60.
Lang J. (1990) Evaluation sémantique en logique possibiliste propositionnelle. Research Report IRIT/90-7/R, IRIT, Univ. P. Sabatier, Toulouse, France. Revue d'Intelligence Artificielle, 4(4), 27–48.
Lang J. (1991) “Logique possibiliste: aspects formels, déduction automatique, et applications. Thèse de l'Université P. Sabatier, Toulouse, France.
Oxusoff L., Rauzy A. (1989) L'évaluation sémantique en calcul propositionnel. PhD of the University Aix-Marseille II, January 1989.
Purdom P.W. (1983) Search rearrangement backtracking and polynomial average time. Artificial Intelligence, 21, 117–133.
Rosenfeld A. (1975) Fuzzy graphs. In: Fuzzy Sets and their Applications to Cognitive and Decision Processes (L.A. Zadeh, K.S. Fu, K. Tanaka, and M. Shimura, eds), Academic Press, New York, 77–95.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lang, J. (1991). Semantic evaluation in possibilistic logic application to min-max discrete optimisation problems. In: Bouchon-Meunier, B., Yager, R.R., Zadeh, L.A. (eds) Uncertainty in Knowledge Bases. IPMU 1990. Lecture Notes in Computer Science, vol 521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028111
Download citation
DOI: https://doi.org/10.1007/BFb0028111
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54346-6
Online ISBN: 978-3-540-47580-4
eBook Packages: Springer Book Archive