Cross-Volume Rule Resolution and Axiom Reduction: Detecting Threshold Conflicts among a Thousand Machine Rules and Finding a Minimal Primitive Set: chapter answers
The rules a business team hands to machines will sooner or later number in the thousands: price floors and exclusions, contrast ratios and touch targets, forbidden claims and countdowns, follow-up caps and quiet hours. A scanner marks in red every pair of rules on one metric whose numbers differ, and the common belief concludes that the rulebook contradicts itself. This book tests that belief. It splits conflict into four relations, duplicate, subsumption, compatibility and true contradiction; writes threshold rules as intervals in exact fractions; and reduces a thousand rules to a minimal pr…
DOI pending · monograph page goes live after publication · 5DL-B-258 · 中文版
- Chapter 1 · Most Conflicts among a Thousand Rules Are Redundancy
Chapter 1 states and quantifies the claim: in an illustrative library of a thousand rules, true contradictions are only 0.0392 of flagged pairs, 971 rules are redundant after the rulings and just 18 stay binding; even w… - Chapter 2 · Rules as Intervals: Deciding Threshold Conflicts Mechanically
Chapter 2 shows one-dimensional thresholds decided in one sweep, constraints between two quantities needing negative-cycle detection, and floating point inventing false conflicts on 0.1151 of boundary pairs. - Chapter 3 · Conflict Graphs and Transitive Closure: Contradictions Hidden in Chains
Switch rules form a conflict graph in which implication is transitive and exclusion spreads along implication. In the illustrative library of p31, 4 written exclusions become 6 after closure, and two dead rules emerge,… - Chapter 4 · Prime Implicants: Merging Forty Narrow Prohibitions into Four Primitives
Chapter 4 merges 40 narrow prohibitions into 4 primitives. - Chapter 5 · Greedy Set Cover and ln n: Provable Bounds on a Minimal Primitive Set
Chapter 5 gives the bounds and a gap certificate for greedy set cover, which on ordinary instances is off by a mean factor of only 1.0919. - Chapter 6 · Judging Synonyms: Two Errors of Text Similarity, and Canonical Keys
Chapter 6 shows text similarity recalling only 0.417 of true duplicates at the 0.85 cut-off and proposes canonical keys. - Chapter 7 · Classical Sources East and West: the Xunzi on Correct Names and Book I of Euclid's Elements
The Xunzi's "the same are named the same, the different are named differently" and "where a single name does not suffice, a compound name is used" correspond to merging, separating and adding scope in a rule library. p7… - Chapter 8 · Closing the Loop: Plugging in the Pruner, Monthly Reduction and a Pre-Registered Test
Chapter 8 gives an eight-step monthly routine for the pruner, the distilled tool, the Rule Conflict Reducer, and a pre-registered test: 60 blind-labelled pairs, a rejection bound of 23 and a test size of 0.0462. Marked…
Illustrative model calculation, not a live quote