Re: Strategies for inference over lists of values

Graham,

> There are two examples in my previous message at:
>    http://lists.w3.org/Archives/Public/www-rdf-logic/2004Feb/0045.html

According to RDF MT, we are not able to deduce

> _:weatherToday
> :maxTemperature "17"^^xsd:integer .

from

> _:weatherToday
>      :hourlyTemperatures
>        ( "10"^^xsd:integer "12"^^xsd:integer "15"^^xsd:integer
>          "16"^^xsd:integer "14"^^xsd:integer "17"^^xsd:integer
>          "13"^^xsd:integer "12"^^xsd:integer "10"^^xsd:integer
>          "9"^^xsd:integer  "7"^^xsd:integer  "6"^^xsd:integer ) .

because, in the above example, no constraints between the properties
:hourlyTemperatures and :maxTemperature have been specified.

Jeff
--
Jeff Z. Pan  ( http://DL-Web.man.ac.uk/ )
Computer Science Dept., The University of Manchester



> for which Jos has provided quite straightforward Euler solutions in:
>    http://lists.w3.org/Archives/Public/www-rdf-logic/2004Feb/0046.html
> using a conventional rule form with special properties, ala CWM.
>
> These examples don't, of themselves, show why it's hard to use the
> generalised restriction.  But they are examples for which I haven't figured
> out an easy way to use it.
>
> #g
> --
>
> > >My own experiments suggest that I must combine the
> > > restriction with a more conventional (antecedent=>consequent) form
> >of rule.
> > >
> > > The (half-baked) idea I was considering as a way to deal with
> >inference
> > > over a collection was to introduce a primitive along the lines of a
> >'fold',
> > > as found in functional programming languages (which has been shown
> >to have
> > > some degree of universality for expressing recursive/repetitive
> >functions
> > > [3]), and combine that with non-iterative/non-recursive inference
> >patterns.
> > >
> > > #g
> > > --
> > >
> > > [1]
> > >
>
>http://www.ninebynine.org/RDFNotes/RDF-Datatype-inference.html#sec-choice-constraint
-classes
> > >
> > > [2] Horrocks, I. and J. Pan, "Web Ontology Reasoning with Datatype
> >Groups",
> > > 2003.
> > >
> >http://www.cs.man.ac.uk/~horrocks/Publications/download/2003/PaHo03a.pdf
> > >
> > > [3] J. Functional Programming 1 (1): 1-000, January 1993
> > > c fl 1993 Cambridge University Press 1
> > > A tutorial on the universality and expressiveness of fold
> > > Graham Hutton University of Nottingham
> > > (also at http://www.cs.nott.ac.uk/~gmh/fold.pdf)
> > >
> > > [4] http://www.agfa.com/w3c/euler/
> > >
> > >
> > >
> > > ------------
> > > Graham Klyne
> > > For email:
> > > http://www.ninebynine.org/#Contact
> > >
> > >
>
> ------------
> Graham Klyne
> For email:
> http://www.ninebynine.org/#Contact
>
>

Received on Friday, 26 March 2004 11:52:08 UTC