Use of 'that' to express reification in N3 type languages.

It is very tedious to write out the entire RDF reification quad when
expressing reified statements. Since N3 type languages, like Semenglish [2],
are designed to allow for easy reading and writing; and since it  is
important for us to be able to express statements about statements, it
behooves us to find some easy and obvious way to express reification.  Well
English has a easy way of doing just that with the word 'that'.  I don't see
why this 'that' will not work as a key word syntactic trick for our N3 type

The Backus-Naur for this would be:
ReifiedStatement ::= 'that' '('  Subject Verb Object ')'
Please see [2] for the complete Bacus Naur definition of Semenglish.

Here  is an example of using 'that' for reification - expressed in
mentography at :
and in Semenglish as follows:

Seth thinks that (Gore wonThe Election) .
Seth thinks that ( that (Gore wonThe Election) is True).
that (Gore wonThe Election) is False.

... and to relieve the contradiction we can use context as below ...

     isContext {
     that (Gore wonThe Election) is False}.
(What Seth thinks) isContext {
     Seth thinks that (Gore wonThe Election).
     Seth thinks that (that (Gore wonThe Election is True))}.

Note that the phrase (What Seth thinks) above is not a reified statement
because it is not preceded by the key word 'that'.  In Semenglish things
enclosed in parenthesis can be either:

1 - Just compound names
2 - Reified statements, if the parenthesis is preceded with the key word
3 - KIF type prefix notation if the parenthesis is preceded with the key
word 'exp'

For some further examples of Semenglish expressions please see [3].


For a model of the common BacusNaur expressions used in [2] please see [4].


And now to toot my horn.  I believe that Semenglish is not only the most
complete and consistent of all the RDF serialization languages, but is also
the easiest to read and write.   Your contra examples, of course, are
anxiously solicited; or alternatively expressing the example [1] in N3 might
prove an interesting exercise.

Semenglish now boasts the following advantages:

1) It can be nested in XML.
2) It has a natural way to express reification.
3) It can express KIF style prefix notation allowing for the expression of
mathematical and logical statements without needing to assign URI to the
anonymously nested clauses.

Thanks in advance for you serious consideration of these matters and for
your tolerance of my pentimento [5] in designing the syntax of Semenglish.


.. help as always appreciated, but not expected.

Seth Russell

Received on Sunday, 22 July 2001 18:03:17 UTC