Possibilistic qualification and default rules
We discuss the problems involved in representing default knowledge. We suggest that default knowledge can be captured by using possibility qualified statements. We investigate the representation of possibility qualified statements via the theory of approximate reasoning. We apply our representation scheme to some examples. In particular, we show that this scheme gives reasonable results for a knowledge base in which we have "normally Quakers are pacifists" and "normally republicans are not pacifists".
Unable to display preview. Download preview PDF.
- Perlis, D. "Bibliography of literature on nonmonotonic reasoning," Proc. Non-Monotonic Reasoning Workshop, New Paltz, N.Y., 396–401, 1984.Google Scholar
- Reiter, R., "On reasoning by default," Proc. Second Symp. on Theoretical Issues in Natural Language Processing, Urbana, Ill., 1978.Google Scholar
- Reiter, R., "A logic for default reasoning," Artificial Intelligence 13, 81–132, 1980.Google Scholar
- Yager, R.R., "Using approximate reasoning to represent default knowledge," Artificial Intelligence 31, 99–112, 1987.Google Scholar
- Yager, R.R., "On associations between variables in expert systems including default relations," Tech Report MII-616, Machine Intelligence Institute, Iona College, 1986.Google Scholar
- Zadeh, L.A., "A theory of approximate reasoning," in Machine Intelligence Vol. 9, Hayes, J.E., Michie, D. & Kulich, L.I. (eds.), John Wiley and Sons: New York, 149–194, 1979.Google Scholar
- Zadeh, L.A., "PRUF-A meaning representation language for natural languages," Int. J. of Man-Machine Studies 10, 395–460, 1978.Google Scholar
- Sanchez, E., "On possibility qualification in natural languages," Information Sciences 15, 45–76, 1978.Google Scholar
- McCarthy, J., "Applications of Circumscription to formalizing commonsense knowledge," Artificial Intelligence 28, 89–116, 1986.Google Scholar
- Touretzky, D.S., The Mathematics of Inheritance Systems, Morgan Kaufmann: Los Altos, CA., 1986.Google Scholar