In this lecture, we learned about Delta Debugging which was used in Project 2. We also learned about one-minimal and local minimums.
Given:
- a set C= {C1, C2... Cn}
- a function Interesting: C -> {Yes, No}
- Interesting(C) = Yes Interesting in monotonic, unanmbigous, and consistent
- Any subset of changes may be interesting (not just single changes)
- Interesting is monotonic
- Interesting(x) -> Interesting(x ∪ {c})
- Interesting is unambiguous
- [Interesting(x) AND Interesting(y)] -> Interesting(x ∩ y)
- Interesting is consistent
- Interesting(x) = YES or Interesting(x) = no
Why can't
Interesting (P1) = YES and Interesting (P2) = YES
because unanmbiguous Interesting(P1 ∩ P2) = {}
But!
Interesting(P1) = NO and Interesting(P2) = YES because consistent:
If this is the case, By monotone:
no subset if interesting, the interesting subset is a comnination of elements from P1 and P2