» ASP Competition

BPSolver-CLP(FD)

Association:

International

Description:

Uses the B-Prolog system: tabling for P problems and CLP(FD) for NP problems.

Participants:

The submitted programs include contributions by Neng-Fa Zhou, Jiahuai You, Julio P. Di Egidio, Andrea Formisano, Agostino Dovier, Enrico Pontelli, and several anonymous authors. Martin Gebser gave a lot of help by clarifying problem descriptions and offering ideas for correct and better solutions.

System settings:

All the solutions are in B-Prolog. The programs for P problems use tabling and those for NP problems use CLP(FD). The program for Solitaire is in B^{fd}_{mv}, a language for planning implemented in CLP(FD). All the executable scripts call the same B-Prolog engine with the same setting except those that use tabling, which assigns more space to the table area.