Everything About ___
Live briefing

Everything about 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, and it also took the second place in P class in the second ASP solver competition and the second place overall in the third ASP solver competition. 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. B-Prolog is not anymore actively developed, but it forms the basis for the Picat programming language. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: B-PrologA 5-minute orientation
  2. Skim a recent paper: Application of the Lugano Classification for Initial Evaluation, Staging, and Response Assessment of Hodgkin and Non-Hodgkin Lymphoma: The PRoLoG Consensus Initiative (Part 1—Clinical)Influential work since 2022
  3. Pick up a classic book: ParzivalThe most-reprinted book on the subject
  4. Read the landmark paper: An introduction to Prolog IIICited 339 times
  5. Go sideways: PrologA closely related topic
  6. Go sideways: Logic programmingA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Matching clauses
  2. Action rules
  3. CLP(FD)
  4. Arrays and the array subscript notation
  5. Loops with foreach and list comprehension
  6. Tabling

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics