Skip to search formSkip to main contentSkip to account menu

B-Prolog

Known as: BProlog 
B-Prolog is a high-performance implementation of the standard Prolog language with several extended features including matching clauses, action rules… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Memoisation, or tabling, is a well-known technique that yields large improvements in the performance of some recursive… 
2012
2012
Tabling is an implementation technique that solves some limitations of Prolog's operational semantics in dealing with recursion… 
2009
2009
The strength of answer set programming (ASP) lies in solving computationally challenging problems declaratively, and hopefully… 
Review
2008
Review
2008
Tabled Logic Programming (TLP) has proven a useful paradigm for application areas such as natural language grammars, program… 
2006
2006
In previous work [1], we have presented a proposal to combine the power of tabling with the Extended Andorra Model (EAM) in order… 
2006
2006
Action Rules are currently only implemented by B-Prolog. One reason is that it is difficult to extract their exact semantics from… 
2005
2005
In response to the call for solvers by the CPAI’05 solver competition organizing committee, we implemented a constraint solver… 
2004
2004
CGLIB is a high-level graphics library for B-Prolog, a constraint logic programming system. The library provides primitives for…