I'm very unfamiliar with this, but are Kanrens similar to Answer Set Programming? with ASP programs you generate a set of symbols, define relations between them and then filter out wrong answers with logic formulas. It's a prolog-y dialect that gets solved with something like a SAT solver.