According to wikipedia, prolog uses SLD Resolution. What are the principle algorithms driving the solving in core.logic?
Asked
Active
Viewed 409 times
1

Alex Miller
- 69,183
- 25
- 122
- 167

matanster
- 15,072
- 19
- 88
- 167
-
Did you look at the source? – Carcigenicate Nov 16 '16 at 19:06
-
Yes. If you have anything to contribute don't by shy. – matanster Nov 18 '16 at 10:14
-
1@false this question is not a duplicate. It asks for how it works, not for a comparison. The best answer so far sends you off to a comparison, but even the comparison doesn't necessarily provide the fullest answer. – matanster Nov 19 '16 at 11:29
-
@matanster: Please read the comment of OP on the answer! Should the comparison not "provide the fullest answer", then please do write a better answer! – false Nov 19 '16 at 11:38
-
@false, I don't know about you, but I am unable to add an answer, probably because this has been marked as a duplicate. Perhaps you are right that the other question subsumes this question, but this question is a lot narrow than that one. Rather than read through a multi-page answer to try to glean the desired information, I think a direct answer to this question would be much shorter. – Nathan Davis Nov 19 '16 at 17:33
1 Answers
3
core.logic is effectively miniKanren. Comparison here:
Or another explanation here:

Community
- 1
- 1

Alex Miller
- 69,183
- 25
- 122
- 167
-
Thanks, this comparison provides a great window for learning how they work, and for figuring out required readings in logic and theorem proving. – matanster Nov 18 '16 at 19:59