Two-Sided Admission Constraints: Rejection Intervals, Source Witnesses, and Edit Repair

Author deposited research note. This note gives a source-aware semantic organization of ordinary finite Boolean admission constraints. It does not introduce a new Boolean constraint language. A signedrejection clause (P, N) rejects the families K with P ⊆ K and K ∩ N = ∅. Admissibility is the hard pseudo-Boolean clause Σi∈P(1−y_i) + Σj∈N y_j ≥ 1. The canonical admission object is the family of maximal rejected intervals — theprime implicants of the rejected predicate (Blake's consensus canonicalization, in the equational lineage of Poretsky and Boole) — while source-labeled presentations preserve the provenance the canonical form forgets. Repair is minimum-cost final-state edit repair over additions and deletions, encoded as a 0-1 optimization problem. The note builds on standard Boolean, subcube, and pseudo-Boolean machinery; its contribution is the placement and discipline of the admission object, not a new propagation algorithm, global constraint, or solver.