This is a collection of programs written in B-Prolog for solving the benchmark problems submitted to the ASP Solver Competition 2011 by the BPSolver International team (members are Agostino Dovier, Yuanlin Zhang, and Neng-Fa Zhou). It is hoped that a direct comparison of B-Prolog and the cutting-edge ASP solvers will reveal both the strengths and weaknesses of CLP(FD) and ASP solvers. Each program starts with a comment that indicates the file name and authors followed by an include directive for the common base library base.pl. The first predicate is named solve(L), where L is a list of atoms read from the input file, and the last predicate is named test, which calls solve with a sample input list. For each benchmark, the column, Program, links to the submitted program. The column, Score and Ranking, gives the score on the scale from 100 (best) to 0 (worst) and ranking the solution earned in the competition. You should pay more attention to those programs that have poor performances if you are interested in submitting better programs. Comments and suggestions can be sent to Neng-Fa Zhou (nzhou at acm [.] org) or posted to comp.lang.prolog under the subject "asp-competition". |