用于回溯搜索的Monad Transformers
Monad Transformers for Backtracking Search
摘要:
本文将Escardo和Oliva的选择单子扩展到选择单子Transformer,这是一个用于表达Haskell中回溯搜索算法的通用单子框架。使用密切相关的连续单子Transformer类似的目的也进行了讨论,包括一个DPLL样SAT求解器的实现没有明确的递归。继续探索选择函数和博弈论之间的联系的工作,我们使用选择单子Transformer与非确定性单子,以获得一个直观的概念,逆向归纳为某类非确定性游戏。
英文摘要:
This paper extends Escardo and Oliva's selection monad to the selection monad transformer, a general monadic framework for expressing backtracking search algorithms in Haskell. The use of the closely related continuation monad transformer for similar purposes is also discussed, including an implementation of a DPLL-like SAT solver with no explicit recursion. Continuing a line of work exploring connections between selection functions and game theory, we use the selection monad transformer with the nondeterminism monad to obtain an intuitive notion of backward induction for a certain class of nondeterministic games.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。