Tractable reasoning via approximation
Artificial Intelligence
P-SHOQ(D): A Probabilistic Extension of SHOQ(D) for Probabilistic Ontologies in the Semantic Web
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
A system for principled matchmaking in an electronic marketplace
WWW '03 Proceedings of the 12th international conference on World Wide Web
Information Sharing on the Semantic Web
Information Sharing on the Semantic Web
A Software Framework for Matchmaking Based on Semantic Web Technology
International Journal of Electronic Commerce
Towards a fuzzy description logic for the semantic web (preliminary report)
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Approximating description logic classification for semantic web reasoning
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
The OWL instance store: system description
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
What Is Approximate Reasoning?
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Approximate OWL-Reasoning with Screech
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Building a Knowledge Base System for an Integration of Logic Programming and Classical Logic
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A Workbench for Anytime Reasoning by Ontology ApproximationWith a case study on instance retrieval
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
| Hi-index | 0.00 |
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of information integration and service discovery. A drawback of the direct use of subsumption as a matching criterion is the inability to compute partial matches and qualify the degree of mismatch. In this paper, we describe a method for overcoming these problems that is based on approximate logical reasoning. In particular, we approximate the subsumption relation by defining the notion of subsumption with respect to a certain subset of the concept and relation names. We present the formal semantics of this relation, describe a sound and complete algorithm for computing approximate subsumption and discuss its application to matching tasks.