Re:The Power of Prolog
by kdtg on Thursday April 06, 2017 @01:43AM
(#14048222)
Intractable problems i.e., the ones that can't be solve in polynomial time. Logic programming in general is NP-Hard, so it's suitable for NP-Hard problems (constraint satisfaction problems, backtracking, etc). If you try to solve polynomial problems, it doesn't perform well.
[ Parent
| on HN ]
There are no comments on this comment yet.