Computing Least Common Subsumers in ALEN

IJCAI 2001 pp. 219-224

doi:10.25368/2022.110 /ijcai/2001/kusters2001ijcai-computing/

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.

Semantic Scholar

Cite

Text

Küsters and Molitor. "Computing Least Common Subsumers in ALEN." International Joint Conference on Artificial Intelligence, 2001. doi:10.25368/2022.110

Markdown

[Küsters and Molitor. "Computing Least Common Subsumers in ALEN." International Joint Conference on Artificial Intelligence, 2001.](https://mlanthology.org/ijcai/2001/kusters2001ijcai-computing/) doi:10.25368/2022.110

BibTeX

@inproceedings{kusters2001ijcai-computing,
  title     = {{Computing Least Common Subsumers in ALEN}},
  author    = {Küsters, Ralf and Molitor, Ralf},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2001},
  pages     = {219-224},
  doi       = {10.25368/2022.110},
  url       = {https://mlanthology.org/ijcai/2001/kusters2001ijcai-computing/}
}