The Silent (R)evolution of SAT
Today's powerful, robust SAT solvers have become primary tools for solving hard computational problems.
Functions and Jordan canonical forms of Riordan matrices
Algebraic Generating Functions for Languages Avoiding Riordan Patterns
Eļ¬cient representations for triangular substitutions
A comparison in miniKanren
This paper studies efficient representations for triangular substitutions in miniKanren, showing how skew binary random-access lists reduce lookup costs while preserving the advantages of a purely functional Scheme implementation.
[Read More]
Axioms for Centrality
miniKanren, live and untagged
Quine generation via relational interpreters
This paper presents relational interpreters for subsets of Scheme in miniKanren, emphasizing backward execution, quine generation, constraint-based reasoning, and untagged representations that simplify interpreter design.
[Read More]