摘要
布尔可满足问题是计算机科学中诸多领域的重要问题,它的快速求解具有十分重要的意义。将具有实际物理背景的Solar算法中的拟物算法与几何规划相结合,提出并实现了一种布尔可满足性问题的连续求解方法。经实验验证,这种算法对布尔可满足性问题的求解具有一定的实用价值。
Abstract：The Boolean satisfiability problem （SAT） is fundamental in many fields of computer sci- ence; so its fast solution is of great significance. The Solar algorithm is one of the famous quick SAT so- lutions. We combine the basic Solar algorithm with geometric programming method to propose a novel continuous solution of SAT problem. Experiments demonstrate that the proposal has potential applica- ble value for solving SAT problems.
出处
《计算机工程与科学》
CSCD
北大核心
2013年第9期122-126,共5页
Computer Engineering & Science
基金
广西自然科学基金资助项目(2011GXNSFA018154
2012GXNSFGA060003
2013GXNSFAA019342)
广西区主席科技资金(10169-1)
广西教育厅科研资助项目(201012MS274)
广西"八桂"学者项目
