Matthias (and others). Why not help out with the OWL macro task force
which was an offshoot of the last OWLED. The idea is to define a
macro language for OWL, i.e. a way of defining expansions from
compact expressions to more complicated OWL expressions.
http://code.google.com/p/owl1-1/wi
On Sep 13, 2007, at 6:25 PM, Chimezie Ogbuji wrote:
On Thu, 2007-09-13 at 16:44 +0100, Bijan Parsia wrote:
I trimmed the ccs since I get scared if I have to scroll a cc list.
Thanks, I have a bad habit of not doing that :)
Eh. Not really. First of all, "domain of discourse" has a couple of
Also, what would be great is to get a concrete real world example
which
illustrates the above. The example given by Kavitha, I believe has
a SQL
translation. Getting such examples are crucial to showing the value
of the web.
Vipul, just to clarify, which example are you referring to when
That's cute. Thanks for the pointer. They need to add some RDF style
elements :) SPARQL, Classify, Present hierarchy
-Alan
On Sep 13, 2007, at 11:59 AM, Kei Cheung wrote:
As part of my class teaching, here is a Yahoo Pipes example I
created and shared with the public:
http://pipes
On Thu, 2007-09-13 at 16:44 +0100, Bijan Parsia wrote:
> I trimmed the ccs since I get scared if I have to scroll a cc list.
Thanks, I have a bad habit of not doing that :)
> Eh. Not really. First of all, "domain of discourse" has a couple of
> specific technical meanings so we should be a bit
As part of my class teaching, here is a Yahoo Pipes example I created
and shared with the public:
http://pipes.yahoo.com/pipes/search?q=neurospora_assembly_pipe&x=0&y=0
It demonstrates how to use Yahoo Pipes to fetch a csv dataset, filter
it, replace patterns in the query results, and rename
I trimmed the ccs since I get scared if I have to scroll a cc list.
On 13 Sep 2007, at 15:21, Chimezie Ogbuji wrote:
On Wed, 2007-09-12 at 14:42 +0100, Xiaoshu Wang wrote:
Chimezie Ogbuji wrote:
[snip]
But please also see how dangerous such practice will be: "Ian
Horrocks1,
Bijan Parsia,
On Wed, 2007-09-12 at 14:42 +0100, Xiaoshu Wang wrote:
> Chimezie Ogbuji wrote:
> >
> > In SPARQL, the combined use of FILTER/!/BOUND effectively gives you a
> > mechanism for matching records with non-monotonic mechanisms without an
> > entailment regime. This is how we are able to *explicitly*
Since we are talking about user interface, another thing we might want
to consider is the possible intersection of web 2.0 and semantic web
(some people call it web 3.0 :-) ) in terms of semantic mashup of
scientific data and tools. Current web 2.0 technologies (e.g., flickr,
myspace, ...) p
> The data complexity of EL++ suggest strongly that a sensible
> reduction to SQL is unlikely (i.e., you'll need datalogesque rules as
> well).
[VK] The interesting question in my mind then is what is the additional
functionality achieved by these datalogesque rules that are not present in
SQL?
On Sep 12, 2007, at 4:30 PM, Kashyap, Vipul wrote:
[snip]
In terms of whether you can do this using SQL querying
alone, based on our experience, its unlikely. The problem is that
the types of clinical exclusion and inclusion criteria we saw on
clinicalTrials.gov cannot be easily reduced to SQL
11 matches
Mail list logo
