I have taken an algorithms course where we talked about LP significantly, and also many reductions to LPs. As I recall, normal LP is not NP-Hard. Integer LP is NP-Hard. I am currently taking an introduction to AI course, and I was wondering if CSP is the same as LP.
There seems an awful lot of overlap, and I haven't been able to find anything that confirms or denies my suspicions.
If they are not the same (or one cannot be reduced to the other), what are the core differences in their concepts?