Over a year ago I asked a question about Composite Inverse Functional Properties and got some excellent responses. The definition has been up on the ESW wiki [1] for a while. But we have not yet seen any reasoners incorporate this into their engines. Of course CIFPs are not declared in any standard document, but they are very useful, as I have found in my programming experience. CIFPs do have a very clear and precise definition [2], so it should not be a problem to at least analyze their logical properties. Is this really a concept that is so much more complicated than other OWL relations? What is the complexity of this really? What restrictions should be imposed to make CIFPs fall into the OWL-DL category? Would any logicians care to comment? This could be very helpful to persuade inference engine creators to implement something of that nature. sincerely, Henry Story [1] http://esw.w3.org/topic/CIFP [2] http://eulersharp.sourceforge.net/2004/04test/rogier# Home page: http://bblfish.net/ Sun Blog: http://blogs.sun.com/bblfish/Received on Monday, 5 June 2006 16:26:53 GMT
This archive was generated by hypermail 2.2.0+W3C-0.50 : Tuesday, 8 January 2008 14:22:42 GMT