• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 23 matches

• 2010
• 
  Vasu S. Alagar, Mubarak Mohammad, Kaiyu Wan:
  The Role of Concept, Context, and Component for Dependable Software Development. ICFCA 2010: 34-50
• 
  Mikhail A. Babin, Sergei O. Kuznetsov:
  On Links between Concept Lattices and Related Complexity Problems. ICFCA 2010: 138-144
• 
  Pierre Colomb, Alexis Irlande, Olivier Raynaud:
  Counting of Moore Families for n=7. ICFCA 2010: 72-87
• 
  Felix Distel:
  Hardness of Enumerating Pseudo-intents in the Lectic Order. ICFCA 2010: 124-137
• 
  Felix Distel:
  An Approach to Exploring Description Logic Knowledge Bases. ICFCA 2010: 209-224
• 
  Vincent Duquenne:
  Lattice Drawings and Morphisms. ICFCA 2010: 88-103
• 
  Peter W. Eklund, Jean Villerd:
  A Survey of Hybrid Representations of Concept Lattices in Conceptual Knowledge Processing. ICFCA 2010: 296-311
• 
  Amal Elkharraz, Petko Valtchev, Hafedh Mili:
  Concept Analysis as a Framework for Mining Functional Features from Legacy Code. ICFCA 2010: 267-282
• 
  Sébastien Ferré:
  Conceptual Navigation in RDF Graphs with SPARQL-Like Queries. ICFCA 2010: 193-208
• 
  Annie Foret, Sébastien Ferré:
  On Categorial Grammars as Logical Information Systems. ICFCA 2010: 225-240
• 
  Bernhard Ganter:
  Two Basic Algorithms in Concept Analysis. ICFCA 2010: 312-340
• 
  Alain Gély, Raoul Medina, Lhouari Nourine:
  About the Enumeration Algorithms of Closed Sets. ICFCA 2010: 1-16
• 
  Mikhail Klimushkin, Sergei A. Obiedkov, Camille Roth:
  Approaches to the Selection of Relevant Concepts in the Case of Noisy Data. ICFCA 2010: 255-266
• 
  Raoul Medina, Lhouari Nourine:
  Conditional Functional Dependencies: An FCA Point of View. ICFCA 2010: 161-176
• 
  Christian Meschke:
  Approximations in Concept Lattices. ICFCA 2010: 104-123
• 
  Henri Mühle, Christian Wende:
  Describing Role Models in Terms of Formal Concept Analysis. ICFCA 2010: 241-254
• 
  Sébastien Nedjar, Alain Casali, Rosine Cicchetti, Lotfi Lakhal:
  Constrained Closed Datacubes. ICFCA 2010: 177-192
• 
  Yoshiaki Okubo, Makoto Haraguchi:
  An Algorithm for Extracting Rare Concepts with Concise Intents. ICFCA 2010: 145-160
• 
  Uta Priss, L. John Old:
  Concept Neighbourhoods in Lexical Databases. ICFCA 2010: 283-295
• 
  Jean Vaillancourt:
  Statistical Methods for Data Mining and Knowledge Discovery. ICFCA 2010: 51-60
• 
  Rudolf Wille:
  Mathematics Presenting, Reflecting, Judging. ICFCA 2010: 17-33
• 
  Rudolf Wille:
  Formal Concept Analysis of Two-Dimensional Convex Continuum Structures. ICFCA 2010: 61-71
• 
  Léonard Kwuida, Baris Sertkaya:
  Formal Concept Analysis, 8th International Conference, ICFCA 2010, Agadir, Morocco, March 15-18, 2010. Proceedings. Lecture Notes in Computer Science 5986, Springer 2010, ISBN 978-3-642-11927-9 [contents]