next up previous
Next: Introduction

APPROXIMATE OBJECTS AND APPROXIMATE THEORIES

John McCarthy
Computer Science Department
Stanford University
Stanford, CA 94305
jmc@cs.stanford.edu
http://www-formal.stanford.edu/jmc/

February 2, 2000 , tex2html_wrap366

Abstract:

We propose to extend the ontology of logical AI to include approximate objects, approximate predicates and approximate theories. Besides the ontology we treat the relations among different approximate theories of the same phenomena.

Approximate predicates can't have complete if-and-only-if definitions and usually don't even have definite extensions. Some approximate concepts can be refined by learning more and some by defining more and some by both, but it isn't possible in general to make them well-defined. Approximate concepts are essential for representing common sense knowledge and doing common sense reasoning. Assertions involving approximate concepts can be represented in mathematical logic.

A sentence involving an approximate concept may have a definite truth value even if the concept is ill-defined. It is definite that Mount Everest was climbed in 1953 even though exactly what rock and ice is included in that mountain is ill-defined. Likewise, it harms a mosquito to be swatted, although we haven't a sharp notion of what it means to harm a mosquito. Whatif(x,p), which denotes what x would be like if p were true, is an important kind of approximate object.

The article treats successively approximate objects, approximate theories, and formalisms for describing how one object or theory approximates another.

tex2html_wrap364




John McCarthy
Wed Feb 2 15:59:04 PST 2000