[EN] Arc-Consistency algorithms are the most commonly used ltering techniques
to prune the search space in Constraint Satisfaction Problems (CSPs). 2-consistency is
a similar technique that guarantees that any instantiation ...
Arangú Lobig, Marlene Alicia; Salido Gregorio, Miguel Angel(University of Zielona Gora Press, 2011)
Constraint programming is a powerful software technology for solving numerous real-life problems. Many of these problems can be modeled as Constraint Satisfaction Problems (CSPs) and solved using constraint programming ...
Climent Aunés, Laura Isabel(Universitat Politècnica de València, 2011-09-21)
Desarrollo de dos métodos de búsquesa de soluciones robustas para problemas de satisfacción de restricciones dinámicos. Los métodos se basan en modelar estos problemas como problemas de satisfacción de restricciones ponderados.
Llaneras Estrada, Francisco; Sala, Antonio; Picó Marco, Jesús Andrés(Elsevier, 2012-12)
Living cells can be modelled by successively imposing known constraints that limit their behaviour, such as mass balances, thermodynamic laws or enzyme capacities. The resulting constraint-based models enclose all the ...
Barber Sanchís, Federico; Salido Gregorio, Miguel Angel(Universitat Politècnica de València, 2013-05-17)
Many real-world problems in Artificial Intelligence (AI) as well as in other areas of computer science and engineering can be efficiently modeled and solved using constraint programming techniques. In many real-world ...
Barber Sanchís, Federico; Salido Gregorio, Miguel Angel(Springer, 2015-09)
Many real-world problems in Artificial Intelligence (AI) as well as in other areas of
computer science and engineering can be efficiently modeled and solved using constraint programming
techniques. In many real-world ...