| Algorithm 6. Pseudocode of A*_BEST_CANDIDATE for CCDLSA*. |
| A*_BEST_CANDIDATE (conflicts, consistencies, fault_component) |
| Inputs: conflicts, the set of all conflicts consistencies, the set of all consistencies fault_components, the set of possible fault components Output: ω, the best candidate |
| add {} into queue do ω = pop queue if ω does not assign values for all components in fault_components EXPAND(ω, conflicts, consistencies) else break while(1) ω = ADD_DEFAULT(ω) return ω |