7 citations · 15 across the 8 of their papers we have counts for
8 papers
Redundant Sudoku Rules
Bart Demoen, Maria Garcia de la Banda
The rules of Sudoku are often specified using twenty seven \texttt{all\_different} constraints, referred to as the {\em big} \mrules. Using graphical proofs and exploratory logic p…
High-Level Multi-Threading in hProlog
Timon Van Overveldt, Bart Demoen
A new high-level interface to multi-threading in Prolog, implemented in hProlog, is described. Modern CPUs often contain multiple cores and through high-level multi-threading a pro…
Representation Sharing for Prolog
Phuong-Lan Nguyen, Bart Demoen
Representation sharing can reduce the memory footprint of a program by sharing one representation between duplicate terms. The most common implementation of representation sharing…
TCHR: a framework for tabled CLP
Tom Schrijvers, Bart Demoen, David S. Warren
Tabled Constraint Logic Programming is a powerful execution mechanism for dealing with Constraint Logic Programming without worrying about fixpoint computation. Various application…
Incremental copying garbage collection for WAM-based Prolog systems
Ruben Vandeginste, Bart Demoen
The design and implementation of an incremental copying heap garbage collector for WAM-based Prolog systems is presented. Its heap layout consists of a number of equal-sized blocks…
Improving PARMA Trailing
Tom Schrijvers, Maria Garcia de la Banda, Bart Demoen +1
Taylor introduced a variable binding scheme for logic variables in his PARMA system, that uses cycles of bindings rather than the linear chains of bindings used in the standard WAM…