A probabilistic-circuit model over rule subsets lets knowledge graph completion use 70-96% fewer rules while retaining about 91% of full-rule-set accuracy.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Probabilistic Circuits for Knowledge Graph Completion with Reduced Rule Sets
A probabilistic-circuit model over rule subsets lets knowledge graph completion use 70-96% fewer rules while retaining about 91% of full-rule-set accuracy.