On the public citation graph
Subdirect decomposition of concept lattices
0 signed · 74 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-642-01815-2_23openalex-snapshot
RESTRUCTURING LATTICE THEORY: AN APPROACH BASED ON HIERARCHIES OF CONCEPTS
inferredcites →https://doi.org/10.1007/978-94-009-7798-3_15openalex-snapshot
Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts
inferredcites →https://doi.org/10.1007/978-94-010-1220-1_6openalex-snapshot
Aspects of Finite Lattices
inferredcites →https://doi.org/10.1007/bf02485369openalex-snapshot
A topological representation theory for lattices
inferredcites →https://doi.org/10.1016/c2013-0-01147-4openalex-snapshot
Contributions to Universal Algebra
inferredcites →https://doi.org/10.1090/s0002-9904-1944-08235-9openalex-snapshot
Subdirect unions in universal algebra
inferredcites →https://doi.org/10.1515/crll.1969.239-240.333openalex-snapshot
Subdirekte Produkte und konjunkte Summen.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_16openalex-snapshot
A fast parallel algorithm for computing all maximal cliques in a graph and the related problems
inferred← citeshttps://doi.org/10.1007/3-540-45483-7_2openalex-snapshot
Formal Concept Analysis on Its Way from Mathematics to Computer Science
inferred← citeshttps://doi.org/10.1007/978-0-387-34925-1_11openalex-snapshot
Formal Concept Analysis in Design
inferred← citeshttps://doi.org/10.1007/978-1-4899-2608-1_32openalex-snapshot
Congruence Lattices of Finite Lattices as Concept Lattices
inferred← citeshttps://doi.org/10.1007/978-1-4899-2608-1_9openalex-snapshot
The Complete Congruence Lattice of a Complete Lattice
inferred← citeshttps://doi.org/10.1007/978-1-4899-3558-8_19openalex-snapshot
The Impact of Dilworth’s Work on Semimodular Lattices on the Kurosch-Ore Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-11928-6_7openalex-snapshot
Lattice Drawings and Morphisms
inferred← citeshttps://doi.org/10.1007/978-3-642-38317-5_1openalex-snapshot
Contextual Implications between Attributes and Some Representation Properties for Finite Lattices
inferred← citeshttps://doi.org/10.1007/978-94-009-2639-4_2openalex-snapshot
Lattices in Data Analysis: How to Draw Them with a Computer
inferred← citeshttps://doi.org/10.1007/bf00337926openalex-snapshot
Tensorial decomposition of concept lattices
inferred← citeshttps://doi.org/10.1007/bf01108830openalex-snapshot
On context patterns associated with concept lattices
inferred← citeshttps://doi.org/10.1007/bf01190610openalex-snapshot
A topological representation of lattices
inferred← citeshttps://doi.org/10.1007/bf01195382openalex-snapshot
Distributive laws for concept lattices
inferred← citeshttps://doi.org/10.1007/bf01224035openalex-snapshot
A note on the number of irreducibles of subdirect products
inferred← citeshttps://doi.org/10.1007/bf01235175openalex-snapshot
The generalized doubling construction and formal concept analysis
inferred← citeshttps://doi.org/10.1007/bf02362847openalex-snapshot
Mathematical aspects of concept analysis
inferred← citeshttps://doi.org/10.1007/bfb0023836openalex-snapshot
A distributed algorithm for finding all maximal cliques in a network graph
inferred← citeshttps://doi.org/10.1007/s00012-003-1833-1openalex-snapshot
A Simplicial elimination scheme for ?-semidistributive lattices and interval collapsing
inferred← citeshttps://doi.org/10.1007/s00012-004-1851-7openalex-snapshot
On forbidden configurations for strong posets
inferred← citeshttps://doi.org/10.1007/s00012-012-0200-5openalex-snapshot
Complete atomistic lattices are classification lattices
inferred← citeshttps://doi.org/10.1007/s00012-017-0457-9openalex-snapshot
Complete congruence lattices of two related modular lattices
inferred← citeshttps://doi.org/10.1007/s000120050089openalex-snapshot
Some properties of complete congruence lattices
inferred← citeshttps://doi.org/10.1007/s00165-013-0276-5openalex-snapshot
An elementary theory of product-line variations
inferred← citeshttps://doi.org/10.1016/0012-365x(88)90144-6openalex-snapshot
On finite lattices generated by their doubly irreducible elements
inferred← citeshttps://doi.org/10.1016/0898-1221(92)90120-7openalex-snapshot
Concept lattices and conceptual knowledge systems
inferred← citeshttps://doi.org/10.1016/j.aam.2003.09.002openalex-snapshot
Cayley lattices of finite Coxeter groups are bounded
inferred← citeshttps://doi.org/10.1016/j.dam.2016.11.021openalex-snapshot
Using congruence relations to extract knowledge from concept lattices
inferred← citeshttps://doi.org/10.1016/j.ijar.2021.05.007openalex-snapshot
Textural dependency and concept lattices
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.04.004openalex-snapshot
Minimum implicational basis for ∧-semidistributive lattices
inferred← citeshttps://doi.org/10.1016/j.jmp.2017.02.002openalex-snapshot
Compressed representation of Learning Spaces
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2003.09.008openalex-snapshot
Closure systems, implicational systems, overhanging relations and the case of hierarchical classification
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.029openalex-snapshot
Algorithms for k-meet-semidistributive lattices
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00196-3openalex-snapshot
On a dependence relation in finite lattices
inferred← citeshttps://doi.org/10.1016/s1071-5819(03)00044-2openalex-snapshot
Off to new shores: conceptual knowledge discovery and processing
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80124-6openalex-snapshot
Cayley lattices of finite Coxeter groups are bounded
inferred← citeshttps://doi.org/10.1023/a:1016524118566openalex-snapshot
Doubling Convex Sets in Lattices: Characterizations and Recognition Algorithms
inferred← citeshttps://doi.org/10.1023/a:1022927609440openalex-snapshot
Graph Automorphisms and Cells of Lattices
inferred← citeshttps://doi.org/10.1090/s0002-9947-1991-1036003-5openalex-snapshot
On Complete Congruence Lattices of Complete Lattices
inferred← citeshttps://doi.org/10.1093/comjnl/39.10.868openalex-snapshot
Building Sub-Knowledge Bases Using Concept Lattices
inferred← citeshttps://doi.org/10.1109/indusis.2010.5565787openalex-snapshot
Notice of Retraction: Regular abstraction of granule in a concept lattice
inferred← citeshttps://doi.org/10.1145/227607.227613openalex-snapshot
Reengineering of configurations based on mathematical concept analysis
inferred← citeshttps://doi.org/10.1145/253228.253354openalex-snapshot
Assessing modular structure of legacy code based on mathematical concept analysis
inferred← citeshttps://doi.org/10.1145/277631.277634openalex-snapshot
Concept analysis—a new framework for program understanding
inferred← citeshttps://doi.org/10.1145/277633.277634openalex-snapshot
Concept analysis—a new framework for program understanding
inferred← citeshttps://doi.org/10.1515/math-2017-0078openalex-snapshot
Classification lattices are geometric for complete atomistic lattices
inferred← citeshttps://doi.org/10.18514/mmn.2016.677openalex-snapshot
Characterizations of atomistic complete finite lattices relative to geometric ones
inferred← citeshttps://doi.org/10.2478/s12175-013-0129-yopenalex-snapshot
Extent partitions and context extensions
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.5436openalex-snapshot
Distributed Load Testing by Modeling and Simulating User Behavior
inferred← citeshttps://doi.org/10.3389/fpsyg.2022.822649openalex-snapshot
Exploration of Digital Creativity: Construction of the Multiteam Digital Creativity Influencing Factor Model in the Action Phase
inferred← citeshttps://doi.org/10.46298/dmtcs.2277openalex-snapshot
Characterization of Lattices Induced by (extended) Chip Firing Games
inferred← citeshttps://doi.org/10.46298/dmtcs.264openalex-snapshot
A characterization for all interval doubling schemes of the lattice of permutations
inferred← citeshttps://doi.org/10.46298/dmtcs.330openalex-snapshot
Efficient Algorithms on the Family Associated to an Implicational System
inferred← citeshttps://doi.org/10.48550/arxiv.1505.05109openalex-snapshot
Classification trees in a box extent lattice
inferred← citeshttps://doi.org/10.48550/arxiv.1506.08658openalex-snapshot
Lattice decompositions through methods using congruence relations
inferred← citeshttps://doi.org/10.48550/arxiv.math/0110211openalex-snapshot
Characterisation of lattices induced by (extended) Chip Firing Games
inferred← citeshttps://doi.org/10.5220/0005613203500357openalex-snapshot
The Reverse Doubling Construction
inferred← citeshttps://doi.org/10.70675/28731f01z3c02z4629za0d8z3e32fb4230c3openalex-snapshot
Computational aspects of infinite automata simulation and closure system related issues
inferred← citeshttps://doi.org/10.70675/ce0f8961zc173z4499z878eze31fee5fae67openalex-snapshot
Cadre général pour la recherche d'information et l'extraction de connaissances par l'exploration de treillis
inferred← citeshttps://doi.org/10.7151/dmgaa.1056openalex-snapshot
Classification systems and their lattice
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.