| This is a collection of
programs written in CLP(FD) to solve the benchmark problems submitted
to the
Second Answer Set Programming Competition. It is hoped that these
programs will help CLP(FD) solvers enter the competition and compete
with ASP, SAT, and other CP solvers.
These programs have been tested with B-Prolog. It is hoped that they will be made to work with other CLP(FD) systems. Each program starts with a line that indicates its origin, which is
optionally followed by include directives for the common base library
and the system-specific library. Each program must define a
predicate, named solve(L), where L
is a list of atoms read from the input file. For example, for the
graph-coloring
problem, the list of atoms would be: Each program should end with a no-arg predicate, named test, which calls solvewith a sample input list. The common base library is available at base.pl. The system-specific libraries are available for B-Prolog (lib_bp.pl), ECLiPSe(lib_ecl_fd.ecl and lib_ecl_ic.ecl), SICStus-Prolog (lib_sics.pl), and SWI-Prolog (lib_swi.pl) now. The libraries will be updated as requested. When you write a program, please separate from the main program all system-specific predicates, which will be placed into the system-specific library. You only need to test your program with one system. It's hoped that your program will be made to work with other systems by other people. To submit a program, email it to (nzhou at acm [.] org) or post it to comp.lang.prolog under the subject "asp-competition".
| |
Programs |
|