Combining constraint network and causal theory to solve scheduling problems from a CSP perspective
Robert Rodosek · elib (German Aerospace Center) · 1994
The Constraint Satisfaction Problem (CSP) is one of the areas of artificial intelligence where a significant amount of problem classification and complexity analysis has co-occurred. For a large class of scheduling problems, described in a CSP notation, we propose a hypergraph as an underlying structure. We show that using causal theories, based on the nature of constraints, can lead to a significant efficient improvement in solving this class of scheduling problems. The complexity of the new strategy is analyzed as well.