The B-Prolog International Team

Team

• Roman Bartak (Charles University)
• Agostino Dovier (University of Udine)
• Marco Gavanelli (University of Ferrara)
• Christian Theil Have (Roskilde University)
• Jia-Huai You (University of Alberta)
• Yuanlin Zhang (Texas Tech University)
• Neng-Fa Zhou (CUNY Brooklyn College and Graduate Center)

Description

B-Prolog provides several tools for tackling combinatorial optimization problems, including tabling for dynamic programming problems, CLP(FD) for CSPs, and a compiler that translates CSPs into SAT.

System Settings

Among the 15 submitted solutions, 8 solutions use CLP(FD), 5 solutions use tabling, and 2 solutions use SAT (the Lingeling solver). Problem-specific strategies are encoded in the solutions and all of the solutions use the same default system setting.

References

• Neng-Fa Zhou, The Language Features and Architecture of B-Prolog, Theory and Practice of Logic Programming, Special issue on Prolog systems, Vol. 12, nos.1-2, pp.189-218, 2012.