Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 319-324

  Baader, Franz ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONCEPT DESCRIPTION; CYCLIC DEFINITIONS; DESCRIPTION LOGIC; FIX-POINT SEMANTICS; KNOWLEDGE BASIS; POLYNOMIAL-TIME;

ARTIFICIAL INTELLIGENCE; FORMAL LANGUAGES; FORMAL LOGIC; POLYNOMIAL APPROXIMATION; SEMANTICS;

DATA DESCRIPTION;

EID: 84880804628     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. F. Baader. Least common subsumers, most specific concepts, and role-value-maps in a description logic with existential restrictions and terminological cycles. LTCS-Report 02-07, TU Dresden, 2002. See http://lat.inf.tu-dresden.de/research/reports.html.
2. F. Baader. Computing the least common subsumer in the description logic £L w.r.t. terminological cycles with descriptive semantics. In Proc. ICCS'03, Springer LNAI, 2003.
3. F. Baader. Terminological cycles in a description logic with existential restrictions. In Proc. IJCAl'03,2003.
4. Franz Baader. The instance problem and the most specific concept in the description logic £C w.r.t. terminological cycles with descriptive semantics. LTCS-Report 03-01, TU Dresden, 2003. See http://lat.inf.tudresden. de/research/reports.html.
5. F. Baader and R. Kiisters. Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions. In Proc. KI'98, Springer LNAI 1504, 1998.
6. F. Baader, R. Kusters, and R. Molitor. Computing least common subsumers in description logics with existential restrictions. In Proc. IJCAI'99, 1999.
7. R. Cote, D. Rothwell, J. Palotay, R. Beckett, and L. Brochu. The systematized nomenclature of human and veterinary medicine. Technical report, SNOMED International, Northfield, IL: College of American Pathologists, 1993.
8. M. R. Henzinger, T. A. Henzinger, and P. W. Kopke. Computing simulations on finite and infinite graphs. In 36th Annual Symposium on Foundations of Computer Science, 1995. IEEE Computer Society Press.
9. R. Kusters. Non-standard Inferences in Description Logics, Springer LNAI 2100, 2001.
10. R. Kusters and R. Molitor. Approximating most specific concepts in description logics with existential restrictions. In Proc. KI 2001, Springer LNAI 2174,2001.
11. B. Nebel. Terminological cycles: Semantics and computational properties. In J. F. Sowa, editor, Principles of Semantic Networks. Morgan Kaufmann, 1991.
12. K. Spackman. Managing clinical terminology hierarchies using algorithmic calculation of subsumption: Experience with SNOMED-RT. J. of the American Medical Informatics Association, 2000. Fall Symposium Special Issue.
13. K. Spackman. Normal forms for description logic expressions of clinical concepts in SNOMED RT. J. of the American Medical Informatics Association, 2001. Symposium Supplement.
14. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics, 5, 1955.