Using lazy unfolding for the computation of least common subsumers
From International Center for Computational Logic
Using lazy unfolding for the computation of least common subsumers
Anni-Yasmin TurhanAnni-Yasmin Turhan, R. MolitorR. Molitor
Anni-Yasmin Turhan, R. Molitor
Using lazy unfolding for the computation of least common subsumers
Proceedings of the International Workshop in Description Logics 2001 (DL2001), August 2001
Using lazy unfolding for the computation of least common subsumers
Proceedings of the International Workshop in Description Logics 2001 (DL2001), August 2001
- KurzfassungAbstract
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descriptions. To reduce the size of the output descriptions and the run-time of the lcs algorithm we present an optimized algorithm for computing the lcs in ALE using lazy unfolding. A first evaluation of the performance of the naive algorithm in comparison to the performance of the algorithm using lazy unfolding indicates a performance gain for both concept sizes as well as run-times. - Forschungsgruppe:Research Group: AutomatentheorieAutomata Theory
@inproceedings{ TurhanMolitor-DL-2001,
address = {Stanford, USA},
author = {A.-Y.\ {Turhan} and R.\ {Molitor}},
booktitle = {Proceedings of the International Workshop in Description Logics 2001 {(DL2001)}},
month = {August},
title = {Using lazy unfolding for the computation of least common subsumers},
year = {2001},
}
