| Graphs With Coloring Redundant Edges | 0 | 0.34 | 2016 |
| Learning a Hidden Markov Model-Based Hyper-heuristic | 0 | 0.34 | 2015 |
| Solving Euclidean Steiner Tree Problems with Multi Swarm Optimization | 0 | 0.34 | 2015 |
| A method for detecting symmetries in constraint models and its generalisation | 0 | 0.34 | 2015 |
| Lightweight dynamic symmetry breaking | 6 | 0.50 | 2014 |
| Heuristics Entwined with Handlers Combined: From Functional Specification to Logic Programming Implementation | 4 | 0.50 | 2014 |
| Tor: Modular search with hookable disjunction | 2 | 0.43 | 2014 |
| Delimited continuations for prolog. | 0 | 0.34 | 2013 |
| Redundant disequalities in the Latin Square problem | 0 | 0.34 | 2013 |
| Representation sharing for prolog | 2 | 0.45 | 2013 |
| Tor: extensible search with hookable disjunction | 5 | 0.47 | 2012 |
| Introduction to the special issue on prolog systems | 1 | 0.36 | 2012 |
| Redundant Sudoku rules. | 1 | 0.39 | 2012 |
| High-Level Multi-Threading in hProlog | 0 | 0.34 | 2011 |
| Improving the efficiency of inductive logic programming through the use of query packs | 53 | 2.22 | 2011 |
| On the implementation of the probabilistic logic programming language problog | 71 | 2.00 | 2010 |
| The computational power and complexity of constraint handling rules | 24 | 1.15 | 2009 |
| Learn Prolog Now! Patrick Blackburn, Johan Bos, Kristina Striegnitz: College Publications, 2006 Paperback, ISBN 1-904987-17-6, xiv + 265 pages | 0 | 0.34 | 2008 |
| Environment Reuse in the WAM | 1 | 0.36 | 2008 |
| Towards Typed Prolog | 6 | 0.61 | 2008 |
| Two WAM Implementations of Action Rules | 3 | 0.43 | 2008 |
| On the Efficient Execution of ProbLog Programs | 28 | 1.28 | 2008 |
| Uniting the Prolog Community | 2 | 0.42 | 2008 |
| Tchr: A framework for tabled clp | 3 | 0.40 | 2007 |
| The correspondence between the logical algorithms language and CHR | 6 | 0.47 | 2007 |
| Aggregates for CHR through Program Transformation | 6 | 0.45 | 2007 |
| User-definable rule priorities for CHR | 21 | 1.04 | 2007 |
| Improving prolog programs: Refactoring for prolog | 10 | 0.74 | 2007 |
| Aggregates in constraint handling rules | 6 | 0.54 | 2007 |
| Automatic Implication Checking for CHR Constraints | 9 | 0.55 | 2006 |
| Dijkstra's Algorithm with Fibonacci Heaps: An Executable Description in CHR | 13 | 1.18 | 2006 |
| Incremental copying garbage collection for WAM-based Prolog systems | 1 | 0.35 | 2006 |
| Fast Frequent Querying with Lazy Control Flow Compilation | 4 | 0.45 | 2006 |
| INCLP(R) - Interval-based Nonlinear Constraint Logic Programming over the Reals | 6 | 0.50 | 2006 |
| Improving PARMA trailing | 0 | 0.34 | 2005 |
| Checking modes of HAL programs | 2 | 0.36 | 2005 |
| Guard and continuation optimization for occurrence representations of CHR | 8 | 0.53 | 2005 |
| Guard Simplification in CHR programs | 3 | 0.69 | 2005 |
| Book review: Programming in Prolog. Using the ISO Standard by William F. Clocksin , Christopher S. Mellish, Springer-Verlag, 2003, ISBN 3-540-00678-8 | 0 | 0.34 | 2005 |
| Formally Specifying Dynamic Data Structures for Embedded Software Design: an Initial Approach | 0 | 0.34 | 2004 |
| Logic Programming, 20th International Conference, ICLP 2004, Saint-Malo, France, September 6-10, 2004, Proceedings | 46 | 4.44 | 2004 |
| Herbrand Constraints in HAL | 0 | 0.34 | 2004 |
| Query transformations for improving the efficiency of ilp systems | 34 | 1.33 | 2003 |
| Refactoring Logic Programs: Extended Abstract | 0 | 0.34 | 2003 |
| Trailing Analysis for HAL | 1 | 0.36 | 2002 |
| Combining an improvement to PARMA trailing with trailing analysis | 1 | 0.36 | 2002 |
| Segment Order Preserving and Generational Garbage Collection for Prolog | 2 | 0.37 | 2002 |
| Copying Garbage Collection for the WAM: To Mark or Not to Mark? | 2 | 0.37 | 2002 |
| To the Gates of HAL: A HAL Tutorial | 12 | 0.71 | 2002 |
| A Different Look at Garbage Collection for the WAM | 2 | 0.38 | 2002 |
