Manthey, NorbertPeñaloza, RafaelRudolph, Sebastian2021-04-232021-04-2320202020http://dx.doi.org/10.1007/s13218-020-00669-4https://dl.gi.de/handle/20.500.12116/36305One approach to axiom pinpointing (AP) in description logics is its reduction to the enumeration of minimal unsatisfiable subformulas, allowing for the deployment of highly optimized methods from SAT solving. Exploiting the properties of AP, we further optimize incremental SAT solving, resulting in speedups of several orders of magnitude: through persistent incremental solving the solver state is updated lazily when adding clauses or assumptions. This adaptation consistently improves the runtime of the tool by an average factor of 3.8, and a maximum of 38. SATPin , our system, was tested over large biomedical ontologies and performed competitively.Description logicsPinpointingSATText/Journal Article10.1007/s13218-020-00669-41610-1987