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
PRISM is a probabilistic programming language based on Prolog augmented with primitives to represent probabilistic choice. PRISM… 
2016
2016
The declarative language Picat has recently entered the scene of constraint logic programming, in particular thanks to the… 
2013
2013
Mode-directed tabling is an extension to the tabling technique that supports the definition of mode operators for specifying how… 
2007
2007
This note attempts to give a quick analysis of the results of the BPrologCSP solver in the second international solver… 
2006
2006
CHR is a popular high-level language for implementing constraint solvers and other general purpose applications. It has a well… 
2006
2006
A suspension encapsulates everything needed to execute a piece of code many times in the same context: the need for this feature… 
2005
2005
In response to the call for solvers by the CPAI’05 solver competition organizing committee, we implemented a constraint solver… 
2005
2005
In this paper, we propose a new language, called AR (Action Rules), and describe how various propagators for finite-domain… 
1996
1996
The efficiency of delay depends to a large extent on the following four basic operations: delay, wakeup, interrupt, and resume…