Relational exploration: combining description logics and formal concept analysis for knowledge specification

4 Danksagungen Contents Introduction 7 1 FCA and Attribute Exploration 11 1. Introduction In the Palace of the Vatican, on a wall of a room called stanza della segnatura, the visitor encounters the fresco The School of Athens created by the famous renaissance painter Raphael around 1509. It shows renowned representatives of the ancient artes liberales led by philosophy. Right in the center of this masterpiece, one finds the certainly most brilliant greek philosophers (besides Socrates): Plato and Aristotle. While Plato points up indicating his belief in the primacy of ideas situated in a higher world of forms, Aristotle holds his hand palm downwards suggesting a more grounded epistemic view, where real world facts (or in modern terms: the data) govern the way how concepts and classifications are formed. These two perspectives can be traced through the entire occidental philosophy occurring here and there in varying guises (cf. also the problem of universals or the bipolar setting rationalism vs. empirism brought up in the 19th century). These antagonistic approaches personified by the two philosophers seem also characteristic for the underlying ways of thinking in two fields of knowledge processing and representation, we want to deal with in our work: Formal Concept Analysis (FCA) and Description Logic (DL). The – more Aristotelian – mathematical theory of Formal Concept Analysis came into being some twenty years ago as the attempt to model (hierarchies of) concepts in terms of lattice theory. It is based on the dualistic understanding of concepts as consisting of concept extent (i.e., all entities belonging to that concept) and concept intent (i.e., all attributes characterizing it). FCA has proven solid in theory but also quite intuitive in representing conceptual knowledge, also for mathematically less skilled people. Thus, it has been successfully applied in various areas beyond mathematics. Besides this representational capabilities, algorithms assisting knowledge acquisition have been developed, implemented and used in practice. In recent years, FCA has been developed further and extended by the project 8 Introduction of contextual logic, widening the scope of interest from concepts to judgments. In the course of these developments, the relational aspect has been increasingly emphasized. Description Logics being a collective term for a family of knowledge representation formalisms are the result of a development starting in the 1970s with frame based systems and semantic networks. The common underlying idea is to characterize classes of entities (resp. objects) of a domain and …

[1]  M. Fitting Proof Methods for Modal and Intuitionistic Logics , 1983 .

[2]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[3]  Thomas R. Gruber,et al.  A translation approach to portable ontology specifications , 1993, Knowl. Acquis..

[4]  Ian Horrocks,et al.  Practical Reasoning for Expressive Description Logics , 1999, LPAR.

[5]  John F. Sowa,et al.  Conceptual Structures: Fulfilling Peirce's Dream , 1997, Lecture Notes in Computer Science.

[6]  Bernhard Ganter,et al.  Attribute Exploration with Background Knowledge , 1999, Theor. Comput. Sci..

[7]  Sebastian Rudolph,et al.  Formal Concept Analysis Methods for Dynamic Conceptual Graphs , 2001, ICCS.

[8]  Franz Baader,et al.  Applying Formal Concept Analysis to Description Logics , 2004, ICFCA.

[9]  Volker Haarslev,et al.  RACER System Description , 2001, IJCAR.

[10]  Peter Øhrstrøm,et al.  Conceptual Structures for Knowledge Creation and Communication. , 2003 .

[11]  Klaus Schild,et al.  A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.

[12]  Gerd Stumme,et al.  Creation and Merging of Ontology Top-Levels , 2003, ICCS.

[13]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[14]  Vincent Duquenne,et al.  Familles minimales d'implications informatives résultant d'un tableau de données binaires , 1986 .

[15]  Sebastian Rudolph,et al.  Exploring Relational Structures Via FLE , 2004, ICCS.

[16]  Ian Horrocks,et al.  Reasoning with Individuals for the Description Logic SHIQ , 2000, CADE.

[17]  Jean H. Gallier,et al.  Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..

[18]  F. Baader Computing a Minimal Representation of the Subsumption Lattice of All Conjunctions of Concepts De ned in a Terminology ? , 1995 .

[19]  Sebastian Rudolph An FCA Method for the Extensional Exploration of Relational Data , 2003 .

[20]  Richard Holzer Methoden der formalen Begriffsanalyse bei der Behandlung unvollständigen Wissens , 2001 .

[21]  W. W. Armstrong,et al.  Dependency Structures of Data Base Relationships , 1974, IFIP Congress.

[22]  Deborah L. McGuinness,et al.  OWL Web ontology language overview , 2004 .

[23]  Olivier Ridoux,et al.  Arbitrary Relations in Formal Concept Analysis and Logical Information Systems , 2005, ICCS.

[24]  L. E. Bourne,et al.  Human conceptual behavior , 1966 .

[25]  Wiebe van der Hoek,et al.  First steps in modal logic , 1997 .

[26]  Carus Paul The Foundation of Mathematics. , 1920 .

[27]  Saul A. Kripke,et al.  Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi , 1963 .

[28]  Vaughan R. Pratt,et al.  Models of program logics , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[29]  Susanne Prediger Terminologische Merkmalslogik in der Formalen Begriffsanalyse , 2000 .

[30]  Rudolf Wille,et al.  Conceptual Graphs and Formal Concept Analysis , 1997, ICCS.

[31]  Yuri Gurevich,et al.  Logic in Computer Science , 1993, Current Trends in Theoretical Computer Science.

[32]  Bernhard Ganter,et al.  Contextual Attribute Logic , 1999, ICCS.

[33]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[34]  Ulrike Sattler,et al.  Description Logics for Ontologies , 2003 .

[35]  N. F. Noy,et al.  Ontology Development 101: A Guide to Creating Your First Ontology , 2001 .