question
active
question:characterize-treelike-versus-relations-can-this-perhaps-be-done-automaticallyCharacterize treelike versus-relations! Can this perhaps be done automatically?
Central open question in evolutionary tree analysis: find axioms describing versus-relations derived from trees.
Neighborhood — ranked by edge-count
Findings (1)
finding
- Treelike versus-relations can be characterized by a single rule: wx | y, ¬wz | y → wx | z.answered_bygatesEmpirical discovery via FCA that versus-relations on evolutionary tree leaves satisfy a single Horn rule with variables.
Methods (2)
method
- Interactive algorithm for discovering complete implicational knowledge by computing stem base and seeking counterexamples.
- rule explorationassociated_withGeneralization of attribute exploration to FOL rules via factoring modulo context automorphisms.
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Statement that the versus relation uniquely determines a tree.
- Ternary relation xy|z defined on leaves of a tree as z ≰ x ∨ y; encodes the structure of evolutionary trees.
- Can we characterize polynomial-time computation and other complexity classes in such terms?question0.738Hoping for machine-independent, geometrical characterizations of complexity classes via interaction models.
- Opens up imaginative alternatives to conventional layout.
- Load-bearing statement of the primacy of relatedness.
- Third core research question motivating the CL loss approach in Section 5
- A practical test to determine if center B helps center A by comparing the life of A with and without B.