ICFCA 2006: Dresden, Germany
Rokia Missaoui, Jürg Schmid (Eds.): Formal Concept Analysis, 4th International Conference, ICFCA 2006, Dresden, Germany, February 13-17, 2006, Proceedings. Springer 2006 Lecture Notes in Computer Science ISBN 3-540-32203-5
Invited Lectures
- Rudolf Wille: Methods of Conceptual Knowledge Processing. 1-29
- Tushar S. Kulkarni, Bernd S. W. Schröder: An Enumeration Problem in Ordered Sets Leads to Possible Benchmarks for Run-Time Prediction Algorithms. 30-44
- Jean-Claude Falmagne, Eric Cosyn, Jean-Paul Doignon, Nicolas Thiéry: The Assessment of Knowledge, in Theory and in Practice. 61-79
Regular Papers
- Anne Berry, Ross M. McConnell, Alain Sigayret, Jeremy Spinrad: Very Fast Instances for Concept Generation. 119-129
- Sébastien Ferré: Negation, Opposition, and Possibility in Logical Concept Analysis. 130-145
- Léonard Kwuida: A Note on Negation: A PCS-Completion of Semilattices. 146-160
- Francisco J. Valverde-Albacete, Carmen Peláez-Moreno: Towards a Generalisation of Formal Concept Analysis for Data Mining Purposes. 161-176
- Alain Gély, Lhouari Nourine: About the Family of Closure Systems Preserving Non-unit Implications in the Guigues-Duquenne Base. 191-204
- L. John Old: Homograph Disambiguation Using Formal Concept Analysis. 221-232
- John L. Pfaltz: Using Concept Lattices to Uncover Causal Dependencies in Software. 233-247
- Uta Priss: An FCA Interpretation of Relation Algebra. 248-263
- Christian Zschalig: Characterizing Planar Lattices Using Left-Relations. 280-290
- Richard Cole, Jon Ducrou, Peter W. Eklund: Automated Layout of Small Lattices Using Layer Diagrams. 291-305
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-18T211851 by the dblp team