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… 
2014
2014
Abstract Tabling has been used for some time to improve efficiency of Prolog programs by memorizing answered queries. The same… 
2012
2012
Abstract In this work, we propose Answer-Set Programming (ASP) as a tool for rapid prototyping of dynamic programming algorithms… 
2009
2009
The strength of answer set programming (ASP) lies in solving computationally challenging problems declaratively, and hopefully… 
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… 
2004
2004
CGLIB is a high-level graphics library for B-Prolog, a constraint logic programming system. The library provides primitives for… 
2002
2002
  • Neng-Fa Zhou
  • 2002
  • Corpus ID: 1575017
Constraint Logic Programming (CLP) defines a family of programming languages that extend Prolog to support constraint solving…