On the public citation graph

Computations with finite closure systems and implications

https://doi.org/10.1007/bfb0030825
0 signed · 44 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/aima.1994.1069openalex-snapshot
A Theory of Finite Closure Spaces Based on Implications
inferredcites →https://doi.org/10.1007/bf00383449openalex-snapshot
Finding all closed sets: A general approach
inferredcites →https://doi.org/10.1007/bf00383945openalex-snapshot
Cover-preserving order embeddings into Boolean lattices
inferredcites →https://doi.org/10.1016/0020-0190(86)90063-3openalex-snapshot
Computing the minimum cover of functional dependencies
inferredcites →https://doi.org/10.1016/0097-3165(71)90023-9openalex-snapshot
Efficient subsemilattice generation
inferredcites →https://doi.org/10.1016/0898-1221(92)90120-7openalex-snapshot
Concept lattices and conceptual knowledge systems
inferredcites →https://doi.org/10.1017/cbo9780511662041openalex-snapshot
Matroid Applications
inferredcites →https://doi.org/10.1142/s0218196796000210openalex-snapshot
A POLYNOMIAL ALGORITHM FOR TESTING CONGRUENCE MODULARITY
inferredcites →https://doi.org/10.1145/28659.28665openalex-snapshot
Computing covers for embedded functional dependencies

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-45483-7_2openalex-snapshot
Formal Concept Analysis on Its Way from Mathematics to Computer Science
inferred← citeshttps://doi.org/10.1007/978-3-030-21462-3_5openalex-snapshot
Direct and Binary Direct Bases for One-Set Updates of a Closure System
inferred← citeshttps://doi.org/10.1007/978-3-030-77867-5_6openalex-snapshot
Pruning Techniques in LinCbO for Computation of the Duquenne-Guigues Basis
inferred← citeshttps://doi.org/10.1007/978-3-031-35949-1_6openalex-snapshot
Three Views on Dependency Covers from an FCA Perspective
inferred← citeshttps://doi.org/10.1007/978-3-319-64167-6_5openalex-snapshot
Acquisition of Terminological Knowledge from Social Networks in Description Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-78137-0_14openalex-snapshot
On the Merge of Factor Canonical Bases
inferred← citeshttps://doi.org/10.1007/s00012-002-8183-2openalex-snapshot
The lattice of strict completions of a finite poset
inferred← citeshttps://doi.org/10.1007/s10472-007-9057-2openalex-snapshot
Attribute-incremental construction of the canonical implication basis
inferred← citeshttps://doi.org/10.1007/s10472-013-9353-yopenalex-snapshot
Optimizations in computing the Duquenne–Guigues basis of implications
inferred← citeshttps://doi.org/10.1016/j.dam.2007.04.014openalex-snapshot
Some decision and counting problems of the Duquenne–Guigues basis of implications
inferred← citeshttps://doi.org/10.1016/j.dam.2012.08.031openalex-snapshot
Ordered direct implicational basis of a finite closure system
inferred← citeshttps://doi.org/10.1016/j.dam.2017.12.031openalex-snapshot
Direct-optimal basis computation by means of the fusion of simplification rules
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.022openalex-snapshot
Algorithms for computing the Shapley value of cooperative games on lattices
inferred← citeshttps://doi.org/10.1016/j.dam.2018.03.030openalex-snapshot
A depth-first search algorithm for computing pseudo-closed sets
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112399openalex-snapshot
Translating between the representations of a ranked convex geometry
inferred← citeshttps://doi.org/10.1016/j.ins.2021.04.104openalex-snapshot
LinCbO: Fast algorithm for computation of the Duquenne-Guigues basis
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.12.021openalex-snapshot
The multiple facets of the canonical direct implicational basis
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.029openalex-snapshot
Algorithms for k-meet-semidistributive lattices
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.03.018openalex-snapshot
The joy of implications, aka pure Horn formulas: Mainly a survey
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.11.021openalex-snapshot
Lattices, closures systems and implication bases: A survey of structural aspects and algorithms
inferred← citeshttps://doi.org/10.1016/s0165-4896(03)00072-6openalex-snapshot
The presence of lattice theory in discrete problems of mathematical social sciences. Why
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00209-3openalex-snapshot
The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00540-6openalex-snapshot
Idempotent and co-idempotent stack filters and min–max operators
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.1080/00207160.2011.644275openalex-snapshot
Closure via functional dependence simplification
inferred← citeshttps://doi.org/10.1080/03081079.2017.1349575openalex-snapshot
Probabilistic implication bases in FCA and probabilistic bases of GCIs in
inferred← citeshttps://doi.org/10.1080/03081079.2017.1357551openalex-snapshot
Relational similarity-based model of data part 2: dependencies in data
inferred← citeshttps://doi.org/10.1142/s021949881950004xopenalex-snapshot
Decision systems in rough set theory: A set operatorial perspective
inferred← citeshttps://doi.org/10.1177/19462174241306715openalex-snapshot
Analyzing the impact of bounded degree constraints on computational complexity of argumentation frameworks
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.0901.4417openalex-snapshot
Compression with wildcards: All, or all maximum, anticlques of a graph
inferred← citeshttps://doi.org/10.48550/arxiv.1910.14508openalex-snapshot
ALLSAT compressed with wildcards: Frequent Set Mining
inferred← citeshttps://doi.org/10.70675/148c5200zc441z43c1z9b85z7bb2f5ddc335openalex-snapshot
Algorithms on closure systems and their representations
inferred← citeshttps://doi.org/10.70675/7dec265fz8cdfz40b2zbb92z51969aaa33f0openalex-snapshot
On the enumeration of pseudo-intents : choosing the order and extending to partial implications
inferred← citeshttps://doi.org/10.70675/bb653a90z1ddaz4d00z8885z5df4b3f1a6ebopenalex-snapshot
On the dualization problem in graphs, hypergraphs, and lattices
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.