遗传有限函数与置换的排序与去排序
Ranking and Unranking of Hereditarily Finite Functions and Permutations
摘要:
Prolog在回溯时返回多个答案的能力提供了一种优雅的机制,可以将组合对象的可逆编码导出为自然数,即{ \em ranking}和{ \em unranking}函数。从广义的阿克曼编码的遗传有限集与Urelements和一个新的元组/untupling操作,我们推导出有限函数的编码,并使用它们作为一个可执行的理论{ \em遗传有限函数}的积木。更困难的问题{ \em ranking}和{ \em unranking} { \em Hereditarily Finite Permutations},然后解决使用Lehmer码和factoradics。本文是作为一个独立的文学Prolog程序组织的,可在\url{http://logic.csci.unt.edu/tarau/research/2008/pHFF.zip}上获得
英文摘要:
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 ranking} and {\em unranking} functions. Starting from a generalization of Ackerman's encoding of Hereditarily Finite Sets with Urelements and a novel tupling/untupling operation, we derive encodings for Finite Functions and use them as building blocks for an executable theory of {\em Hereditarily Finite Functions}. The more difficult problem of {\em ranking} and {\em unranking} {\em Hereditarily Finite Permutations} is then tackled using Lehmer codes and factoradics. The paper is organized as a self-contained literate Prolog program available at \url{http://logic.csci.unt.edu/tarau/research/2008/pHFF.zip}
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。