Modeling in OWL 2 without Restrictions
Michael Schneider, Sebastian Rudolph, Geoff Sutcliffe

TL;DR
This paper explores removing global restrictions in OWL 2 DL to enable more expressive modeling, demonstrating that first-order logic theorem proving can effectively reason without these restrictions, unlike current reasoners.
Contribution
It introduces the concept of discarding global restrictions in OWL 2 DL and shows how first-order logic theorem proving can perform reasoning without them.
Findings
Current reasoners rely heavily on global restrictions
First-order logic theorem proving successfully reasons without restrictions
Removing restrictions enables more expressive modeling patterns
Abstract
The Semantic Web ontology language OWL 2 DL comes with a variety of language features that enable sophisticated and practically useful modeling. However, the use of these features has been severely restricted in order to retain decidability of the language. For example, OWL 2 DL does not allow a property to be both transitive and asymmetric, which would be desirable, e.g., for representing an ancestor relation. In this paper, we argue that the so-called global restrictions of OWL 2 DL preclude many useful forms of modeling, by providing a catalog of basic modeling patterns that would be available in OWL 2 DL if the global restrictions were discarded. We then report on the results of evaluating several state-of-the-art OWL 2 DL reasoners on problems that use combinations of features in a way that the global restrictions are violated. The systems turn out to rely heavily on the global…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSemantic Web and Ontologies · Service-Oriented Architecture and Web Services · Business Process Modeling and Analysis
