On the probabilistic performance of algorithms for the satisfiability problem
Information Processing Letters
Tractable reasoning via approximation
Artificial Intelligence
Generating hard satisfiability problems
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
Evaluating Optimized Decision Procedures for Propositional Modal K(m) Satisfiability
Journal of Automated Reasoning
Web Semantics: Science, Services and Agents on the World Wide Web
What Is Approximate Reasoning?
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Modular reuse of ontologies: theory and practice
Journal of Artificial Intelligence Research
LUBM: A benchmark for OWL knowledge base systems
Web Semantics: Science, Services and Agents on the World Wide Web
Ontology performance profiling and model examination: first steps
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Towards a complete OWL ontology benchmark
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
Framework for an automated comparison of description logic reasoners
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
The justificatory structure of the NCBO bioportal ontologies
ISWC'11 Proceedings of the 10th international conference on The semantic web - Volume Part I
Performance heterogeneity and approximate reasoning in description logic ontologies
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
An Empirical Analysis of Semantic Techniques Applied to a Network Management Classification Problem
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Hi-index | 0.00 |
Analysing the performance of OWL reasoners on expressive OWL ontologies is an ongoing challenge. In this paper, we present a new approach to performance analysis based on justifications for entailments of OWL ontologies. Justifications are minimal subsets of an ontology that are sufficient for an entailment to hold, and are commonly used to debug OWL ontologies. In JustBench, justifications form the key unit of test, which means that individual justifications are tested for correctness and reasoner performance instead of entire ontologies or random subsets. Justifications are generally small and relatively easy to analyse, which makes them very suitable for transparent analytic micro-benchmarks. Furthermore, the JustBench approach also allows us to isolate reasoner errors and inconsistent behaviour. We present the results of initial experiments using JustBench with FaCT++, HermiT, and Pellet. Finally, we show how JustBench can be used by reasoner developers and ontology engineers seeking to understand and improve the performance characteristics of reasoners and ontologies.