B-Prolog

B-Prolog was a high-performance implementation of the standard Prolog language with several extended features including matching clauses, action rules for event handling, finite-domain constraint solving, arrays and hash tables, declarative loops, and tabling. First released in 1994, B-Prolog is now a widely used CLP system. The constraint solver of B-Prolog was ranked top in two categories in the Second International Solvers Competition,[1] and it also took the second place in P class in the second ASP solver competition [2] and the second place overall in the third ASP solver competition.[3] B-Prolog underpins the PRISM system, a logic-based probabilistic reasoning and learning system. B-Prolog is a commercial product, but it can be used for learning and non-profit research purposes free of charge (since version 7.8 for individual users, including commercial individual users, B-Prolog is free of charge [4]). B-Prolog is not anymore actively developed, but it forms the basis for the Picat programming language.

  1. ^ "Results of the Second International Competition of CSP and Max-CSP Solvers". www.cril.univ-artois.fr. Retrieved 2024-02-20.
  2. ^ "The Second Answer Set Programming Competition". dtai.cs.kuleuven.be. Retrieved 2024-02-20.
  3. ^ BPSolver’s Solutions to the Third ASP Competition Problems | Association for Logic Programming
  4. ^ "[bp-users]SAT Compiler in B-Prolog version 7.8". Archived from the original on 2014-03-09. Retrieved 2013-01-30.