I am currently learning miniKanren by The Reasoned Schemer and Racket. I have three versions of minikanren implementation: The Reasoned Schemer, First Edition (MIT Press, 2005). I called it TRS1 h...

I started studying miniKanren with the book "The Reasoned Schemer - second edition" and the DrRacket scheme environment. I installed the "faster-minikanren" package, but the first examples of the ...

In Prolog - Programming for Artificial Intelligence, Bratko says the following on page 58. "Matching in Prolog corresponds to what is called unification in logic. However, we avoid the word unific...

By Logic Programming I mean the a sub-paradigm of declarative programming languages. Don't confuse this question with "What problems can you solve with if-then-else?" A language like Prolog is ver...

There is a video where minikanren is used to go from data to programs. That is, given data, it generates the program that generates the data. So is it possible to generate a universal function su...

Recently I have been looking into graph databases like Neo4j and into logic programming in Prolog and miniKanren. From what I have learned so far, both allow specifying facts and relations between ...

In miniKanren, succeed can be defined as (define succeed (== #t #t)), and fail can be defined as (define fail (=== #t #f)). But what about #s and #u as short forms of succeed and fail, as they appe...

I'm reading the Reasoned Schemer. I have some intuition about how conde works. However, I can't find a formal definition of what conde/conda/condu/condi do. I'm aware of https://www.cs.indiana.e...

Does MiniKanren have the "not" operator? For example, how would one represent Prolog's a :- b, not(c) a is true if b is true and c is not (Prolog uses negation as failure, i.e. not(c) is consid...

On Exercise (or entry?) 57, I'm just not understanding how the logic flows. The question is that this: given (define teacupo (lambda (x) (conde ((= tea x ) #s) ((= cup x ) #s) (else #u)))) ...

When I want to read up on logic programming I always stumble over two "main" ways to do it nowadays: miniKanren, a minilanguage introduced in The Reasoned Schemer and popular at the moment ...

I've just started playing with core.logic, and to work on it I'm trying to implement something simple that is similar to a problem that I am currently working on professionally. However, one part o...

I've been working through The Reasoned Schemer (TRS) using Clojure.logic and paying attention to the differences documented here. I reached frame 24 of Chapter 3, where TRS reports that (run 5 [x]...

I want to use Clojure's Core.logic. However, I want to also understand how it works. Is there a concise explanation of it somewhere? (Like implementing a metacircular evaluator?) Thanks!

I understand that some Prologs support dictionary-like associative data structures out of the box. For the implementations that do, do they support some notion of partial unification with another s...

Community Wiki I don't care about the reputation points, I just want good answers. Feel free to remark this question as community wiki. Context I'm been working through The Reasoned Schemer, and...

This is NOT homework -- the solution is already in the text. I just failed to understand the solution. Problem (run* (q) (let [a (== true q) b (== false q)] b)) Correct Solution (false) M...

Chapter 5 of SICP explains the scheme meta circular evaluator interns of a register machine. Is there anything that provides a similar type of Mini-Kanren in terms of Scheme primitives? I know th...

All miniKanren relations end with the letter o. What is the motivation for this? I see that the Clojure core.logic library also does this.