{"type":"ScholarlyArticle","title":"Computing Least Common Subsumers in Description Logics with Existential Restrictions","authors":[{"name":"Franz Baader","slug":"franz-baader","given":"Franz","family":"Baader","affiliation":""},{"name":"Ralf Küsters","slug":"ralf-kusters","given":"Ralf","family":"Küsters","affiliation":""},{"name":"Ralf Molitor","slug":"ralf-molitor","given":"Ralf","family":"Molitor","affiliation":""}],"abstract":"Computing the least common subsumer (lcs) is an inference task that can be used to support the \"botto m-up\" construction of knowledge bases for KR systems based on description logics. Previous work on how to compute the lcs has concentrated on description logics that allow for universal value restrictions , but not for existential restrictions. The main new contribution of this paper is the treatment of description logics with existential r estr ictions. Our approach for computing the lcs is based on an appropriate representation of concept descriptions by certain trees, and a characterization of subsumption by homomorphisms between these trees. Th e lcs operation then corresponds to the product operation on trees.","doi":null,"url":"https://ijcai.org/proceedings/1999/15","pdf":"https://ijcai.org/proceedings/1999/0015.pdf","markdown":"https://ijcai.org/proceedings/1999/15.md","bibtex":"https://ijcai.org/proceedings/1999/bibtex/15","volume":{"slug":"1999","title":"Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1999","url":"https://ijcai.org/proceedings/1999/","year":1999,"location":"Stockholm, Sweden","dates":"","editors":"Thomas Dean","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":15,"pages":{"first":96,"last":102},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}