News for hackers. Stuff that matters.
Re:Logic Puzzles with Prolog (2017) by YeGoblynQueenne on Wednesday November 20, 2019 @12:14PM (#21585866)
If I understand correctly, Hindley-Milner type inference performs unification but not resolution.

So I don't think the above is correct. I don't think there's any language that has built-in SLD-resolution theorem proving that isn't a logic programming language.

And Prolog is not really a constraint solver. Constraint Logic Programming languages have been implemented in Prolog but the concept of "constraint" is not built-in to Prolog.

Re:Logic Puzzles with Prolog (2017) by dreamcompiler on Wednesday November 20, 2019 @07:15PM (#21590098)
Prolog has constraints but they're limited to "equality" for some notion of that word. Constraint solvers and constraint extensions to Prolog broaden that considerably.
Re:Logic Puzzles with Prolog (2017) by YeGoblynQueenne on Thursday November 21, 2019 @05:29AM (#21592858)
Do you mean the equality predicates, like ==/2 or =:=/2 etc, or do you mean unification? I dont' really think of unification as a constraint but, I don't know, maybe you have a point.
Re:Logic Puzzles with Prolog (2017) by dreamcompiler on Thursday November 21, 2019 @10:47AM (#21595281)
Yes I was talking about unification. When you can expand what unification means and program how it works, you have a real constraint system.