This repository collects canonical reduction templates and proof sketches connecting Unified Rigidity Framework (URF) problems with Boolean SAT and general CSP formulations.
It includes:
- reduction constructions,
- correctness sketches,
- complexity relationships,
- formalization notes.
- Formal Cyclone closure: https://github.com/inaciovasquez2020/cyclone-terminal-obstruction
- Chronos–EntropyDepth kernel: https://github.com/inaciovasquez2020/Chronos-EntropyDepth
- URF core framework: https://github.com/inaciovasquez2020/urf-core
The clause-transcript entropy approach to resolution lower bounds has been formally closed (see chronos-urf-rr).
Support-symmetric and linear entropy functionals cannot capture resolution hardness.
Active direction: Communication Information Complexity of Search_F.
See: chronos-urf-rr/manuscripts/communication_information_reduction chronos-urf-rr/manuscripts/tseitin_ic_lower_bound