Longer presentations about jumpstart projects

Decker "Layers for Interoperability on the Web"

Lynn: why is order so important as to be part of the base, and not say
synonomy, and transitivity?

Stefan: transitivity requires computation, which we wanted to avoid at the
lowest level. Ordering is motivated in part by UML.

Tim: How much effort to produce an RDF syntax canonicalizer using XSLT?
Dan: not much, ~40 hours.

Ora: can do this easily with a set of SAX event handlers that output
canonicalized RDF. I have an RDF parser in Common Lisp which I intend to
contribute to the DAML community.discussion of oil:subClassOf

DanC writes:

type(x,AandB)
[] -- rdf:type --> oil:AND
-- lhs --> A
-- rhs --> B

Connolly

see Dan's notes
Revision: 1.12 of Date: 2000/07/19 09:21:40 by Author: connolly (was then
known as "hs78", but Dan expanded that
into an explanation of his use of XSLT
to extract RDF from XHTML pages.)

McGuinness: pointers to particularly interesting ontologies

Soundness under deletion of arcs

DanC:

must model this such that deleting one of the premise arcs doesn't lead you
to incorrect conclusions. You will know less about some of the objects, but
you will know that there is something about which you don't know anything.

Stefan: It is not completely correct to view RDF as a conjunction when
modelling rules.

DanC: quoting is the technique to express the two levels together.

Massimo: adding a Cardinality property to Stefan's representation will
resolve the monotonicity.

If you delete the 'implies' arc, all you have left is "there is a sentence
that says it is raining today".

Tim: note that you don't have to reify the {implies, x, false}
statement.

Jeff expresses concern about the syntax for reification.

Tim: RDF is the form for exchanging on the Web, should we have a short-hand
form for e-mail, irc, whiteboard?

DanC: there will be SVG tools that let us draw the same diagrams that we're
drawing on the whiteboard. For exchange with colleagues, exploit one of the
existing syntaxes; prolog, etc.; don't need more syntaxes.

Deborah: good to exploit existing KIF tools too.

Tim: need KIF with URIs. Consider adding namespaces to one of the existing
KR languages?

DanC: Guha is doing a form of this with SQL.

Questions

SHOE's motivation for binary relations to n-ary relations
[Brickley]

Modeling definitive lists / local closed-worlds

Is 'order' primary or secondary?

What are the primary constructors?
[DanC: implies, NOT, forAll]

inverse

maximum cardinality 1 (unique/equivalent)

Expectations about what is in DAML [0.x]
Ora: RDF for basic underlying representation plus SHOE with only binary
predicates

Are lists an acceptable way to close parts of your model?

[Jeff] How to deal with inconsistent statements you may find.

[Jeff] How to know which rules are applicable? like import.

[Tim] Drop anything from RDF 1.0, RDF Schema?

Jeff: e.g. aboutEachPrefix

Dan's list at http://www.w3.org/2000/07/hs78/

[Tim] pointer from a document to a transform that will create RDF and to
the result of this transform.

Layers

layer 3: ?n-ary relations

layer 2: ?FOPC

layer 1: ?Horn clauses

layer 0: RDF 1.0 Model ?+Schema

DanC: don't want to require every application to have a first-order theorem
prover.

Deborah: interoperability at the level of deductive closure; different
logic systems will conclude the same things. Levels of compatibility: able to
consume the facts without complaint, finding the explicit facts, making the
same deductions.