But that’s not all...
Upper-bound constraints
- Guarantee visibility of information
- e.g., S ? l(A)
- Approach
- Push upper bounds through constraint graph
- Detect inconsistencies
- Determine firm upper bounds as starting point for algorithm
- Complexity
- Acyclic: O(SHBc)
- Cyclic: O(NASH2Bc) (unchanged)