- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The paper casts conflicting finite-sample CI evidence as minimum-cost correction-set optimization. It proves projection correspondence between optimal stable models and optimal correction sets, graph fidelity to retained facts, and hard-retention/release-cost contestability properties. A Bayes-ball encoding replaces explicit active-path enumeration.
Critical strengths
- Inspectable repair objects and logical guarantees are valuable beyond returning a graph alone. Optimal-model projections, conflict certificates, and contestability margins form a coherent audit interface, instantiated by exact small-graph forced-retention evaluations
- The controlled ABA-PC comparison and encoding ablation are reasonable. Repair methods share CI traces, weights, and Bayes-ball encoding, while Table 4 isolates the encoding change and shows substantial eight-node speedups.
Critical weaknesses
1.It is unclear which theoretical guarantees are new relative to existing weighted constraint optimization methods. The contribution is clearer in how repairs are exposed and computed. 2.Differences in inputs and weights complicate some baseline comparisons. The small graphs and incomplete solver runs also limit the evidence for reliability and scalability.
Questions for authors
- Please clarify: With identical CI facts, strictly positive weights, and DAG space, do the authors agree with the optimal-cost and violation-set/correction-set equivalence above? If not, please give a counterexample. If so, which guarantee cannot be obtained from the previous weighted encoding with explicit violation-set output and a forced-retention re-solve?
- Please add additional comparison: On the existing exactly solvable small-graph subset, can both encodings use identical facts and weights, comparing optimal projections, retention-contestation outputs, and runtime to isolate encoding/interface gains?
- Please clarify: Can proven-optimal and incumbent subsets be reported separately, with complete set counts and generating-MEC coverage on fully enumerable cases? Please avoid interpreting full-trace failure on infeasible inputs as comparative weakness.
2 comments
Reply
I appreciate the replies. But the theoretical advance and the evidence for scalability still remain unclear to me. So I will maintain my score.
Thank you for the constructive questions.
W1/Q1: equivalence and guarantees. The common response addresses your correspondence and novelty query by relating weighted violations to releases and transferring our Thm. 2 to ASPCR's DAG encoding through the keep/fail construction. Our two-way projection, private conflicts and hard/graded revision guarantees make the abstract's contestability claim explicit: an expert can inspect, challenge and revise CI commitments with predictable consequences. Under the common response's assumptions, their CI-only objective is an instance of our general framework. Objective atoms can also encode weighted structural commitments, retaining conflict explanations and revision guarantees for feasible protections.
W2/Q2: matched comparison. Results Table R1 compares timings on our partial PC/MPC trace; the repair/contestation block compares projections and revisions on that evidence. This controls evidence acquisition, which differs between our partial-trace and ASPCR's native full-test pipelines. An additional link to Tables 12–13 is that matched ASPCR retains exactly the same facts as OptABA on all 400 original inputs, so their fact-count/P/R/F1 rows coincide.
W2/Q3: optima, incumbents and complete graph sets. Results Table R2 separates cost attainment from proof by budget. We also audited the original 400 saved outputs through additional rebuttal solves. We now certify the minimum cost for 397, including 29 of the original 32 timeouts. Three remain valid repairs without a minimum-cost certificate. Below are group means of the original fact scores (Table 13). Correct kept % and False kept % use Table 12's per-run counts, divided by all recorded tests in that run before averaging.
The next table combines original solve status, rebuttal cost certification, and compatibility with the generating MEC. The last two columns count repairs whose retained CI facts all agree with the generating DAG; by Cor. 1, exactly then its MEC remains among the compatible models. This checks inclusion, not unique recovery.
Table 18's graph counts are those found before the enumeration limit, even when the repair is proved optimal. For ten Survey and ten ER5 inputs, we fixed the CI statements retained by each method under the baseline settings (N=5,000, α=.01, original weights), then enumerated every DAG satisfying those statements. This completely enumerates the graph family of one selected repair per method per input, rather than all optimal repairs. The table gives medians over ten inputs per dataset; all enumerations finished and all twenty OptABA repairs are proved optimal.
We will add the certification audit to App. G.3 and complete-family results to App. G.4, clarifying Table 18's budgeted counts. These are the same baseline inputs used in YbLS Q4: that table measures average reconstruction accuracy, while this one reports set size and whether the exact generating MEC is included. On Survey both exclude the true MEC, despite OptABA's much smaller set; a small set alone does not establish truth.
W2/Q3: full-trace failure (Tables 5/18). We agree that an infeasible full CI trace cannot be satisfied by any DAG. Table 18 tests every native outcome for ASPCR/MPC, but only retained outcomes for ABA/OptABA. We will make that distinction explicit and remove the inference that positive full-trace disagreement means ASPCR provides no consistent repair. The matched experiment instead checks each output against its retained evidence. Table 7's 8/88 MPC failures on feasible traces remain a different, avoidable enforcement gap.
We are happy to provide any additional clarification.