Computing the least common subsumer w.r.t. a background terminology

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3229, Issue , 2004, Pages 400-412

  Baader, Franz ^a   Sertkaya, Baris ^a   Turhan, Anni Yasmin ^a  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; DATA DESCRIPTION; FORMAL LOGIC; TERMINOLOGY; APPROXIMATION THEORY; COMPUTATIONAL METHODS; KNOWLEDGE ENGINEERING; MATHEMATICAL MODELS; SEMANTICS; SET THEORY;

CONCEPT DESCRIPTION; DESCRIPTION LOGIC; KNOWLEDGE BASIS; LEAST COMMON SUBSUMER (LCS); USE CONCEPT;

FORMAL CONCEPT ANALYSIS; FORMAL LOGIC;

CONCEPT DESCRIPTIONS; DESCRIPTION LOGICS; LEAST COMMON SUBSUMER (LCS); SUBLANGUAGES;

EID: 22944482835     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30227-8_34     Document Type: Conference Paper

References (26)

1. F. Baader. Computing a minimal representation of the subsumption lattice of all conjunctions of concepts defined in a terminology. In G. Ellis, R. A. Levinson, A. Fall, and V. Dahl, eds., Knowledge Retrieval, Use and Storage for Efficiency: Proc. of the 1st Int. KRUSE Symposium, 1995.
2. F. Baader. Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles. In G. Gottlob and T. Walsh, eds., Proc. of the 18th Int. Joint Conf. on AI., Morgan Kaufm., 2003.
3. F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P. F. Patel-Schneider, eds. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, 2003.
4. F. Baader and R. Küsters. Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions. In Proc. of the 22nd German Annual Conf. on AI. (KI'98), LNCS, Springer, 1998.
5. F. Baader, R. Küsters, and R. Molitor. Computing least common subsumers in description logics with existential restrictions. In Proc. of the 16th Int. Joint Conf. on AI. (IJCAI'99), 1999.
6. F. Baader, R. Küsters, and R. Molitor. Rewriting concepts using terminologies. In Proc. of the 7th Int. Conf. on Principles of Knowledge Repr. and Reasoning (KR'2000), 2000.
7. 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., Conceptual Structures: Logical, Linguistic, and Computational Issues - Proc. of the 8th Int. Conf. on Conceptual Structures (ICCS2000), Springer, 2000.
8. F. Baader and B. Sertkaya. Applying formal concept analysis to description logics. In P. Eklund, ed., Proc. of the 2nd Int. Conf. on Formal Concept Analysis (ICFCA 2004), LNCS, Sydney, Australia, 2004. Springer.
9. F. Baader, B. Sertkaya, and A.-Y. Turhan. Computing the least common subsumer w.r.t. a background terminology. In Proc. of the 2004 Int. Workshop on Description Logics (DL2004), 2004.
10. S. Brandt, R. Küsters, and A.-Y. Turhan. Approximation and difference in description logics. In D. Fensel, F. Giunchiglia, D. McGuiness, and M.-A. Williams, eds., Proc. of the 8th Int. Conf. on Principles of Knowledge Repr. and Reasoning (KR2002), San Francisco, CA, 2002. Morgan Kaufm.
11. S. Brandt, A.-Y. Turhan, and R. Küsters. Extensions of non-standard inferences for description logics with transitive roles. In M. Vardi and A. Voronkov, eds., Proc. of the 10th Int. Conf. on Logic for Programming and Automated Reasoning (LPAR'03), LNAI. Springer, 2003.
12. W. Cohen and H. Hirsh. Learning the CLASSIC description logics: Theoretical and experimental results. In J. Doyle, E. Sandewall, P. Torasso, eds., Proc. of the 4th Int. Conf. on Principles of Knowledge Repr. and Reasoning (KR'94), 1994.
13. M. Frazier and L. Pitt. CLASSIC learning. Machine Learning, 25:151-193, 1996.
14. B. Ganter. Finding all closed sets: A general approach. Order, 8:283-290, 1991.
15. B. Ganter. Attribute exploration with background knowledge. Theoretical Computer Science, 217(2):215-233, 1999.
16. B. Ganter and R. Krauße. Pseudo models and propositional Horn inference. Technical Report MATH-AL-15-1999, Inst. f. Algebra, TU Dresden, Germany, 1999.
17. B. Ganter and R. Wille. Formal Concept Analysis: Mathematical Foundations. Springer, Berlin, 1999.
18. V. Haarslev and R. Möller. High performance reasoning with very large knowledge bases: A practical case study. In Proc. of the 17th Int. Joint Conf. on AI. (IJCAI 2001), 2001.
19. V. Haarslev and R. Möller. RACER system description. In Proc. of the Int. Joint Conf. on Automated Reasoning (IJCAR 2001), 2001.
20. I. Horrocks. Using an expressive description logic: FaCT or fiction? In Proc. of the 6th Int. Conf. on Principles of Knowledge Repr. and Reasoning (KR'98), 1998.
21. R. Küsters. Non-standard Inferences in Description Logics, LNAI. Springer, 2001.
22. R. Küsters and A. Borgida. What's in an attribute? Consequences for the least common subsumer. J. of AI. Research, 14:167-203, 2001.
23. R. Küsters and R. Molitor. Approximating most specific concepts in description logics with existential restrictions. In F. Baader, G. Brewka, and T. Eiter, eds., Proc. of the Joint German/Austrian Conf. on AI. (KI 2001), LNAI, 2001. Springer.
24. R. Küsters and R. Molitor. Computing least common subsumers in ALEN. In Proc. of the 17th Int. Joint Conf. on AI. (IJCAI 2001), 2001.
25. A. Rector and I. Horrocks. Experience building a large, re-usable medical ontology using a description logic with transitivity and concept inclusions. In Proc. of the Workshop on Ontological Engineering, AAAI Spring Symposium (AAAI'97), Stanford, CA, 1997. AAAI Press.
26. S. Schultz and U. Hahn. Knowledge engineering by large-scale knowledge reuse-experience from the medical domain. In A. G. Cohn, F. Giunchiglia, and B. Selman, eds., Proc. of the 7th Int. Conf. on Principles of Knowledge Repr. and Reasoning (KR'2000), Morgan Kaufm., 2000.