On the public citation graph

A Theory of Finite Closure Spaces Based on Implications

0 signed · 59 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 points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/col.22105openalex-snapshot
Color separation for improved perceived image quality in terms of graininess and gamut
inferred← citeshttps://doi.org/10.1007/978-3-032-03364-2_23openalex-snapshot
The E-Base of Finite Semidistributive Lattices
inferred← citeshttps://doi.org/10.1007/978-3-032-34742-8_5openalex-snapshot
Characterizing the Optimum Bases of a Convex Geometry Using Quasi-Closed Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-322-90443-0_2openalex-snapshot
Hauptteil
inferred← citeshttps://doi.org/10.1007/978-3-540-73681-3_42openalex-snapshot
Characterizing Implications of Injective Partial Orders
inferred← citeshttps://doi.org/10.1007/978-3-540-87479-9_24openalex-snapshot
Minimum-Size Bases of Association Rules
inferred← citeshttps://doi.org/10.1007/978-3-540-87987-9_26openalex-snapshot
Query Learning and Certificates in Lattices
inferred← citeshttps://doi.org/10.1007/978-3-642-01039-2_7openalex-snapshot
Entailments and the Maximal Mesh
inferred← citeshttps://doi.org/10.1007/978-3-642-04414-4_16openalex-snapshot
Canonical Horn Representations and Query Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-14640-4_6openalex-snapshot
Two Measures of Objective Novelty in Association Rule Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-57217-3_1openalex-snapshot
Begriffe Und Implikationen
inferred← citeshttps://doi.org/10.1007/978-3-642-58625-5_6openalex-snapshot
Entailments and the Maximal Mesh
inferred← citeshttps://doi.org/10.1007/bfb0030825openalex-snapshot
Computations with finite closure systems and implications
inferred← citeshttps://doi.org/10.1007/pl00020905openalex-snapshot
Closure spaces and restricted games
inferred← citeshttps://doi.org/10.1007/s10472-023-09873-yopenalex-snapshot
Lattice point of view for argumentation framework
inferred← citeshttps://doi.org/10.1007/s10587-009-0018-2openalex-snapshot
Going down in (semi)lattices of finite moore families and convex geometries
inferred← citeshttps://doi.org/10.1007/s10994-011-5248-5openalex-snapshot
Construction and learnability of canonical Horn formulas
inferred← citeshttps://doi.org/10.1007/s11083-019-09516-0openalex-snapshot
A Compact Representation for Modular Semilattices and Its Applications
inferred← citeshttps://doi.org/10.1016/0893-9659(93)90075-xopenalex-snapshot
Axiomatizing simple binary matroids by their closed circuits
inferred← citeshttps://doi.org/10.1016/j.dam.2004.06.019openalex-snapshot
Pseudo-models and propositional Horn inference
inferred← citeshttps://doi.org/10.1016/j.dam.2004.06.021openalex-snapshot
Closure spaces that are not uniquely generated
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.2013.08.033openalex-snapshot
On implicational bases of closure systems with unique critical sets
inferred← citeshttps://doi.org/10.1016/j.dam.2017.06.009openalex-snapshot
Optimum basis of finite convex geometry
inferred← citeshttps://doi.org/10.1016/j.disc.2007.03.023openalex-snapshot
Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive supermatroid
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.ejc.2008.12.017openalex-snapshot
Realization of abstract convex geometries by point configurations
inferred← citeshttps://doi.org/10.1016/j.jmp.2016.09.002openalex-snapshot
A representation of antimatroids by Horn rules and its application to educational systems
inferred← citeshttps://doi.org/10.1016/j.laa.2008.09.042openalex-snapshot
Incidence algebras that are uniquely determined by their zero–nonzero matrix pattern
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.12.019openalex-snapshot
Learning definite Horn formulas from closure queries
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.2023.114030openalex-snapshot
The enumeration of meet-irreducible elements based on hierarchical decompositions of implicational bases
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115459openalex-snapshot
Computing the D-base and D-relation in finite closure systems
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(98)00271-0openalex-snapshot
Attribute exploration with background knowledge
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00279-5openalex-snapshot
Latticial structures in data analysis
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00012-5openalex-snapshot
Surmise relations between tests
inferred← citeshttps://doi.org/10.1023/a:1009889601723openalex-snapshot
Medical Surveillance, Frequent Sets, and Closure Operations
inferred← citeshttps://doi.org/10.1023/a:1015291410777openalex-snapshot
Quasiorders and Sublattices of Distributive Lattices
inferred← citeshttps://doi.org/10.1080/713827118openalex-snapshot
Structuration of phenotypes and genotypes through galois lattices and implications
inferred← citeshttps://doi.org/10.1109/icmlc.2006.258563openalex-snapshot
The Canonical Basis of Implicational System
inferred← citeshttps://doi.org/10.1142/s021819671450043xopenalex-snapshot
Lattices of regular closed subsets of closure spaces
inferred← citeshttps://doi.org/10.1142/s0218196796000210openalex-snapshot
A POLYNOMIAL ALGORITHM FOR TESTING CONGRUENCE MODULARITY
inferred← citeshttps://doi.org/10.1142/s021949881950004xopenalex-snapshot
Decision systems in rough set theory: A set operatorial perspective
inferred← citeshttps://doi.org/10.1609/aaai.v38i9.28930openalex-snapshot
Efficient Axiomatization of OWL 2 EL Ontologies from Data by Means of Formal Concept Analysis
inferred← citeshttps://doi.org/10.2168/lmcs-6(2:4)2010openalex-snapshot
Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules
inferred← citeshttps://doi.org/10.23638/lmcs-15(1:10)2019openalex-snapshot
Relative Entailment Among Probabilistic Implications
inferred← citeshttps://doi.org/10.25368/2023.214openalex-snapshot
Efficient Axiomatization of OWL 2 EL Ontologies from Data by means of Formal Concept Analysis
inferred← citeshttps://doi.org/10.3233/978-1-60750-472-6-iopenalex-snapshot
Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams
inferred← citeshttps://doi.org/10.37236/3068openalex-snapshot
The Prime Stems of Rooted Circuits of Closure Spaces and Minimum Implicational Bases
inferred← citeshttps://doi.org/10.46298/dmtcs.309openalex-snapshot
Some lattices of closure systems on a finite set
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.1910.05146openalex-snapshot
Analysis of Co-Occurrence Patterns in Data through Modular and Clan Decompositions of Gaifman Graphs
inferred← citeshttps://doi.org/10.5821/dissertation-2117-330388openalex-snapshot
Data analysis through graph decomposition
inferred← citeshttps://doi.org/10.5821/dissertation-2117-94411openalex-snapshot
Adaptive Learning and Mining for Data Streams and Frequent Patterns
inferred← citeshttps://doi.org/10.70675/148c5200zc441z43c1z9b85z7bb2f5ddc335openalex-snapshot
Algorithms on closure systems and their representations
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.