Pat, (01)
PC> At a minimum I think an ontology should aspire to the meaning
> of "meaning" suggested by the name of "Procedural Semantics" by
> William Woods in "Meaning and Links: AI Magazine 28(4) Winter 2007 (02)
Bill has been using the term "procedural semantics" for over 40 years.
Please note that the following statement you quoted from his 2007
paper does not go beyond a Tarski-style semantics: (03)
WW> In this theory the meaning of a noun is a procedure for recognizing
> or generating instances, the meaning of a proposition is a procedure
> for determining if it is true or false, and the meaning of an action
> is the ability to do the action or to tell if it has been done. (04)
Formal semantics defines the meaning of a noun (or any other part
of speech) by truth conditions. Bill W. focused on the procedural
methods for determining whether those conditions hold (in language
recognition) or for using the assumption that those conditions
hold (in language generation). (05)
In short, procedural semantics in WW's definition is exactly what
any programmer does in mapping a formal specification into a program.
Very often, programmers start with a program without having or using
any axioms. But that doesn't mean that they have in any way gone
beyond what *could* be stated in axioms. (06)
PC> ... what the entity means to a computer, which is how the computer
> uses it in an application, which is grounded on the logical inferences
> derivable from the ontological relations, but may be modified by
> procedural code in an application. (07)
I agree that programmers may (and often do) "modify" the meaning
beyond what the axioms (i.e., formal specifications) imply.
Those modifications are of two different kinds: (08)
1. "Issues" in Microsoft's terms or "bugs" in normal parlance,
when they are inconsistent with the axioms. (09)
2. Application-dependent restrictions, when they limit the
meaning by adding constraints that are not specified by
the axioms. (010)
The bugs or issues in point #1 are modifications that create
incompatibilities. But the restrictions in point #2 are normal
in computer applications. In fact, they are normal in everyday
speech when people apply a general term to a specific instance. (011)
The restrictions in point #2 are no different in principle from
those stated in the axioms. They can (and, if time and funding
allows, they should) be stated in formal axioms. (012)
In summary, procedural semantics in WW's definition is exactly what
a programmer does in mapping formal axioms to a computer program. (013)
John (014)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J
To Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx (015)
|