Computes a minimal conflict over a list of thinks.
Computes a minimal conflict over a list of thinks. This version is faster : O(n) because it benefits from a remove operation
the initial S, typically empty
a list of C among which the minimal conflict must be searched
the procedure to inject a C into the S, going towards conflict
the procedure to remove a C from the S, possibly removing the conflict
the procedure to check whether or not the S is in conflict
a minimal subset of toinject such that, when injected into init, they cause a conflict
Computes a minimal conflict over a list of thinks.
Computes a minimal conflict over a list of thinks.
the initial S, typically empty
a list of C among which the minimal conflict must be searched
the procedure to inject a C into the S, going towards conflict
the procedure to check whether or not the S is in conflict
a minimal subset of toinject such that, when injected into init, they cause a conflict
Implements the famous quickXplain algorithm in a generic way [Ulrich Junker and F- Valbonne, QuickXPlain: Conflict Detection for Arbitrary Constraint Propagation Algorithms, 2001] and proposes a faster implementation in case additional operation can be performed on the state