Solution for the question is provided below, please
comment if any doubts:
Constraint satisfaction problems (CSPs): CSP
are mathematical formulations of problems that consists of some
objects to be attained by satisfying a number of limitations or
constraints. The solution for the problem are obtained by various
solving methods such that it satisfies all the constraints.
Application domain formulation as a CSP:
- Every application domain definitely consists of a set of
objectives that to be attained by the application. Every
application is indented to perform a set of functions. These
functions are terms as the objectives of the CSP.
- Now need to formulate the constraints of CSP. The application
domain contains many limitation that has to be acceptable by the
application in order to run in a defined environment. Such that the
energy usage limitation, memory usage limitation, access function
limitations, etc.
- These limitations that has to be maintained by the application
are set as the constrains of CSP.
- Now the application domain is formulated as CSP as converting
the application functions as objects of CSP and the application
domain limitations as the CSP constraints. The objectives has to be
attained by satisfying the limitations.