Computational Complexity of Simultaneous Elementary Matching Problems*
Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy