Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
A system for principled matchmaking in an electronic marketplace
WWW '03 Proceedings of the 12th international conference on World Wide Web
Two-variable logic with counting is decidable
LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
A Semantic Matchmaking Method of Web Services Based on SHOIN^+ (D)*
APSCC '06 Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing
Integrating description logics and action formalisms: first results
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Using tableau to decide expressive description logics with role negation
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
| Hi-index | 0.00 |
We present a logic-based framework that is able to model semantic e-services and to verify some of properties supporting the design and maintenance of cooperative information systems. This framework is based upon a formal foundation of the Semantic Web , as the Description Logic family, that provides an expressive specification language, allowing for complex application domains. We adopt the well-known IOPE (Input, Output, Preconditions, and Effects) paradigm for the description of e-service contracts, providing a suitable operational semantics and we are able to reason about update effects also in case of under-specified e-services, using a repair-based approach. On this base, we firstly define some basic consistency and correctness properties, and then we characterize the adequacy of an e-service to achieve a user goal as foundational task in service discovery. We present decidable checking procedures for the devised properties using a reduction technique to First-Order Logic reasoning tasks, including an analysis in terms of computational complexity.