Tractable reasoning via approximation
Artificial Intelligence
Partial matchmaking using approximate subsumption
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Solving time-dependent planning problems
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Scalable instance retrieval for the semantic web by approximation
WISE'05 Proceedings of the 2005 international conference on Web Information Systems Engineering
Approximating description logic classification for semantic web reasoning
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
| Hi-index | 0.00 |
Reasoning is computationally expensive. This is especially true for reasoning on the Web, where data sets are very large and often described by complex terminologies. One way to reduce this complexity is through the use of approximate reasoning methods which trade one computational property (eg. quality of answers) for others, such as time and memory. Previous research into approximation on the Semantic Web has been rather ad-hoc, and we propose a framework for systematically studying such methods. We developed a workbench which allows the structured combination of different algorithms for approximation, reasoning and measuring in one single framework. As a case-study we investigate an incremental method for instance retrieval through ontology approximation, and we use our workbench to study the computational behaviour of several approximation strategies.