In Prolog’s terms, condA is “soft cut” a.k.a. *->, where A *-> B ; C is like (A, B ; not(A), C), only better ; whereas condU is “committed choice”, a combination of once and a soft cut so that (once(A) *-> B ; false) expresses (A, !, B) (with the cut inside): condA: A *-> … Read more
Prototyping. Prolog is dynamic and has been for 50 years. The compiler is liberal, the syntax minimalist, and “doing stuff” is easy, fun and efficient. SWI-Prolog has a built-in tracer (debugger!), and even a graphical tracer. You can change the code on the fly, using make/0, you can dynamically load modules, add a few lines … Read more
No, logic programming as embodied by those things and neo4j are quite different. On one level, you’re right that they conceptually both amount to graph storage and graph query. But for logic programming, it’s only conceptually graph query, there’s no guarantee that it’s actually stored that way (where with neo4j, it is). Second, with logic … Read more
First, allow me to compliment you on your fine pw0n1e icon. This is a tricky question to answer, largely because there are so many variants of both miniKanren and Prolog. miniKanren and Prolog are really families of languages, which makes it difficult to compare their features, or even how they are used in practice. Because … Read more