Thread Links Date Links
Thread Prev Thread Next Thread Index Date Prev Date Next Date Index

SUO-STAT Multi-Source Ontology (MSO) Ballot Question




ATTN Voting Members of IEEE P1600.1 Standard Upper Ontology Working
Group:

1.  Please acknowledge receipt of this ballot by Feb 17, 2004.  But if
you vote by that date, there is no need to also acknowledge.

2. Please cast a vote on the below question. 

3. Votes may be in the form of YES, NO, or ABSTAIN.  The motion will pass
if both (a majority of voting members either vote or acknowledge receipt
of the ballot) and (YES votes are greater than [NO plus ABSTAIN votes]).

4. The period for voting will end at midnight EST on Mar 2, 2004.  If a
majority of voting members have not yet voted or acknowledged, the chair
may extend the period for voting and may remind those who have not
responded.

5. Please email your vote to me (at jim.s3@juno.com),  not the SUO list,
unless you specifically want your vote (and any comments) shared with
everyone.  

6. Comments and discussions on the merits of this motion are permitted
during the voting period, but the wording will not be changed.

Jim Schoening
Chair, IEEE P1600.1 Standard Upper Ontology  Working Group
Jim.S3@juno.com


================================================

Ballot Question:

  "The IEEE P1600.1 Standard Upper Ontology Working Group resolves to 
   commence work on the Multi-Source Ontology (MSO) of the WebKB-2
   knowledge server (www.webkb.org)."

Background:

The features and rationales of WebKB-2 and its MSO have been previously
introduced: http://www.webkb.org/doc/onSUOlist/m031202Schoening.html
(plus subsequent messages stored in the same directory).

In short, each object - a category (type or individual), a link between 
categories, or a more complex statement (graph) - has an associated
source (user and/or document), and a Web user can 
1) query, re-use and add new categories, links or graphs,
2) remove those she have created (and mainly only those),
3) "correct other graphs" (represent alternative beliefs) by using
   relations such as pm#corrective_specialization.
Knowledge additions being centralized and incremental, the objects
can be highly interconnected (hence, retrievable and re-usable) and
each detected inconsistency or redundancy is solved by its author, thus
guiding her to write more precise and (re-)usable knowledge. 
However, the users can (and are advised to) store and document
their knowledge within Web files and ask WebKB-2 to parse these files
(until no error is detected and the knowledge is commited in the KB).

The MSO of WebKB-2 is currently mainly composed of an extension and
correction of the noun-related part of WordNet 1.7 plus some top-level 
ontologies (mainly, extensions of those of John Sowa in his books of 
1984 and 2000, DOLCE, OWL and various categories from other sources):
details are accessible from http://www.webkb.org/doc/papers/iccs03/

The integration of the SUMO is in progress. The 4D ontology named
"Lifecycle integration Schema" is (and will remain) loosely integrated.
This ontology, some general statements, and a few small domain ontologies
are listed as example files in http://www.webkb.org/kb/
A 4-level indented list of the upper part of the resulting taxonomy
can by accessed via
http://www.webkb.org/bin/categSearch.cgi?categ=pm%23thing&recursLink=%3E&;
depth=3&hyperlinks
If the link encodings is a problem, add &longLinkNames at the end of
the URL or see http://www.webkb.org/doc/onSUOlist/m031216phmartin.html
An indented list of the relation types can be accessed via
http://www.webkb.org/bin/categSearch.cgi?categ=pm%23elation&recursLink=%3
E&hyperlinks

Filtering on a particular source can be done, e.g. enter sumo#* in the
Category Search interface:
http://www.webkb.org/interface/categSearch.html
(in the displayed taxonomies, dots replace categories not from the SUMO).

________________________________________________________________
The best thing to hit the Internet in years - Juno SpeedBand!
Surf the Web up to FIVE TIMES FASTER!
Only $14.95/ month - visit www.juno.com to sign up today!