Return
Efficient data structures for fast and low-cost first-order logic rule mining
DOI:10.1016/j.is.2026.102690.png)
Abstract
En 中文
• We optimize logic rule mining from the perspective of data efficiency. • Inducing first-order logic rules from large-scale KBs is practical with normal PC hardwares. • Cache fragments implicitly represent Cartesian product of variable substitutions. • Integer tables build compact and efficient index for rule mining cache. • Cache components are pooled to avoid duplications.
Journal
I
IF:
3.4
Papers:
113
Citations:
0

