并闭族的良度性的构造与工程
On Verifying and Engineering the Well-gradedness of a Union-closed Family
摘要:
当前生成知识空间的技术,如QUERY,保证了所得到的结构在并集下是封闭的,但不能保证它满足良好等级,这是学习空间的定义条件之一。在并闭集族的基础上,给出了保证其良分次的充要条件。我们考虑两种情况,这取决于族是否包含空集。我们还提供了有效地测试这些条件的算法,并在最小的方式,满足这些条件的一个集合家庭的扩增。
英文摘要:
Current techniques for generating a knowledge space, such as QUERY, guarantees 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 efficiently testing these conditions, and for augmenting a set family in a minimal way to one that satisfies these conditions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。