dyna

Depending on how you are using it, you could look into an actual constraint solver like Gecode or a more deterministic logic language like Dyna. The latter would probably require some implementation work - the only production-quality implementations I know of are proprietary. http://www.gecode.org/ https://github.com/nwf/dyna

I think declarative programming is real programming. The most obvious use case is when you have some sort of list of rules or constraint satisfaction problem. Gerrit uses its for that use case: https://gerrit-review.googlesource.com/Documentation/prolog-... One of my college professors has a language that's heavily influenced by Prolog and designed to solve NLP problems called Dyna (I think because many NLP parsing problems can be solved by dynamic programing approaches that logic programs can easily express and optimize for). https://github.com/nwf/dyna I actually think the real reason we don't see more Prolog or Prolog-like languages is not because they are bad approaches, but because it's relatively easy to make your own half-baked constraint satisfaction backtracking solver in a language like Python, and then write rules for it to eva