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
Reasoning in expressive description logics with fixpoints based on automata on infinite trees
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
On the undecidability of logics with converse, nominals, recursion and counting
Artificial Intelligence
On the decidability of containment of recursive datalog queries - preliminary report
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
WWW '05 Proceedings of the 14th international conference on World Wide Web
Semantic Matchmaking of Web Resources with Local Closed-World Reasoning
International Journal of Electronic Commerce
On the undecidability of description and dynamic logics with recursion and counting
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
| Hi-index | 0.00 |
Semantic service description and matchmaking are needed in embedded and disappearing computing, cooperative multiagent systems, and the semantic web. Standard program semantics formalizations are not suited to modeling service semantics, because they are generic w.r.t. the data manipulated by programs, and because computation details are often irrelevant to the aforementioned applications of service descriptions. An ontology-based approach seems more appropriate. However, current ontology specification languages do not have primitives for service description. In this paper, we identify some useful service description constructs and study their impact on the decidability of reasoning with description logics.