| The issue you have circled around here is a bit deeper and nuanced than trimming down exponential code to something more tractable. In fact, it's often worse, and O(2^n) can be a blessing! The problem with logic programming is the 'logic' part. Modern imperative and functional programming languages are constructive. Logic programming is not, and the expressive power varies with the exact logic being used. Elementary logic gives you the following intuition.
Propositional logic -- easy.
First order logic -- easy (with caveats).
And (some kinds of) second order logic -- only easy if you get lucky with the problem you are trying to solve. For logic based programming languages and systems, both the language implementer and the programmer have to be careful about supporting and using language constructs which boil down to tractable computation. This is much more difficult than it seems like. For example, when using SMT solvers you learn quickly that multiplication and division with constants is very fast while the same operations with variables can be intractable. i.e. reasoning about x * C --easy, while x * y is often (but not always..) going to hang. |