Dynamic programming over non-redundant constraints yields 4^n time for an NP-hard IA fragment and asymptotically matches the o(n)^n bound for RCC.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Towards Single Exponential Time for Temporal and Spatial Reasoning: A Study via Redundancy and Dynamic Programming
Dynamic programming over non-redundant constraints yields 4^n time for an NP-hard IA fragment and asymptotically matches the o(n)^n bound for RCC.