9 citations · 37 across the 32 of their papers we have counts for
4 papers · 2 filters
Ranking and Unranking of Hereditarily Finite Functions and Permutations
Paul Tarau
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranki…
Executable Set Theory and Arithmetic Encodings in Prolog
Paul Tarau
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic…
Pairing Functions, Boolean Evaluation and Binary Decision Diagrams in Prolog
Paul Tarau
A "pairing function" J associates a unique natural number z to any two natural numbers x,y such that for two "unpairing functions" K and L, the equalities K(J(x,y))=x, L(J(x,y))=y…
A Logic Programming Framework for Combinational Circuit Synthesis
Paul Tarau, Brenda Luderman
Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts to reconnect the two…