- From: Bijan Parsia <bparsia@cs.man.ac.uk>
- Date: Tue, 17 Jun 2008 15:05:48 +0100
- To: OWL Working Group WG <public-owl-wg@w3.org>
Hi folks, Now that Easy Keys are in the "bake" stage (i.e., we've reach consenus (with appropraite reservations) and have spec text in specs), the next most mature proposal to fill a capability hole is n- ary data predicates. A reminder of use cases: http://www.w3.org/2007/OWL/wiki/N-ary_Data_predicate_use_case The current draft of a proposal (needs a tart up to match new specs): http://www.w3.org/2007/OWL/wiki/N-ary_Data_predicate_use_case For at least linear inequations, we have implementation, indeed, commercial experience in the form of Racer Pro. Finally, the only general objector to n-ary per se (HP) has withdrawn that objection. So I think we're no longer in need of reaching consensus on the basic facility, but on exactly what we'll spec and require. So, at this point, it seems to me that its a good time for people to review the situation and ask questions. If there are details you'd like to know more on, please let me know. Cheers, Bijan.
Received on Tuesday, 17 June 2008 14:03:36 UTC