On verifying and engineering the wellgradedness of a union-closed family

DOI10.1016/j.jmp.2008.09.002zbMath1176.91136arXiv0704.2919OpenAlexW3105881787MaRDI QIDQ1042303

Jean-Claude Falmagne, David Eppstein, Hasan B. Uzun

Publication date: 7 December 2009

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0704.2919

Mathematics Subject Classification ID

Memory and learning in psychology (91E40)

Related Items (6)

A representation of antimatroids by Horn rules and its application to educational systems ⋮ On the properties of well-graded partially union-closed families ⋮ Well-graded polytomous knowledge structures ⋮ Learning graphs and 1-uniform dcsl graphs ⋮ Knowledge structures delineated by fuzzy skill maps ⋮ Well-graded families and the union-closed sets conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Retracts of strong products of graphs
• Isometric embedding in products of complete graphs
• Greedoids
• Note on two necessary and sufficient axioms for a well-graded knowledge space
• Geometry of preference spaces
• On alternative representations for knowledge spaces
• Well-graded families of relations
• Stochastic token theory
• Stochastic evolution of rationality
• Distance-preserving subgraphs of hypercubes
• Maximal dimensional partially ordered sets. I: Hiraguchi's theorem
• Spaces for the assessment of knowledge
• On the Addressing Problem for Loop Switching
• A class of stochastic procedures for the assessment of knowledge
• Formal Concept Analysis

This page was built for publication: On verifying and engineering the wellgradedness of a union-closed family