Computing Least Common Subsumers in ALEN
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence. Pages 219-223.
Abstract
Computing the least common subsumer (lcs) has proved to be useful in a variety of different applications. Previous work on the lcs has concentrated on description logics that either allow for number restrictions or for existential restrictions. Many applications, however, require to combine these constructors. In this work, we present an lcs algorithm for the description logic ALEN , which allows for both constructors, thereby correcting previous algorithms proposed in the literature.
Ralf Küsters, and Ralf Molitor. 2001. Computing Least Common Subsumers in ALEN. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01. IJCAI, 219–223. https://ijcai.org/proceedings/2001/31
Küsters, R., & Molitor, R. (2001). Computing Least Common Subsumers in ALEN. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01 (pp. 219–223). IJCAI. https://ijcai.org/proceedings/2001/31
@inproceedings{ijcai2001p31,
title = {Computing Least Common Subsumers in ALEN},
author = {Küsters, Ralf and Molitor, Ralf},
booktitle = {Proceedings of the Seventeenth International Joint Conference on
Artificial Intelligence, {IJCAI-01}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {219--223},
year = {2001},
url = {https://ijcai.org/proceedings/2001/31},
}
TY - CPAPER TI - Computing Least Common Subsumers in ALEN AU - Küsters, Ralf AU - Molitor, Ralf T2 - Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI-01 PB - International Joint Conferences on Artificial Intelligence PY - 2001 SP - 219 EP - 223 UR - https://ijcai.org/proceedings/2001/31 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
