Border Algorithms for Computing Hasse Diagrams of Arbitrary Lattices (Q3003408): Difference between revisions

@@ Property / cites work @@
+A Formal Context for Symmetric Dependencies
@@ Property / cites work: A Formal Context for Symmetric Dependencies / rank @@
+Normal rank
@@ Property / cites work @@
+Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
+Normal rank
@@ Property / cites work @@
+Redundancy, Deduction Schemes, and Minimum-Size Bases for Association Rules
+Normal rank
@@ Property / cites work @@
+Q4692885
@@ Property / cites work: Q4692885 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4230685
@@ Property / cites work: Q4230685 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4802633
@@ Property / cites work: Q4802633 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4009664
@@ Property / cites work: Q4009664 / rank @@
+Normal rank
@@ Property / cites work @@
+From Concepts to Concept Lattice: A Border Algorithm for Making Covers Explicit
+Normal rank
@@ Property / cites work @@
+Formal concept analysis. 6th international conference, ICFCA 2008, Montreal, Canada, February 25--28, 2008. Proceedings
+Normal rank
@@ Property / cites work @@
+A fast algorithm for building lattices
@@ Property / cites work: A fast algorithm for building lattices / rank @@
+Normal rank
@@ Property / cites work @@
+An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic
+Normal rank
@@ Property / cites work @@
+Correction to “An equivalence between relational database dependencies and a fragment of propositional logic”
+Normal rank
@@ Property / cites work @@
+Q4817841
@@ Property / cites work: Q4817841 / rank @@
+Normal rank