Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- 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.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 21 matches
- 2007
- Marie Agier, Jean-Marc Petit:
A New and Useful Syntactic Restriction on Rule Semantics for Tabular Datasets. ICFCA 2007: 39-50 - Gabriela Arévalo, Anne Berry, Marianne Huchard, Guillaume Perrot, Alain Sigayret:
Performances of Galois Sub-hierarchy-building Algorithms. ICFCA 2007: 166-180 - Tim Becker:
Polynomial Embeddings and Representations. ICFCA 2007: 281-302 - Peggy Cellier, Sébastien Ferré, Olivier Ridoux, Mireille Ducassé:
A Parameterized Algorithm for Exploring Concept Lattices. ICFCA 2007: 114-129 - Peter W. Eklund, Rudolf Wille:
Semantology as Basis for Conceptual Knowledge Processing. ICFCA 2007: 18-38 - Sébastien Ferré:
The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees. ICFCA 2007: 98-113 - Bernhard Ganter:
Relational Galois Connections. ICFCA 2007: 1-17 - Bernhard Ganter, Heiko Reppe:
Base Points, Non-unit Implications, and Convex Geometries. ICFCA 2007: 210-220 - Tarek Hamrouni, Petko Valtchev, Sadok Ben Yahia, Engelbert Mephu Nguifo:
About the Lossless Reduction of the Minimal Generator Family of a Context. ICFCA 2007: 130-150 - Léonard Kwuida, Branimir Seselja, Andreja Tepavcevic:
On the MacNeille Completion of Weakly Dicomplemented Lattices. ICFCA 2007: 271-280 - Ben Martin, Peter W. Eklund:
Custom Asymmetric Page Split Generalized Index Search Trees and Formal Concept Analysis. ICFCA 2007: 82-97 - Jesús Medina, Manuel Ojeda-Aciego, Jorge Ruiz-Calviño:
On Multi-adjoint Concept Lattices: Definition and Representation Theorem. ICFCA 2007: 197-209 - Carlo Meghini, Nicolas Spyratos:
Computing Intensions of Digital Library Collections. ICFCA 2007: 66-81 - Dmitry E. Palchunov:
Lattices of Relatively Axiomatizable Classes. ICFCA 2007: 221-239 - Mohamed Rouane Hacene, Marianne Huchard, Amedeo Napoli, Petko Valtchev:
A Proposal for Combining Formal Concept Analysis and Description Logics for Mining Relational Data. ICFCA 2007: 51-65 - Sebastian Rudolph:
Some Notes on Pseudo-closed Sets. ICFCA 2007: 151-165 - Francisco J. Valverde-Albacete, Carmen Peláez-Moreno:
Galois Connections Between Semimodules and Applications in Data Mining. ICFCA 2007: 181-196 - Björn Vormbrock:
A Solution of the Word Problem for Free Double Boolean Algebras. ICFCA 2007: 240-270 - Rudolf Wille:
The Basic Theorem on Labelled Line Diagrams of Finite Concept Lattices. ICFCA 2007: 303-312 - Christian Zschalig:
Bipartite Ferrers-Graphs and Planar Concept Lattices. ICFCA 2007: 313-327 - Sergei O. Kuznetsov, Stefan Schmidt:
Formal Concept Analysis, 5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings. Lecture Notes in Computer Science 4390, Springer 2007, ISBN 3-540-70828-6 [contents]
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-15 07:26 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint