Abstract
It is widely agreed that any reasonable AI system has to reason. Once it is agreed why that must be so, one can go on to look at alternative conceptions of what reasoning consist of. This chapter presents an extremely partial and incomplete survey of some of the options.
This is a preview of subscription content, log in via an 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
Brachman, R.J., R.E. Fikes, and H. Levesque, “KRYPTON: Integrating Terminology and Assertion,” in Proc. National Conference on Artificial Intelligence, AAAI83, Washington, D.C, August, 1983, pp. 31–35.
Brachman, R, and D. Israel, “Some Remarks on the Semantics of Representation Languages,” in in Brodie, Mylopoulos, Schmidt (eds.), Conceptual Modelling: Perspectives from Artificial Intelligence, Databases, and Programming Languages, Springer-Verlag, New York, 1984, pp. 119–142.
Brachman, R, V. Pigman, and H. Levesque, “An Essential Hybrid Reasoning System: Knowledge and Symbol Level Accounts of Krypton,” in Proc. Ninth International Joint Conference on Artificial Intelligence, Los Angeles, CA, Ninth International Joint Conference on Artificial Intelligence, 1985, Vol I, pp. 532–539.
Cherniak, C., “Computational Complexity and the Universal Acceptance of Logic,” in The Journal of Philosophy, Vol. LXXXI, No. 20, December, 1984.
Israel, D., “Interpreting Network Formalisms,” in N.J. Cercone (ed.), Computational Linguistics, International Series in Modern Applied Mathematics and Computer Science, Vol. 5, 1983, Pergamon Press, Toronto, pp. 1–13.
Jieh Hsiang, “Refutational Theorem Proving using TermRewriting Systems,” in Artificial Intelligence, Vol. 25, March, 1985, pp. 225–300.
Lewis, H., “Complexity of Solvable Cases of the Decision Problem for the Predicate Calculus,” in Proc. 19th IEEE Symposium on Foundations of Computer Science, 1978, pp. 35–47.
Newell, A., “The Knowledge Level,” Presidential Address, American Association for Artificial Intelligence, AAAI80, Stanford University, Stanford, CA (19 August 1980), in AI Magazine, Vol., No. 2 (Summer 1981 ), pp. 1–20.
Reiter, R., “Towards a Logical Reconstruction of Relational Database Theory,” in [BMS84], 1984.
Stickel, M., “Automated Deduction by Theory Resolution,” SRI Technical Note No. 340, Menlo Park, CA, 1984. (A version of this paper is to appear, under the same title, in J. Automated Reasoning, 1985.)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag, New York Inc.
About this chapter
Cite this chapter
Israel, D. (1986). Notes on Inference: A Somewhat Skewed Survey. In: Brodie, M.L., Mylopoulos, J. (eds) On Knowledge Base Management Systems. Topics in Information Systems. Springer, New York, NY. https://doi.org/10.1007/978-1-4612-4980-1_12
Download citation
DOI: https://doi.org/10.1007/978-1-4612-4980-1_12
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-9383-5
Online ISBN: 978-1-4612-4980-1
eBook Packages: Springer Book Archive