Important Notice: Our web hosting provider recently started charging us for additional visits, which was unexpected. In response, we're seeking donations. Depending on the situation, we may explore different monetization options for our Community and Expert Contributors. It's crucial to provide more returns for their expertise and offer more Expert Validated Answers or AI Validated Answers. Learn more about our hosting issue here.

I heard that constraint satisfaction and constraint solving are 2 branches of constraint programming. What exactly are they?

April 26, 2017branches constraint heard Programming satisfaction Solving

0

Posted

I heard that constraint satisfaction and constraint solving are 2 branches of constraint programming. What exactly are they?

1 Answer

0

Posted

Constraint satisfaction deals mainly with finite domains, whereas constraint solving deals with problems defined over infinite or more complex domains. Also, the solving techniques differ for both. Constraint satisfaction deals with more combinatorial methods, whereas Constraint Solving is based more on mathematical techniques (Example: Taylor series).