Pages that link to "Item:Q420926"
From MaRDI portal
The following pages link to Similarity measures over refinement graphs (Q420926):
Displaying 11 items.
- Upward refinement operators for conceptual blending in the description logic \(\mathcal{EL}^{++}\) (Q1653445) (← links)
- Order-sorted equational generalization algorithm revisited (Q2134938) (← links)
- Blending under deconstruction. The roles of logic, ontology, and cognition in computational concept invention (Q2188772) (← links)
- Counts-of-counts similarity for prediction and search in relational data (Q2218368) (← links)
- Robust similarity between hypergraphs based on valuations and mathematical morphology operators (Q2255814) (← links)
- Speeding up operations on feature terms using constraint programming and variable symmetry (Q2341834) (← links)
- Efficient identifications of structural similarities for graphs (Q2444149) (← links)
- ACUOS: A System for Modular ACU Generalization with Subtyping and Inheritance (Q2938523) (← links)
- Measuring Structural Similarities of Graphs in Linear Time (Q3167379) (← links)
- (Q4856890) (← links)
- Variant-based equational anti-unification (Q6160760) (← links)