Abstract
Logic of plausible reasoning (LPR) is a formalism which is based on human inference patterns. In the paper the LPR is defined as a labeled deductive system. Knowledge base consists of labeled formulas representing object-attribute-value triples, implications, hierarchies, dependencies and similarities between objects. Labels are used to represent plausible parameters. In the paper LPR basic semantics is defined and the proof system is proved to be correct. Finally, several examples of inference pattern application are presented.
Keywords
- logic of plausible reasoning
- uncertain knowledge representation
- semantics of the logic of plausible reasoning
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Boehm-Davis, K. Dontas, and R. S. Michalski. Plausible reasoning: An outline of theory and the validation of its structural properties. In Intelligent Systems: State of the Art and Future Directions. North Holland, 1990.
A. Collins and R. S. Michalski. The logic of plausible reasoning: A core theory. Cognitive Science, 13:1–49, 1989.
D. M. Gabbay. LDS-Labeled Deductive Systems. Oxford University Press, 1991.
F. Lehmann. Semantic networks. In F. Lehmann, editor, Semantic Networks in Artificial Intelligence. Pergamon Press, 1992.
J. Łukasiewicz. Many-valued systems of propositional logic. In S. McCall, editor, Polish logic. Oxford University Press, 1967.
R. S. Michalski. A theory and methodology of inductive learning. Artificial Intelligence, 20:111–161, 1983.
R. S. Michalski. Inferential theory of learning: Developing foundations for multi-strategy learning. In R. S. Michalski, editor, Machine Learning: A Multistrategy Approach, Volume IV. Morgan Kaufmann Publishers, 1994.
Z. Pawlak. Rough sets. Int. J. Comp. Inf. Sci., 11:344–356, 1982.
J. Pearl. Fusion, propagation, and structuring in bayesian networks. Artificial Intelligence, 29:241–288, 1986.
G. Shafer. A Mathematical Theory of Evidence. Princeton University Press, 1976.
H. Shortliffe and B. G. Buchanan. A model of inexact reasoning in medicine. Mathematical Biosciences, 23:351–379, 1975.
R. H. Thomason. Netl and subsequent path-based inheritance theories. In F. Lehmann, editor, Semantic Networks in Artificial Intelligence. Pergamon Press, 1992.
L. A. Zadeh. Fuzzy sets. Information and Control, 8:338–353, 1965.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Śnieżyński, B. (2002). Basic Semantics of the Logic of Plausible Reasoning. In: Hacid, MS., Raś, Z.W., Zighed, D.A., Kodratoff, Y. (eds) Foundations of Intelligent Systems. ISMIS 2002. Lecture Notes in Computer Science(), vol 2366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48050-1_21
Download citation
DOI: https://doi.org/10.1007/3-540-48050-1_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43785-7
Online ISBN: 978-3-540-48050-1
eBook Packages: Springer Book Archive