Building and structuring description logic knowledge bases using least common subsumers and concept analysis

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

Volumn 1867, Issue , 2000, Pages 292-305

  Baader, Franz ^a   Molitor, Ralf ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; DATA DESCRIPTION; FORMAL LANGUAGES; FORMAL LOGIC; INFORMATION ANALYSIS; RECONFIGURABLE HARDWARE;

BOTTOM UP; CONCEPT ANALYSIS; CONCEPT LATTICES; DESCRIPTION LOGIC; FINITE SET; KNOWLEDGE BASIS;

FORMAL CONCEPT ANALYSIS;

EID: 84957062125     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722280_20     Document Type: Conference Paper

References (19)

1. F. Baader. Computing a Minimal Representation of the Subsumption Lattice of all Conjunctions of Concepts Defined in a Terminology. In Proceedings of KRUSE’95, 1995.
2. 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 Proceedings of KI’98, Springer LNCS 1504, 1998.
3. F. Baader, R. Küsters, and R. Molitor. Computing least common subsumers in description logics with existential restrictions. In Proceedings of IJCAI’99, Morgan Kaufmann, 1999.
4. A. Borgida and P. Patel-Schneider. A semantics and complete algorithm for subsumption in the Classic description logic. J.A rtificial Intelligence Research, 1, 1994.
5. W.W. Cohen and H. Hirsh. Learning the Classic description logic: Theoretical and experimental results. In Proceedings of KR’94, Morgan Kaufmann, 1994.
6. F.M. Donini, M. Lenzerini, D. Nardi, B. Hollunder, W. Nutt, and A.M. Spaccamela. The complexity of existential quantification in concept languages. Artificial Intelligence, 53, 1992.
7. W.F. Dowling and J.H. Gallier. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J.L ogic Programming, 3, 1984.
8. V. Duquenne. Contextual implications between attributes and some representational properties for finite lattices. In Beiträge zur Begriffsanalyse, B.I. Wissenschaftsverlag, 1987.
9. M. Frazier and L. Pitt. Classic learning. Machine Learning, 25, 1996.
10. B. Ganter. Finding all closed sets: A general approach. Order, 8, 1991.
11. B. Ganter and R. Wille. Formal Concept Analysis – Mathematical Foundations, Springer–Verlag, 1999.
12. I. Horrocks. The FaCT system. In Proceedings of Tableaux’98, Springer LNCS 1397, 1998.
13. W. Marquardt. Trends in computer-aided process modeling. Computers and Chemical Engineering, 20(6/7), 1996.
14. M. Nassiri. Berechnung einer erweiterten Subsumtionshierarchie. Diploma thesis, RWTH Aachen, Germany, 1997.
15. U. Sattler. Terminological Knowledge Representation Systems in a Process Engineering Application. PhD thesis, RWTH Aachen, 1998.
16. G. Stumme. Exploration Tools in Formal Concept Analysis. In Proceedings of OSDA’ 95. Vol. 8 of Studies in Classification, Data Analysis, and Knowledge Organization. Springer-Verlag, 1996.
17. G. Stumme. The concept classification of a terminology extended by conjunction and disjunction. In Proceedings of PRICAI’96, Springer LNCS 1114, 1996.
18. G. Stumme and R. Wille. Begriffliche Wissensverarbeitung — Methoden und Anwendungen. Springer–Verlag, 2000.
19. F. Vogt and R. Wille. TOSCANA - A graphical tool for analyzing and exploring data. In Graph Drawing, Springer LNCS 894, 1995.