# Efficient Concept Induction for Description Logics

## TL;DR

This paper introduces an efficient algorithm for concept induction in Description Logics that significantly reduces reasoning time while maintaining high accuracy, making it suitable for large or complex ontology tasks.

## Contribution

The paper presents a novel algorithm that decreases the number of reasoner invocations, improving execution speed in concept induction tasks.

## Key findings

- Execution times improved by up to several orders of magnitude.
- High correctness in instance coverage is maintained in many cases.
- Algorithm is effective in scenarios where existing methods are slow.

## Abstract

Concept Induction refers to the problem of creating complex Description Logic class descriptions (i.e., TBox axioms) from instance examples (i.e., ABox data). In this paper we look particularly at the case where both a set of positive and a set of negative instances are given, and complex class expressions are sought under which the positive but not the negative examples fall. Concept induction has found applications in ontology engineering, but existing algorithms have fundamental performance issues in some scenarios, mainly because a high number of invokations of an external Description Logic reasoner is usually required. In this paper we present a new algorithm for this problem which drastically reduces the number of reasoner invokations needed. While this comes at the expense of a more limited traversal of the search space, we show that our approach improves execution times by up to several orders of magnitude, while output correctness, measured in the amount of correct coverage of the input instances, remains reasonably high in many cases. Our approach thus should provide a strong alternative to existing systems, in particular in settings where other systems are prohibitively slow.