Banks Election Solving Method Based on Answer Set Programming
KE Wan-tian · Jisuanji gongcheng · 2013
Banks election using a heuristic algorithm has the problem that the efficiency is low in the implementation,so this paper proposes a solving method based on Answer Set Programming(ASP).It establishes the mapping from Banks election problem to the ASP problem,writes the corresponding ASP,calls the answer set solver to solve,and each ASP model obtained is a solution of the Banks election problem.Experimental results show that when the problem size is 200,the solving time of this method is 4.196 s,solving efficiency is better than that of manual heuristic method.