Inscription — A rule of conjecture
Conjectural reasoning, introduced by McCarthy's circumscription is one of the most important non standard methods of inference. It allows the generation of plausible conclusions, plausibility being defined on the basis of a minimization criterion.
Inscription — a dual of circumscription — is another method for “jumping to conclusions” based on a maximization criterion suitable for inductive reasoning.
Examples of circumscription and inscription and an application of inscription to inductive reasoning are presented.
Unable to display preview. Download preview PDF.
- McCarthy J., “Circumscription — A form of non-monotonic reasoning”, Artificial Intelligence 13, pp. 27–39, 1980.Google Scholar
- McCarthy J., “Applications of Circumscription to Formalizing Common-sense knowledge”, Artificial Intelligence 28, pp. 89–116, 1986.Google Scholar
- Hanks S. e McDermott D., “Default reasoning, nonmonotonic logics, and the frame problem”, Proceedings of the Fifth National Conference on Artificial Intelligence, pp. 328–333, 1986.Google Scholar
- Genesereth M.J. and Nilsson N.J., Logical Foundations of Artificial Intelligence, Los Altos, CA: Morgan Kaufmann, 1987.Google Scholar
- Shoham Y., “Nonmonotonic Logics: Meaning and Utility”, Proceedings of the Tenth International Joint Conference on Artificial Intelligence, pp. 388–392, Milan, Italy, 1987.Google Scholar
- Besnard P. and Siegel P., “The Preferential-Models Approach to Non-Monotonic Logics”, Non-Standard Logics for Automated Reasoning, Ed. Smets, Mamdani, Dubois, and Prad. New York: Academic Press, pp. 137–161, 1988.Google Scholar
- Reiter R., “On Closed World Databases”, Logic and Databases. Ed H. Gallaire and J. Minker, pp 55–76. New York: Plenum Press, 1978.Google Scholar
- Bossu G., and Siegel P., “Saturation, Non Monotonic Reasoning, and The Closed World Assumption”, Artificial Intelligence 25, pp. 13–63, 1985.Google Scholar