Abstract. The automatic modelling tool Conjure generates CSP models from problem specifications. The generated models may contain multiple alternative (redundant) representations ...
Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...
Theoretical models for the evaluation of quickly improving search strategies, like limited discrepancy search, are based on specific assumptions regarding the probability that a va...
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
— The task in control allocation is to determine how to generate a specified generalized force from a redundant set of control effectors where the associated actuator control in...