arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1906.06251cs.AIcs.LOcs.SC
收藏

使用SAT求解器有效解决问题

Effective problem solving using SAT solvers

University of Waterloo(滑铁卢大学);Maplesoft(Maplesoft公司);Wilfrid Laurier University(劳里埃大学)

Curtis Bright, Jürgen Gerhard, Ilias Kotsireas, Vijay Ganesh

摘要:

在这篇文章中,我们将演示如何使用计算机代数系统Maple的内置SAT求解器来解决各种问题和谜题。一旦问题被编码到布尔逻辑中,就可以自动找到解决方案(或显示不存在),而不需要实现任何搜索算法。特别是,我们描述了如何解决$n$ -皇后问题,如何生成和解决数独难题,如何解决像爱因斯坦之谜这样的逻辑难题,如何解决15-难题,如何解决最大集团问题,以及寻找希腊-拉丁方。

英文摘要:

In this article we demonstrate how to solve a variety of problems and puzzles using the built-in SAT solver of the computer algebra system Maple. Once the problems have been encoded into Boolean logic, solutions can be found (or shown to not exist) automatically, without the need to implement any search algorithm. In particular, we describe how to solve the $n$-queens problem, how to generate and solve Sudoku puzzles, how to solve logic puzzles like the Einstein riddle, how to solve the 15-puzzle, how to solve the maximum clique problem, and finding Graeco-Latin squares.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑