臺灣博碩士論文加值系統

很多數學上的問題都可以被化成命題定理題證明的形式來解，格
子點問題(lattice point problem) 就是一個例子。本論文就是
以命題定理證明器來解一些未知的格子點問題。程式的效率是問
題是否能解出來的關鍵。因格子點問題有很高的對稱性，而同構
精簡策略(isomorphism cutting strategy)就是藉著消除對稱來
增加程式解題的效率，因而能夠更快更有效率地解出格子點問題。

Many finite domain problems in mathematics and computer science can be
formulated in the form of propositional logic. A method called iomorphism
cutting strategy is used to eliminate the symmetry of a problem and the
efficiency. Lattice point problem is an open mathematics finite domain
problem. In this paper, some unknow lattice point problems are solved
in propositional logic with isomorphism cutting strategy to improve the
efficiency.