Over-constrained problems can be solved with the help of soft constraints. Weighted constraints are a typical representation of soft constraints used to minimize weights of unsati...
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
In a behavioral synthesis system, a typical approach used to guide the scheduler is to impose hard constraints on the relative timing between operations considering performance, a...
Soft constraints based on semirings are a generalization of classical constraints, where tuples of variables' values in each soft constraint are uniquely associated to element...
Constraints and quantitative preferences, or costs, are very useful for modelling many real-life problems. However, in many settings, it is difficult to specify precise preference ...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...