Abstract
This paper introduces some preliminary formalizations of the approximate entities of [McCarthy, 2000]. Approximate objects, predicates, and theories are considered necessary for human-level AI, and we believe they enable very powerful modes of reasoning (which admittedly are not always sound). Approximation is known as vagueness in philosophical circles and is often deplored as a defective aspect of human language which infects the precision of logic. Quite to the contrary, we believe we can tame this monster by formalizing it within logic, and then can “build solid intellectual structures on such swampy conceptual foundations.” [McCarthy, 2000].
We first introduce various kinds of approximation, with motivating examples. Then we develop a simple ontology, with minimal philosophical assumptions, in which to cast our formalization. We present our formalization, and show how it captures some ideas of approximation.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alston, W. P. (1967). Vagueness. In Edwards, P., editor, Encyclopedia of Philosophy, volume 8, pages 218–221. MacMillan.
Baudisch, A., Seese, D., Tuschik, P., and Weese, M. (1985). Model-Theoretic Logics, chapter Decidability and Quantifier Elimination, pages 235–268. Springer-Verlag.
Broome, J. (1984). Indefiniteness in identity. Analysis, 44:6–12.
Costello, T. and McCarthy, J. (1999). Useful Counterfactuals. Electronic Transactions on Artificial Intelligence.
Dreyfus, H. and Dreyfus, S. (1984). From Socrates to Expert Systems: The Limits of Calculative Rationality.
Feferman, S. (1965). Some applications of the notions of forcing and generic sets. Fundamenta Mathematicae, 56:325–345.
Fine, K. (1985). Reasoning with Arbitrary Objects. Aristotelian Society Series. Oxford.
Giunchiglia, F. and Walsh, T. (1992). A theory of abstraction. Artificial Intelligence, 57(2–3):323–389.
Goguen, J. A. (1968)._The logic of inexact concepts. Synthese, 19:325–373.
Hobbs, J. R. (1985)._Granularity. In International Joint Conference on Artificial Intelligence (IJCAI’85), pages 432–435.
Howe (1994). Rich Object. In Howe, D., editor, Free Online Dictionary of Computing.
Levy, A. Y. (1994). Creating abstractions using relevance reasoning. In AAAI, Vol. 1, pages 588–594.
McCarthy, J. (1979). Ascribing mental qualities to machines. In Ringle, M., editor, Philosophical Perspectives in Artificial Intelligence. Harvester Press. Reprinted in [?].
McCarthy, J. (1998). Elaboration Tolerance. In In Proceedings of the Fourth Symposium on Logical Formalizations of Common Sense Reasoning.
McCarthy, J. (2000). Approximate objects and approximate theories. In Cohn, A. G. Giunchiglia, F., and Selman, B., editors, KR2000: Principles of Knowledge Representation and Reasoning,Proceedings of the Seventh International conference, pages 519–26. Morgan-Kaufman.
McCarthy, J. and Hayes, P. J. (1969). Some Philosophical Problems from the Standpoint of Artificial Intelligence. In Meltzer, B. and Michie, D., editors, Machine Intelligence 4, pages 463–502. Edinburgh University Press.
Morgenstern, L. (1998). Common Sense Problem Page. Web-page.
Nayak, P. P. (1994). Representing multiple theories. In Hayes-Roth, B. and Korf, R., editors, Proceedings of the Twelfth National Conference on Artificial Intelligence, pages 1154–1160, Menlo Park, CA. AAAI Press.
Nayak, P. P. and Levy, A. (1995). A semantic theory of abstractions. In Mellish, C., editor, Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pages 196–203, San Francisco. Morgan Kaufmann.
Rabin, M. O. (1965). A simple method for undecidability proofs and some applications. In Bar-Hillel, Y., editor, Logic, Methodology and Philosophy of Science, pages 58–68. North Holland Publishing Company.
Sorensen, R. (1997). Vagueness. In Zalta, E. N., editor, The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab at the Center for the Study of Language and Information, Stanford University, Stanford, CA.
Tarski, A., Mostowski, A., and Robinson, R. M. (1953). Undecid-able theories. In Studies in logic and the foundations of mathematics. North-Holland Pub. Co., Amsterdam.
Tye, M. (2000). Vagueness. In Routledge Encyclopedia of Philosophy.
Williamson, T. (1994). Vagueness. Routledge.
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
Parmar, A. (2002). Formalizing Approximate Objects and Theories: Some Initial Results. In: Koenig, S., Holte, R.C. (eds) Abstraction, Reformulation, and Approximation. SARA 2002. Lecture Notes in Computer Science(), vol 2371. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45622-8_14
Download citation
DOI: https://doi.org/10.1007/3-540-45622-8_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43941-7
Online ISBN: 978-3-540-45622-3
eBook Packages: Springer Book Archive