On the problem of computing small representations of least common subsumers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2479, Issue , 2002, Pages 99-113

  Baader, Franz ^a   Turhan, Anni Yasmin ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA DESCRIPTION; TERMINOLOGY;

CONCEPT DESCRIPTION; DESCRIPTION LOGIC; LEAST COMMON SUBSUMER (LCS);

ARTIFICIAL INTELLIGENCE;

EID: 84863597079     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45751-8_7     Document Type: Conference Paper

References (12)

1. F. Baader and R. Küsters. Computing the least common subsumer and the most specific concept in the presence ofcyclic ALN-concept descriptions. In O. Herzog and A. Günter, eds., Proc. of KI-98, volume 1504 of Lecture Notes in Computer Science, p. 129–140, Bremen, Germany, 1998. Springer-Verlag.
2. F. Baader, R. Küsters, and R. Molitor. Computing least common subsumer in description logics with existential restrictions. In T. Dean, ed., Proc. of the 16th Int. Joint Conf. on Artificial Intelligence (IJCAI-99), p. 96–101, Stockholm, Sweden, 1999. Morgan Kaufmann, Los Altos. An extended version appeared as LTCSReport LTCS-98-09, LuFG Theoretical Computer Science, RWTH Aachen, Germany, 1998. See http://www-lti.informatik.rwth-aachen.de/Forschung/Papers.html.
3. F. Baader, R. Küsters, and R. Molitor. Rewriting concepts using terminologies. In A.G. Cohn, F. Giunchiglia, and B. Selman, eds., Proc. of the 7th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR-00), p. 297–308, San Francisco, CA, 2000. Morgan Kaufmann Publishers.
4. F. Baader and R. Molitor. Building and structuring description logic knowledge bases using least common subsumers and concept analysis. In B. Ganter and G. Mineau, eds., Proc. of ICCS-00, volume 1867 of Lecture Notes in Artificial Intelligence, p. 290–303. Springer-Verlag, 2000.
5. F. Baader and U. Sattler. Knowledge representation in process engineering. In Proc. of DL-96, 1996.
6. F. Baader and A.-Y. Turhan. TBoxes do not yield a compact representation of the least common subsumer. In Proc. of DL-2001, 2001.
7. F. Baader, E. Franconi, B. Hollunder, B. Nebel, and H.-J. Profitlich. An empirical analysis ofoptimization techniques for terminological representation systems or: Making KRIS get a move on. Applied Artificial Intelligence. Special Issue on Knowledge Base Management, 4:109–132, 1994.
8. I. Horrocks. OptimisingT ableaux Decision Procedures for Description Logics. PhD thesis, University ofManc hester, 1997.
9. R. Küsters and R. Molitor. Approximating most specific concepts in description logics with existential restrictions. In T. Eiter F. Baader, G. Brewka, eds., Proc. of the 24th German Annual Conf. on Artificial Intelligence (KI’01), number 2174 in Lecture Notes In Artificial Intelligence, p. 33–47. Springer-Verlag, 2001.
10. B. Nebel. Terminological reasoning is inherently intractable. Artificial Intelligence Journal, 43:235–249, 1990.
11. U. Sattler. Terminological knowledge representation systems in a process engineeringapplic ation. PhD thesis, RWTH Aachen, 1998.
12. A.-Y. Turhan and R. Molitor. Usinglazy unfoldingfor the computation of least common subsumers. In Proc. of DL-2001, 2001.