I have a very large number of constraints such as:
- $ A1 \land B1 \land C1 \land D1 \land E1 \land F1$
- $ A2 \land B2 \land C2 \land D2 \land E2 \land F2$
- $ A3 \land B3 \land C3 \land D3 \land E3 \land F3$
- $ A4 \land B4 \land C4 \land D4 \land E4 \land F4$
Here a constraint is a condition. For example, A1 is (response time < 10). All the condition needs to be satisfied such that the configuration is feasible. For instance, the configuration 1 needs to have A1, B1, C1, D1, E1 and F1 =1. How can I quickly check which configurations are valid? At moment I'm using a CSP (choco-solver) and iterate over each configuration and check the conditions. Is there a better (faster) way to do this rather than just checking the configuration one by one?