We introduce optimization techniques for reasoning in DL^N – 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.
Optimizing the Computation of Overriding / Bonatti, PIERO ANDREA; Petrova, ILIANA MINEVA; Sauro, Luigi. - 9366:(2015), pp. 356-372. (Intervento presentato al convegno International Semantic Web Conference) [10.1007/978-3-319-25007-6_21].
Optimizing the Computation of Overriding
BONATTI, PIERO ANDREA;PETROVA, ILIANA MINEVA;SAURO, LUIGI
2015
Abstract
We introduce optimization techniques for reasoning in DL^N – 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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
