Table Of ContentLecture Notes in Artificial Intelligence 5548
EditedbyR.Goebel,J.Siekmann,andW.Wahlster
Subseries of Lecture Notes in Computer Science
Sébastien Ferré Sebastian Rudolph (Eds.)
Formal
Concept Analysis
7th International Conference, ICFCA 2009
Darmstadt, Germany, May 21-24, 2009
Proceedings
1 3
SeriesEditors
RandyGoebel,UniversityofAlberta,Edmonton,Canada
JörgSiekmann,UniversityofSaarland,Saarbrücken,Germany
WolfgangWahlster,DFKIandUniversityofSaarland,Saarbrücken,Germany
VolumeEditors
SébastienFerré
IRISA/IFSIC,UniversitédeRennes1
CampusUniversitairedeBeaulieu,35042RennesCEDEX,France
E-mail:[email protected]
SebastianRudolph
UniversitätKarlsruhe(TH),InstitutAIFB
76128Karlsruhe,Germany
E-mail:[email protected]
LibraryofCongressControlNumber:Appliedfor
CRSubjectClassification(1998):I.2,G.2.1,G.2.2,F.4.1,F.4.2,D.2.4,H.3
LNCSSublibrary:SL7–ArtificialIntelligence
ISSN 0302-9743
ISBN-10 3-642-01814-9SpringerBerlinHeidelbergNewYork
ISBN-13 978-3-642-01814-5SpringerBerlinHeidelbergNewYork
Thisworkissubjecttocopyright.Allrightsarereserved,whetherthewholeorpartofthematerialis
concerned,specificallytherightsoftranslation,reprinting,re-useofillustrations,recitation,broadcasting,
reproductiononmicrofilmsorinanyotherway,andstorageindatabanks.Duplicationofthispublication
orpartsthereofispermittedonlyundertheprovisionsoftheGermanCopyrightLawofSeptember9,1965,
initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Violationsareliable
toprosecutionundertheGermanCopyrightLaw.
springer.com
©Springer-VerlagBerlinHeidelberg2009
PrintedinGermany
Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India
Printedonacid-freepaper SPIN:12683055 06/3180 543210
Preface
The discipline of formal concept analysis (FCA) is concerned with the formal-
ization of concepts and conceptual thinking. Built on the solid foundation of
lattice and order theory, FCA is first and foremost a mathematical discipline.
However,itsmotivationandguidingprinciplesarebasedonstrongphilosophical
underpinnings. In practice, FCA provides a powerful framework for the quali-
tative, formal analysis of data, as demonstrated by numerous applications in
diverseareas.Likewise,itemphasizes the aspectof human-centeredinformation
processing by employing visualization techniques capable of revealing inherent
structure in data in an intuitively graspable way. FCA thereby contributes to
structuring and navigating the ever-growingamount of information available in
our evolving information society and supports the process of turning data into
information and ultimately into knowledge.
In response to an expanding FCA community, the International Conference
on Formal Concept Analysis (ICFCA) was established to provide an annual
opportunity for the exchange of ideas. Previous ICFCA conferences were held
in Darmstadt (2003), Sydney (2004), Lens (2005), Dresden (2006), Clermont-
Ferrand (2007), as well as Montreal (2008) and are evidence of vivid ongoing
interest and activities in FCA theory and applications.
ICFCA 2009 took place during May 21–24 at the University of Applied Sci-
ences in Darmstadt. Beyond serving as a host of the very first ICFCA in 2003,
Darmstadt can be seen as the birthplace of FCA itself, where this discipline
was introduced in the early 1980s and elaborated over the subsequent decades.
On this occasion, we were very delighted to include a reprint of Rudolf Wille’s
seminal paper on formal concept analysis to make it easily available for our
community.
Out of 29 submitted papers, 15 were accepted for publication in this volume
amounting to an acceptance rate of 52%. Less mature works which were still
considered valuable contributions for discussion were collected in a supplemen-
taryvolume,publishedas“Contributionsto ICFCA2009” by VerlagAllgemeine
Wissenschaft (ISBN 3-935924-08-9).
Clearly, the overall process of assembling a high-quality conference program
wouldnothavebeenpossiblewithoutthemuch-appreciatedhelpoftheProgram
Committee members, external reviewers, and members of the Editorial Board.
Finally, but most notably, we wish to thank the Conference Chair, Karl Erich
Wolff. In collaboration with the Local Chair, Urs Andelfinger, and the local
organization team, he realized a smoothly-run conference with a pleasant and
friendly atmosphere. Our warmest thanks for our hosts’ hospitality.
May 2009 Sébastien Ferré
Sebastian Rudolph
Organization
Executive Committee
Conference Chair
Karl Erich Wolff University of Applied Sciences, Darmstadt,
Germany
Local Chair
Urs Andelfinger University of Applied Sciences, Darmstadt,
Germany
Conference Organization Committee
Peter Burmeister Technische Universität Darmstadt, Germany
Markus Helmerich Technische Universität Darmstadt, Germany
Stefan Heppenheimer Technische Universität Darmstadt, Germany
Rudolf Wille Technische Universität Darmstadt, Germany
Program and Conference Proceedings
Program Chairs
Sébastien Ferré Université de Rennes 1, France
Sebastian Rudolph Universität Karlsruhe,Germany
Editorial Board
Peter Eklund University of Wollongong, Australia
Bernhard Ganter Technische Universität Dresden, Germany
Robert Godin LATECE, Université du Québec à Montréal
(UQAM), Montréal, Canada
Sergei O. Kuznetsov Higher School of Economics, Moscow, Russia
Raoul Medina LIMOS,UniversitéClermont-Ferrand2,France
Rokia Missaoui Université du Québec en Outaouais (UQO),
Gatineau, Canada
Sergei Obiedkov Higher School of Economics, Moscow, Russia
Uta Priss Napier University, Edinburgh, UK
Stefan E. Schmidt Technische Universität Dresden, Germany
Gerd Stumme University of Kassel, Germany
Rudolf Wille Technische Universität Darmstadt, Germany
Karl Erich Wolff University of Applied Sciences, Darmstadt,
Germany
VIII Organization
Program Committee
Mike Bain University of New South Wales, Sydney,
Australia
Peter Becker Concepta Consulting Pty Ltd., Australia
Radim Belohlavek Binghamton University - State University of
New York, USA
Sadok Ben Yahia Faculty of Sciences of Tunis, Tunisia
Claudio Carpineto Fondazione Ugo Bordoni, Italy
Frithjof Dau SAP Research CEC Dresden, Germany
Vincent Duquenne ECP6-CNRS, Université Paris 6, France
Linton Freeman UCI, California, USA
Alain Gély LITA, Université Paul Verlaine, Metz, France
Joachim Hereth DMC GmbH, Germany
Wolfgang Hesse Philipps-Universität Marburg, Germany
Bjoern Koester Technische Universität Dresden, Germany
Derrick G. Kourie University of Pretoria, South Africa
Markus Krötzsch Universität Karlsruhe,Germany
Marzena Kryszkiewicz Warsaw University of Technology, Poland
Leonard Kwuida Dresden, Germany
Wilfried Lex Universität Clausthal, Germany
Christian Lindig Schloss Dagstuhl - Leibniz Center for
Informatics, Germany
Engelbert Mephu Nguifo IUT de Lens - Université d’Artois, France
Lhouari Nourine LIMOS,UniversitéClermontFerrand2,France
Jean-Marc Petit LIRIS, INSA Lyon, France
Alex Pogel NewMexicoStateUniversity,LasCruces,USA
Sandor Radeleczki University of Miskolc, Hungary
Camille Roth CNRS/EHESS, Paris, France
Jurg Schmid Universität Bern, Switzerland
Selma Strahringer Cologne University of Applied Sciences,
Germany
Petko Valtchev Université du Québec à Montréal (UQAM),
Montréal, Canada
Serhyi Yevtushenko Luxoft, Ukraine
External Reviewers
Robert Jäschke University of Kassel, Germany
Peggy Cellier Université de Rennes 1, France
Denny Vrandečić Universität Karlsruhe,Germany
Organization IX
Sponsoring Institutions
Hochschule Darmstadt, University of Applied Sciences
Fachbereich Mathematik der Hochschule Darmstadt
Fachbereich Informatik der Hochschule Darmstadt
Zentrum für Forschung und Entwicklung der Hochschule Darmstadt
Fachbereich Mathematik der Technischen Universität Darmstadt
Ernst-Schröder-Zentrumfür Begriffliche Wissensverarbeitung
Table of Contents
Invited Talks
Usability Issues in Description Logic Knowledge Base Completion...... 1
Franz Baader and Barı¸s Sertkaya
Concept Lattice Orbifolds – First Steps............................. 22
Daniel Borchmann and Bernhard Ganter
The Advent of Formal Diagrammatic Reasoning Systems............. 38
Frithjof Dau
The Logic of Learning ............................................ 57
Luc De Raedt
What Can Formal Concept Analysis Do for Data Warehouses?......... 58
Rokia Missaoui and L´eonard Kwuida
Time and Logic: A.N. Prior’s Formal Analysis of Temporal
Concepts ....................................................... 66
Peter Øhrstrøm
Can Ontology Inform Ontologies? ................................. 82
Boris Wyssusek
Theory
Factor Analysis of Incidence Data via Novel Decomposition of
Matrices ........................................................ 83
Radim Belohlavek and Vilem Vychodil
A Unified Hierarchy for Functional Dependencies, Conditional
Functional Dependencies and Association Rules...................... 98
Raoul Medina and Lhouari Nourine
Robust Elements in Rough Set Abstractions......................... 114
Christian Meschke
Some Computational Problems Related to Pseudo-intents ............. 130
Barı¸s Sertkaya
Algorithms
Exploring Finite Models in the Description Logic EL ............... 146
gfp
Franz Baader and Felix Distel
XII Table of Contents
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept
Lattice ......................................................... 162
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev, and
Robert Godin
Context Graphs—Representing Formal Concepts by Connected
Subgraphs ...................................................... 178
Jens K¨otters, Heinz Schmidt, and David McG. Squire
Handling Large Formal Context Using BDD – Perspectives and
Limitations ..................................................... 194
Andrei Rimsa, Luis E. Za´rate, and Mark A.J. Song
Applications
A Novel Approach to Cell Formation ............................... 210
Radim Belohlavek, Niranjan Kulkarni, and Vilem Vychodil
Identifying EcologicalTraits: A Concrete FCA-Based Approach........ 224
Aur´elie Bertaux, Florence Le Ber, Agn`es Braud, and
Mich`ele Tr´emoli`eres
A Concept Lattice-Based Kernel for SVM Text Classification.......... 237
Claudio Carpineto, Carla Michini, and Raffaele Nicolussi
Two FCA-Based Methods for Mining Gene Expression Data........... 251
Mehdi Kaytoue, S´ebastien Duplessis, Sergei O. Kuznetsov, and
Amedeo Napoli
Ontology-Based Formal Concept Differences Analysis in Radiology
Report Impact by the Adoption of PACS ........................... 267
Telung Pan and Kwoting Fang
Revisiting the Potentialities of a Mechanical Thesaurus ............... 284
Uta Priss and L. John Old
FCA-Based Two Dimensional Pattern Matching ..................... 299
Fritz Venter, Derrick G. Kourie, and Bruce W. Watson
History
Restructuring Lattice Theory: An Approach Based on Hierarchies of
Concepts ....................................................... 314
Rudolf Wille
Author Index.................................................. 341
Usability Issues in
Description Logic Knowledge Base Completion
Franz Baader and Barı¸s Sertkaya(cid:2)
TU Dresden, Germany
{baader,sertkaya}@tcs.inf.tu-dresden.de
Abstract. Inapreviouspaper,wehaveintroducedanapproachforex-
tendingboththeterminologicalandtheassertionalpartofaDescription
Logic knowledge base by using information provided by the assertional
partandbyadomainexpert.Thisapproach,calledknowledgebasecom-
pletion, was based on an extension of attribute exploration to the case
of partial contexts. The present paper recalls this approach, and then
addresses usability issues that came up during first experiments with
a preliminary implementation of the completion algorithm. It turns out
thattheseissuescanbeaddressedbyextendingtheexplorationalgorithm
for partial contextssuch that it can deal with implicational background
knowledge.
1 Introduction
Description Logics (DLs) [1] are a successful family of logic-based knowledge
representationformalisms,whichcanbeusedtorepresenttheconceptualknowl-
edgeofanapplicationdomaininastructuredandformallywell-understoodway.
They are employed in various application domains, such as natural language
processing,configuration,databases,and bio-medical ontologies,but their most
notable success so far is due to the fact that DLs provide the logical under-
pinning of OWL, the standard ontology language for the semantic web [20]. As
a consequence of this standardization, several ontology editors support OWL
[19,22,23,27], and ontologies written in OWL are employed in more and more
applications. As the size of these ontologies grows, tools that support improv-
ing their quality become more important. The tools available until now use DL
reasoningtodetectinconsistenciesandtoinferconsequences,i.e.,implicitknowl-
edge that can be deduced from the explicitly represented knowledge. There are
also promising approaches that allow to pinpoint the reasons for inconsistencies
and for certain consequences, and that help the ontology engineer to resolve
inconsistencies and to remove unwanted consequences [6,7,21,24,32]. These ap-
proachesaddressthequalitydimensionofsoundness ofanontology,bothwithin
itself(consistency)andw.r.t.theintendedapplicationdomain(nounwantedcon-
sequences). Here, we are concerned with a different quality dimension, namely
completeness of the ontology w.r.t. to the intended application domain. In [5],
(cid:2) SupportedbytheGerman Research Foundation (DFG)undergrant BA 1122/12-1.
S.Ferr´eandS.Rudolph(Eds.):ICFCA2009,LNAI5548,pp.1–21,2009.
(cid:2)c Springer-VerlagBerlinHeidelberg2009
