Advertisement

OWL Datatypes: Design and Implementation

  • Boris Motik
  • Ian Horrocks
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5318)

Abstract

We analyze the datatype system of OWL and OWL 2, and discuss certain nontrivial consequences of its definition, such as the extensibility of the set of supported datatypes and complexity of reasoning. We also argue that certain datatypes from the list of normative datatypes in the current OWL 2 Working Draft are inappropriate and should be replaced with different ones. Finally, we present an algorithm for datatype reasoning. Our algorithm is modular in the sense that it can handle any datatype that supports certain basic operations. We show how to implement these operations for number and string datatypes.

Keywords

Regular Expression Description Logic Data Range Regular Language Reasoning Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications, 2nd edn. Cambridge University Press, Cambridge (2007)zbMATHGoogle Scholar
  2. 2.
    Baader, F., Hanschke, P.: A Scheme for Integrating Concrete Domains into Concept Languages. In: Proc. IJCAI 1991, Sydney, Australia, pp. 452–457 (1991)Google Scholar
  3. 3.
    Biron, P.V., Malhotra, A.: XML Schema Part 2: Datatypes, 2nd edn. (October 28, 2004), http://www.w3.org/TR/xmlschema-2/
  4. 4.
    Haarslev, V., Möller, R.: RACER System Description. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 701–706. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Haarslev, V., Möller, R., Wessel, M.: The Description Logic ALCNH R +  Extended with Concrete Domains: A Practically Motivated Approach. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, pp. 29–44. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison-Wesley, Reading (2000)zbMATHGoogle Scholar
  7. 7.
    Horrocks, I., Sattler, U.: Ontology Reasoning in the \(\mathcal{SHOQ}(\mathbf{D})\) Description Logic. In: Proc. IJCAI 2001, Seattle, WA, USA, pp. 199–204 (2001)Google Scholar
  8. 8.
    Kozen, D.: Lower Bounds for Natural Proof Systems. In: FOCS 1977, pp. 254–266. Providence, RI, USA (1977)Google Scholar
  9. 9.
    Lutz, C.: The Complexity of Reasoning with Concrete Domains. PhD thesis, Teaching and Research Area for Theoretical Computer Science, RWTH Aachen, Germany (2002)Google Scholar
  10. 10.
    Lutz, C., Areces, C., Horrocks, I., Sattler, U.: Keys, Nominals, and Concrete Domains. Journal of Artificial Intelligence Research 23, 667–726 (2005)MathSciNetzbMATHGoogle Scholar
  11. 11.
    Pan, J.Z., Horrocks, I.: Web Ontology Reasoning with Datatype Groups. In: Fensel, D., Sycara, K.P., Mylopoulos, J. (eds.) ISWC 2003. LNCS, vol. 2870, pp. 47–63. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  12. 12.
    Pan, J.Z., Horrocks, I.: OWL-Eu: Adding customised datatypes into OWL. Journal of Web Semantics 4(1), 29–39 (2006)CrossRefGoogle Scholar
  13. 13.
    Patel-Schneider, P.F., Hayes, P., Horrocks, I.: OWL Web Ontology Language: Semantics and Abstract Syntax, W3C Recommendation, (February 10, 2004), http://www.w3.org/TR/owl-semantics/
  14. 14.
    Rossi, F., van Beek, P., Walsh, T.: Handbook of Constraint Programming. Elsevier Science Inc., New York (2006)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Boris Motik
    • 1
  • Ian Horrocks
    • 1
  1. 1.University of OxfordUK

Personalised recommendations