论文标题
通过解决巨大的8个难题，一种新的偏见复杂性观点
A new perspective of paramodulation complexity by solving massive 8 puzzles
论文作者
论文摘要
滑动拼图是一个组合难题，玩家沿着板上的某些路线滑动以达到一定的端口配置。在本文中，我们提出了一个新颖的测量，以质化作用是一种自动推理的推断方法，对大型滑动难题的复杂性进行了新的测量。事实证明，通过计算与偏见的从句的数量，我们可以评估每个难题的难度。在实验中，我们产生了100 * 8个难题，该难题通过反转来通过可溶性检查。通过这样做，我们可以将8个拼图的复杂性与与Paramodulation产生的数量相关的复杂性。例如，董事会[2,3,6,1,7,8,5,4，孔]是最简单的，得分为3008，板[6,5,8,7,4,4,3,2,1，孔]是最困难的，得分为48653。此外，在100个小问题中，我们已经成功地反应了几层复杂性（在100个小节中产生的条款）。我们可以得出结论，建议方法可以提供有关滑动块拼图的偏见复杂性的新观点。
A sliding puzzle is a combination puzzle where a player slide pieces along certain routes on a board to reach a certain end-configuration. In this paper, we propose a novel measurement of complexity of massive sliding puzzles with paramodulation which is an inference method of automated reasoning. It turned out that by counting the number of clauses yielded with paramodulation, we can evaluate the difficulty of each puzzle. In experiment, we have generated 100 * 8 puzzles which passed the solvability checking by countering inversions. By doing this, we can distinguish the complexity of 8 puzzles with the number of generated with paramodulation. For example, board [2,3,6,1,7,8,5,4, hole] is the easiest with score 3008 and board [6,5,8,7,4,3,2,1, hole] is the most difficult with score 48653. Besides, we have succeeded to obverse several layers of complexity (the number of clauses generated) in 100 puzzles. We can conclude that proposal method can provide a new perspective of paramodulation complexity concerning sliding block puzzles.
