{"type":"ScholarlyArticle","title":"Terminological Cycles in a Description Logic with Existential Restrictions","authors":[{"name":"Franz Baader","slug":"franz-baader","given":"Franz","family":"Baader","affiliation":""}],"abstract":"Cyclic definitions in description logics have until now been investigated only for description logics allowing for value restrictions. Even for the most basic language F £ 0 , which allows for conjunction and value restrictions only, deciding subsumption in the presence of terminological cycles is a PSPACE-complete problem. This paper investigates subsumption in the presence of terminological cycles for the language £ C, which allows for conjunction, existential restrictions, and the topconcept. In contrast to the results for F Co, subsumption in £C remains polynomial, independent of whether we use least fixpoint semantics, greatest fix point semantics, or descriptive semantics.","doi":null,"url":"https://ijcai.org/proceedings/2003/48","pdf":"https://ijcai.org/proceedings/2003/0048.pdf","markdown":"https://ijcai.org/proceedings/2003/48.md","bibtex":"https://ijcai.org/proceedings/2003/bibtex/48","volume":{"slug":"2003","title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2003","url":"https://ijcai.org/proceedings/2003/","year":2003,"location":"Acapulco, Mexico","dates":"","editors":"Georg Gottlob","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":48,"pages":{"first":325,"last":329},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}