A hypergraph h is conformal if all the maximal cliques of its 2-section
are the maximal (by inclusion) edges of h. The test uses a theorem (see the
reference, Theorem 7.6.4) that says a hypergraph is conformal if and only if
its dual is Helly. A hypergraph is bi-conformal if it and its dual are conformal.
References
Voloshin, Vitaly I. Introduction to graph and hypergraph theory.
Nova Science Publ., 2009.