Sign in
← AI PulseSep 23, 2026

Deep · research · Single-source brief

SMTB Algorithm Accelerates Structure-Mapping and Improves Performance in Large Domains

A new algorithm, Structure-Mapping with Tight Bounds (SMTB), demonstrates a 5 to 15 times speed improvement over the Structure-Mapping Engine (SME) and a 50% improvement in finding mappings within large nested domains.

By Illumora Editorial

Source · Sep 23, 2026, 4:00 AM · On Illumora · Sep 23, 2026, 4:02 AM

Media from the primary source — shown here so you can stay on Illumora.

Rewritten from one allowlisted primary — not independent enterprise reporting. Lanes →

Brief drafted by Illumora’s editorial model from the linked primary source. Ops desk reviews flagged pieces. How we write →

Read the source →arXiv cs.AI — SMTB: Fast Structure-Mapping with Tight Bounds
Save

A recent paper published on arXiv cs.AI introduces Structure-Mapping with Tight Bounds (SMTB), an algorithm designed to enhance the process of forming analogies by aligning relational systems. SMTB is presented as a component of the broader Cognitive Rule Engine (CRE) project.

Key Points

  • SMTB is a new structure-mapping algorithm. Its performance is 5 to 15 times faster than the Structure-Mapping Engine (SME).
  • SMTB is approximately 50% better at identifying mappings in large nested domains.
  • The Cognitive Rule Engine (CRE) is a flexible, multi-language-compatible framework.
  • CRE provides an accessible Python interface to C++ implementations of core cognitive algorithms.
  • SMTB is designed to operate effectively with a wide array of representation choices.
  • Unlike SME, SMTB maximizes relational connectivity without prioritizing higher-order relations.
  • SMTB functions equally well across arbitrary relational graphs and tree-like domains of nested predicate logic.

Context

According to the arXiv paper, structure-mapping involves creating analogies by aligning systems of relationally connected elements based on shared structure, rather than surface features. The CRE project, which includes SMTB, offers state-of-the-art C++ implementations for algorithms common in cognitive systems, such as pattern matching, planning, and structure-mapping. The authors note that SME tends to bias higher-order correspondences within tree-like predicate logic, a limitation that SMTB addresses by not privileging such relations.

Why It Matters

This development is significant for researchers and builders working with cognitive systems, as it offers a more efficient and versatile tool for analogy-making. The improved speed and accuracy of SMTB, particularly in complex data structures, could enable more robust and scalable applications of structure-mapping.

What To Do

  • Review the arXiv paper for detailed algorithmic descriptions and performance benchmarks.
  • Investigate the Cognitive Rule Engine (CRE) project for its Python interface and C++ implementations.
  • Compare SMTB's approach to relational connectivity against traditional SME methods in specific use cases.
  • Note the implications of SMTB's ability to handle both arbitrary relational graphs and tree-like domains.