- From: Pat Hayes <phayes@ai.uwf.edu>
- Date: Tue, 16 Oct 2001 00:09:12 -0500
- To: Sandro Hawke <sandro@w3.org>
- Cc: www-rdf-logic@w3.org
> > [Pat Hayes] >> Why in an RDF graph syntax? (What is so special about RDF? Its one >> among thousands of possible notations, and its not a particularly >> good one. The limitations of simple graphs as a notation have been >> known for about a century, so why would we want to deliberately go >> back to the stone age to find a basis for the world wide web?) > >While linear syntax are nestable (which is nice), graph syntaxes allow >peices of any size to be added & removed without disturbing other >peices. Think of Linda tuple spaces [1]. That's a pretty nice >property to have in a distributed system. So do conjunctions of assertions in any conventional logic. Most assertional languages talk about sets (or bags) of sentences as the top-level construct. An RDF graph is a set (or bag) of triples. Pat -- --------------------------------------------------------------------- IHMC (850)434 8903 home 40 South Alcaniz St. (850)202 4416 office Pensacola, FL 32501 (850)202 4440 fax phayes@ai.uwf.edu http://www.coginst.uwf.edu/~phayes
Received on Tuesday, 16 October 2001 01:09:16 UTC