SUO: *Date 15 Jan 2002
¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤
ja's notes & replies for 15 jan 2002 --
re_1: seth russell, 'Where are the axioms that establish the condition of a class?'
SR = Seth Russell
¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤
Subj: Where are the axioms that establish the condition of a class ?
Date: Mon, 14 Jan 2002 22:37:47 -0800
From: Seth Russell <seth@robustai.net>
To: Ian Niles <iniles@teknowledge.com>,
<standard-upper-ontology@ieee.org>
SR: Consider a situation that tests real time reality or a situation where
we need to run a program or test a voltage against a threshold before we
can determine if an object has an attribute or is an instance of a class.
How do we express the relationship between the class (or attribute) and
a program which senses it? For example a program that asks a person
a question and returns a value {True, False, NoAnswer} according to
their answer to the question: "Are you married?" Where do we put
that *program* in our ontology? Why can't I find programs anywhere?
seth, if you are really interested in predicates that are computable by programs,
and not just being coy, then you need to look into computability theory, of which
i don't think you'll find a bunch in sumo world. my first ventures into the area,
in many ways still my favorite books, were arbib, and minsky & papert. also good
for quick brushes with the topic are boolos & jeffrey, cutland, and davis. enjoy!
| Arbib, M.A.,
|'Brains, Machines, Mathematics', 1st ed. 1964,
| 2nd ed., Springer-Verlag, New York, NY, 1987.
| Boolos, G.S. & Jeffrey, R.C.,
|'Computability & Logic', 2nd ed.,
| Cambridge University Press, Cambridge, UK, 1980.
| Cutland, N.J.,
|'Computability: An Introduction to Recursive Function Theory',
| Cambridge University Press, Cambridge, UK, 1980.
| Davis, M.,
|'Computability & Unsolvability', 1st ed. 1958,
| enlarged ed., Dover Pubs., New York, NY, 1982.
| Minsky, M. & Papert, S.,
|'Perceptrons: An Introduction to Computational Geometry',
| 1st ed. 1969, expanded ed., MIT Press, Cambridge, MA, 1988.
| Rogers, Hartley, Jr.,
|'Theory of Recursive Functions and Effective Computability',
| McGraw-Hill, New York, NY, 1967.
¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤~~~~~~~~~¤