Learning description logic knowledge bases from data using methods from formal concept analysis

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

[2]  Sergei O. Kuznetsov,et al.  Comparing performance of algorithms for generating concept lattices , 2002, J. Exp. Theor. Artif. Intell..

[3]  Bernhard Nebel,et al.  Computational Complexity of Terminological Reasoning in BACK , 1988, Artif. Intell..

[4]  Bernhard Ganter,et al.  Completing Description Logic Knowledge Bases Using Formal Concept Analysis , 2007, IJCAI.

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

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

[7]  Sergei O. Kuznetsov,et al.  On the Intractability of Computing the Duquenne?Guigues Bas , 2004, J. Univers. Comput. Sci..

[8]  Ian Horrocks,et al.  FaCT++ Description Logic Reasoner: System Description , 2006, IJCAR.

[9]  Franz Baader,et al.  Usability Issues in Description Logic Knowledge Base Completion , 2009, ICFCA.

[10]  Boontawee Suntisrivaraporn,et al.  Reintroducing CEL as an OWL 2 EL Reasoner , 2009, Description Logics.

[11]  Sébastien Ferré.  Systèmes d'information logiques : un paradigme logico-contextuel pour interroger, naviguer et apprendre , 2002 .

[12]  Richard Holzer,et al.  On the Treatment of Incomplete Knowledge in Formal Concept Analysis , 2000, ICCS.

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

[14]  Franz Baader,et al.  A Finite Basis for the Set of EL-Implications Holding in a Finite Model , 2008, ICFCA.

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

[16]  Marvin Minsky,et al.  A framework for representing knowledge , 1974 .

[17]  Johanna Völker,et al.  Supporting Lexical Ontology Learning by Relational Exploration , 2007, ICCS.

[18]  M. F.,et al.  Bibliography , 1985, Experimental Gerontology.

[19]  Sebastian-Philipp Brandt.  Standard and non-standard reasoning in description logics , 2006 .

[20]  Thomas A. Henzinger,et al.  Computing simulations on finite and infinite graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[21]  Rudolf Wille,et al.  The Lattice of Concept Graphs of a Relationally Scaled Context , 1999, ICCS.

[22]  Bernhard Nebel,et al.  Terminological Cycles: Semantics and Computational Properties , 1991, Principles of Semantic Networks.

[23]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[24]  Ian Horrocks,et al.  Just the right amount: extracting modules from ontologies , 2007, WWW '07.

[25]  Franz Baader,et al.  Embedding defaults into terminological knowledge representation formalisms , 1995, Journal of Automated Reasoning.

[26]  Ian Horrocks,et al.  Practical Reasoning for Very Expressive Description Logics , 2000, Log. J. IGPL.

[27]  Felix Distel,et al.  Exploring Finite Models in the Description Logic ELgfp , 2009 .

[28]  Gerd Stumme,et al.  Fast Computation of Concept lattices Using Data Mining Techniques , 2000, KRDB.

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

[30]  Franz Baader,et al.  CEL - A Polynomial-Time Reasoner for Life Science Ontologies , 2006, IJCAR.

[31]  Franz Baader,et al.  A Proof-Theoretic Subsumption Reasoner for Hybrid EL-TBoxes , 2008, Description Logics.

[32]  Franz Baader,et al.  Building and Structuring Description Logic Knowledge Bases Using Least Common Subsumers and Concept Analysis , 2000, ICCS.

[33]  Ian Horrocks,et al.  Decidability of SHIQ with Complex Role Inclusion Axioms , 2003, IJCAI.

[34]  Uta Priss,et al.  The formalization of word net by methods of relational concept analysis , 1996 .

[35]  Olivier Ridoux,et al.  A Logical Generalization of Formal Concept Analysis , 2000, ICCS.

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

[37]  Bernhard Ganter,et al.  Constructing a Knowledge Base for Gene Regulatory Dynamics by Formal Concept Analysis Methods , 2008, AB.

[38]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[39]  Ian Horrocks,et al.  From SHIQ and RDF to OWL: the making of a Web Ontology Language , 2003, J. Web Semant..

[40]  Franz Baader,et al.  Pushing the EL Envelope Further , 2008, OWLED.

[41]  Felix Distel.  Hardness of Enumerating Pseudo-intents in the Lectic Order , 2010, ICFCA.

[42]  Ronald J. Brachman,et al.  An overview of the KL-ONE Knowledge Representation System , 1985 .

[43]  Ralf Küsters,et al.  Nonstandard Inferences in Description Logics: The Story So Far , 2006 .

[44]  Anni-Yasmin Turhan,et al.  Using Non-standard Inferen es in Des ription Logi s | what does it buy me ? , 2001 .

[45]  Susanne Prediger,et al.  Logical Scaling in Formal Concept Analysis , 1997, ICCS.

[46]  John F. Sowa,et al.  Principles of semantic networks , 1991 .

[47]  Felix Distel.  Model-based Most Specific Concepts in Description Logics with Value Restrictions , 2009 .

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

[49]  Boontawee Suntisrivaraporn,et al.  Polynomial time reasoning support for design and maintenance of large-scale biomedical ontologies , 2008 .

[50]  Lhouari Nourine,et al.  A Fast Algorithm for Building Lattices , 1999, Inf. Process. Lett..

[51]  Robert Piro,et al.  Enriching EL-Concepts with Greatest Fixpoints , 2010, ECAI 2010.

[52]  Gerd Stumme,et al.  Efficient Data Mining Based on Formal Concept Analysis , 2002, DEXA.

[53]  Sergei O. Kuznetsov,et al.  Some decision and counting problems of the Duquenne-Guigues basis of implications , 2008, Discret. Appl. Math..

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

[55]  Baris Sertkaya.  OntoComP: A Protégé Plugin for Completing OWL Ontologies , 2009, ESWC.

[56]  Felix Distel,et al.  On the complexity of enumerating pseudo-intents , 2011, Discret. Appl. Math..

[57]  Ian Horrocks,et al.  Experience building a Large, Re-usable Medical Ontology using a Description Logic with Transitivity and Concept Inclusions , 1997 .

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

[59]  Marcel Erné,et al.  A Primer on Galois Connections , 1993 .

[60]  B. Sertkaya,et al.  Explaining User Errors in Description Logic Knowledge Base Completion , 2008 .

[61]  Sergei O. Kuznetsov,et al.  Counting Pseudo-intents and #P-completeness , 2006, ICFCA.

[62]  Gerd Stumme,et al.  The Concept Classification of a Terminology Extended by Conjunction and Disjunction , 1996, PRICAI.

[63]  Ian Horrocks,et al.  Using an Expressive Description Logic: FaCT or Fiction? , 1998, KR.

[64]  Rudolf Wille,et al.  Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts , 2009, ICFCA.

[65]  Hector J. Levesque,et al.  The Tractability of Subsumption in Frame-Based Description Languages , 1984, AAAI.

[66]  Franz Baader.  Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles , 2003, IJCAI.

[67]  Sebastian Rudolph,et al.  Relational exploration: combining description logics and formal concept analysis for knowledge specification , 2006 .

[68]  Stefan Schlobach,et al.  Non-Standard Reasoning Services for the Debugging of Description Logic Terminologies , 2003, IJCAI.

[69]  Robert Piro,et al.  EL-Concepts go Second-Order: Greatest Fixpoints and Simulation Quantifiers , 2010, Description Logics.

[70]  Felix Distel.  An Approach to Exploring Description Logic Knowledge Bases , 2010, ICFCA.

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

[72]  Ralf Küsters,et al.  Computing Least Common Subsumers in Description Logics with Existential Restrictions , 1999, IJCAI.

[73]  Kent A. Spackman,et al.  SNOMED RT: a reference terminology for health care , 1997, AMIA.

[74]  Anni-Yasmin Turhan,et al.  On the computation of common subsumers in description logics , 2007 .

[75]  O. Ridoux,et al.  Introduction to logical information systems , 2004, Inf. Process. Manag..

[76]  Gerd Stumme.  Exploration tools in formal concept analysis , 1996 .

[77]  S. Brandt,et al.  Subsumption in EL w . r . t . hybrid TBoxes , 2022 .

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

[79]  Gerd Stumme,et al.  Theory-driven Logical Scaling: Conceptual Information Systems meet Description Logics , 1999, KRDB.

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

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

[82]  Sebastian Brandt,et al.  Polynomial Time Reasoning in a Description Logic with Existential Restrictions, GCI Axioms, and - What Else? , 2004, ECAI.

[83]  Baris Sertkaya.  Some Computational Problems Related to Pseudo-intents , 2009, ICFCA.

[84]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[85]  Bijan Parsia,et al.  Debugging OWL ontologies , 2005, WWW '05.

[86]  Gerd Stumme,et al.  Attribute Exploration with Background Implications and Exceptions , 1996 .

[87]  Ralf Küsters,et al.  Approximation and Difference in Description Logics , 2002, KR.

[88]  M. Ashburner,et al.  Gene Ontology: tool for the unification of biology , 2000, Nature Genetics.

[89]  Rafael Peñaloza,et al.  Axiom pinpointing in description logics and beyond , 2009 .

[90]  Franz Baader,et al.  How Pervasive Is the Myerson-Satterthwaite Impossibility? , 2009, IJCAI.

[91]  Bernhard Ganter,et al.  Two Basic Algorithms in Concept Analysis , 2010, ICFCA.

[92]  Baris Sertkaya,et al.  Formal concept analysis methods for description logics , 2007 .