Abstract
We introduce optimization techniques for reasoning in DLN– a recently introduced family of nonmonotonic description logics whose characterizing features appear well-suited to model the examples naturally arising in biomedical domains and semantic web access control policies. Such optimizations are validated experimentally on large KBs with more than 30K axioms. Speedups exceed 1 order of magnitude. For the first time, response times compatible with real-time reasoning are obtained with nonmonotonic KBs of this size.
Cite
CITATION STYLE
Bonatti, P. A., Petrova, I. M., & Sauro, L. (2015). Optimizing the computation of overriding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9366, pp. 356–372). Springer Verlag. https://doi.org/10.1007/978-3-319-25007-6_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
