3 ms·
All general purpose ontologies look like very verbose and overly-complicated ways of describing things. OWL is no different, and the fact that it has taken on
by gchpaco 17y ago
All general purpose ontologies look like very verbose and overly-complicated ways of describing things. OWL is no different, and the fact that it has taken on the challenge of relating several different preexisting ontologies to each other complicates it further.
Now, that doesn't mean it's useful. The largest ontological framework I'm aware of is Cyc, which uses its own proprietary ontology and is at least as complex as OWL ever was or will be. Ultimately I think it's about as useful as reasoning about RDF ever is, which is to say not very at this time--but that's not really its fault.
- eob 17y agoYou're comparing Apples and Oranges a bit. OWL is formal framework that can be used to describe ontologies. Cyc is an attempt to create an ontology that describes the world. You are right that a lot of these "glob everything together" ontologies inevitably get too unwieldy to actually use. And wouldn't be so far off saying that OWL itself is a bit hard to grok. But it is important to see what the difference is. What is important about something like OWL, OWL-DL, or OWL Light is that they specify the types of axioms you are allowed to use. For example, the following statements are very different: - Humans have exactly two biological parents - Humans must have biological parents - Humans must have biological parent(s) - Humans can have parent(s) OWL, and its subsets, are attempts to carve out logical axioms that allow you to specify the nature of conceptual classes and their properties. You need a framework such as OWL to spell out what you are allowed to state about concepts like this because different types of logical relationships have algorithmic complexity implications. What you are allowed to state is incredibly important to people who want to perform logical inference, for example, because certain types of axioms will take a dataset on which inference would otherwise be O(P) time, and turn it to O(NP) time.