{"id":"palomar/PALOMAR-2026-10-20-000015","url":"https://github.com/shaikidris/priority-controller-phase1/tree/4defc1bfee6f82a50c5d48e6ad4fe6e01df73cc0","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-10-20-000015-v1.json","repo":"https://github.com/shaikidris/priority-controller-phase1","tags":["cs.DM","msc:06E30","msc:68Q25","computational-complexity","dual-horn-sat","vertex-cover","controllers"],"score":0,"title":"Dual-Horn models and vertex covers in priority controllers","trust":"high","domain":"cs.DM","source":"palomar","authors":["Idris Ali Shaik"],"reviews":0,"subject":"cs.DM","summary":"Dual-Horn satisfiability and finite graph vertex covers are represented by physical bridge detection in finite priority controllers. The constructions preserve the declared variable or vertex universe, have linear counted decoder size, and count eligible detecting qualifier sets rather than primary-input assignments.","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"verified":true,"discussed":0,"published":"2026-10-20","reactions":{},"formalized":true,"formalizes":[{"title":"Polynomial Fault Detection Without Bounded Width: Exact Reachable Sets in Priority Controllers","identifier":"doi:10.5281/zenodo.23400057","relationship":"formalizes"}]}