Computing Least Common Subsumers in Description Logics with Existential Restrictions
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Approximating Most Specific Concepts in Description Logics with Existential Restrictions
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Computing simulations on finite and infinite graphs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Terminological cycles in a description logic with existential restrictions
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Non-standard inferences in description logics
Non-standard inferences in description logics
ICEC '04 Proceedings of the 6th international conference on Electronic commerce
Knowledge based approach to semantic composition of teams in an organization
Proceedings of the 2005 ACM symposium on Applied computing
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Terminological cycles in a description logic with existential restrictions
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Electronic Commerce Research and Applications
Matching in hybrid terminologies
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
A finite basis for the set of ƐL-implications holding in a finite model
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Enriching EL-Concepts with Greatest Fixpoints
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
A Unified Framework for Non-standard Reasoning Services in Description Logics
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Subsumption in w.r.t. hybrid TBoxes
KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
An approach to exploring description logic knowledge bases
ICFCA'10 Proceedings of the 8th international conference on Formal Concept Analysis
Semantic-Based automated composition of distributed learning objects for personalized e-learning
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Measuring similarity in description logics using refinement operators
ICCBR'11 Proceedings of the 19th international conference on Case-Based Reasoning Research and Development
A general Datalog-based framework for tractable query answering over ontologies
Web Semantics: Science, Services and Agents on the World Wide Web
On the complexity of ontological reasoning under disjunctive existential rules
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Towards more expressive ontology languages: The query answering problem
Artificial Intelligence
Journal of Artificial Intelligence Research
The impact of disjunction on query answering under guarded-based existential rules
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Most specific generalizations w.r.t. general EL-TBoxes
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
Computing least common subsumers (Ics) and most specific concepts (msc) are inference tasks that can support the bottom-up construction of knowledge bases in description logics. In description logics with existential restrictions, the most specific concept need not exist if one restricts the attention to concept descriptions or acyclic TBoxes. In this paper, we extend the notions les and msc to cyclic TBoxes. For the description logic EC (which allows for conjunctions, existential restrictions, and the top-concept), we show that the les and msc always exist and can be computed in polynomial time if we interpret cyclic definitions with greatest fixpoint semantics.