Hierarchical knowledge bases and efficient disjunctive reasoning
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Subsumption in KL-ONE is undecidable
Proceedings of the first international conference on Principles of knowledge representation and reasoning
On the relationship between description logic and predicate logic queries
CIKM '94 Proceedings of the third international conference on Information and knowledge management
The Learnability of Description Logics with Equality Constraints
Machine Learning - Special issue on computational learning theory, COLT'92
Part-whole relations in object-centered systems: an overview
Data & Knowledge Engineering - Special issue on modeling parts and wholes
Machine Learning - Special issue on COLT '94
The use of description logics in KBSE systems
ACM Transactions on Software Engineering and Methodology (TOSEM)
What can knowledge representation do for semi-structured data?
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Usability issues in knowledge representation systems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Adding more “DL” to IDL: towards more knowledgeable component inter-operability
Proceedings of the 21st international conference on Software engineering
“Reducing” CLASSIC to practice: knowledge representation theory meets reality
Artificial Intelligence - Special issue on applications of artificial intelligence
Description Logics in Data Management
IEEE Transactions on Knowledge and Data Engineering
An Industrial Strength Description Logics-Based Configurator Platform
IEEE Intelligent Systems
Computing Least Common Subsumers in Description Logics with Existential Restrictions
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Reasoning in Expressive Description Logics with Fixpoints based on Automata on Infinite Trees
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Tableau Algorithms for Description Logics
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
KI '98 Proceedings of the 22nd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Approximating most specific concepts in description logics with existential restrictions
AI Communications - Special issue on KI-2001
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
Intersection of finitely generated congruences over term algebra
Theoretical Computer Science
The description logic handbook
Web Semantics: Science, Services and Agents on the World Wide Web
Hi-index | 0.00 |
Functional relationships between objects, called "attributes", are of considerable importance in knowledge representation languages, including Description Logics (DLs). A study of the literature indicates that papers have made, often implicitly, different assumptions about the nature of attributes: whether they are always required to have a value, or whether they can be partial functions. The work presented here is the first explicit study of this difference for subclasses of the CLASSIC DL, involving the same-as concept constructor. It is shown that although determining subsumption between concept descriptions has the same complexity (though requiring different algorithms), the story is different in the case of determining the least common subsumer (lcs). For attributes interpreted as partial functions, the lcs exists and can be computed relatively easily; even in this case our results correct and extend three previous papers about the lcs of DLs. In the case where attributes must have a value, the lcs may not exist, and even if it exists it may be of exponential size. Interestingly, it is possible to decide in polynomial time if the lcs exists.