Practical Reasoning for Expressive Description Logics
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
The Description Logic ALCNHR+ Extended with Concrete Domains: A Practically Motivated Approach
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
NExpTime complete Description Logics with Concrete Domains
NExpTime complete Description Logics with Concrete Domains
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
A Flexible Ontology Reasoning Architecture for the Semantic Web
IEEE Transactions on Knowledge and Data Engineering
Semantically processing parallel colour descriptions
Journal on data semantics X
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Applications of description logics: state of the art and research challenges
ICCS'05 Proceedings of the 13th international conference on Conceptual Structures: common Semantics for Sharing Knowledge
Ontology–Based representation and query colour descriptions from botanical documents
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, COA, and ODBASE - Volume Part II
| Hi-index | 0.01 |
The Semantic Web is a vision of the next generation Web, in which semantic markup will make Web resources more accessible to automatic processes. Description Logics (DLs) are of crucial importance to the development of the Semantic Web, where their role is to provide formal underpinnings and automated reasoning services for Semantic Web ontology languages such as DAML+OIL. In this paper, we show how the description logic SHOQ(D), which has been designed to provide such services, can be extended with n-ary datatype predicates and qualified number restrictions with n-ary datatype predicates, to give SHOQ(Dn), and we present an algorithm for deciding the satisfiability of SHOQ(Dn) concepts, along with a proof of its soundness and completeness. The work is motivated by the requirement for n-ary datatype predicates and qualified number restrictions with n-ary predicates in relation to "real world" properties in semantic Web ontologies and applications.