Introduction to Automata Theory, Languages and Computability
Introduction to Automata Theory, Languages and Computability
The Description Logic ALCNHR+ Extended with Concrete Domains: A Practically Motivated Approach
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
The Description Logic Handbook
The Description Logic Handbook
Lower bounds for natural proof systems
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Keys, nominals, and concrete domains
Journal of Artificial Intelligence Research
A scheme for integrating concrete domains into concept languages
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Ontology reasoning in the SHOQ(D) description logic
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
OWL-Eu: Adding customised datatypes into OWL
Web Semantics: Science, Services and Agents on the World Wide Web
Ontology-driven possibilistic reference fusion
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems: Part II
Optimising ontology classification
ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
A novel approach to ontology classification
Web Semantics: Science, Services and Agents on the World Wide Web
Using SOIQ(D) to formalize semantics within a semantic decision table
RuleML'12 Proceedings of the 6th international conference on Rules on the Web: research and applications
| Hi-index | 0.00 |
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.