On Verifying and Engineering the Well-gradedness of a Union-closed Family

@article{Eppstein2007OnVA,
  title={On Verifying and Engineering the Well-gradedness of a Union-closed Family},
  author={D. Eppstein and J. Falmagne and Hasan Uzun},
  journal={ArXiv},
  year={2007},
  volume={abs/0704.2919}
}
  • D. Eppstein, J. Falmagne, Hasan Uzun
  • Published 2007
  • Mathematics, Computer Science
  • ArXiv
  • Abstract Current techniques for generating a knowledge space, such as QUERY, guarantee that the resulting structure is closed under union, but not that it satisfies wellgradedness, which is one of the defining conditions for a learning space. We give necessary and sufficient conditions on the base of a union-closed set family that ensures that the family is well-graded. We consider two cases, depending on whether or not the family contains the empty set. We also provide algorithms for… CONTINUE READING

    Topics from this paper.

    On the properties of well-graded partially union-closed families
    Building a Learning space
    Characterization of 1-uniform dcsl graphs and learning graphs
    • Germina K. Augusthy, B. Raj
    • 2020
    Learning graphs and 1-uniform dcsl graphs
    • 2
    A representation of antimatroids by Horn rules and its application to educational systems
    • 4
    • Highly Influenced
    • PDF
    Learning Spaces, and How to Build Them
    • 5
    Compressed representation of learning spaces
    • 3
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 32 REFERENCES
    Spaces for the Assessment of Knowledge
    • 364
    Well-graded families of relations
    • 67
    Computers and Intractability: A Guide to the Theory of NP-Completeness
    • 45,335
    • PDF
    On alternative representations for knowledge spaces
    • 16
    • Highly Influential
    • PDF
    Maximal dimensional partially ordered sets II. characterization of 2n-element posets with dimension n
    • 34
    • PDF
    Maximal dimensional partially ordered sets I. Hiraguchi's theorem
    • 25
    Isometric embedding in products of complete graphs
    • 221
    Media theory
    • 82
    Convexity in subsets of lattices.
    • 7