Bart Demoen

According to our database1, Bart Demoen authored at least 117 papers between 1987 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Bringing Algorithms to Flemish Classrooms: Teaching the Teachers, and some Students.
Proceedings of the 12th Workshop on Primary and Secondary Computing Education, 2017

2016
Graphs with coloring redundant edges.
EJGTA, 2016

2015
A method for detecting symmetries in constraint models and its generalisation.
Constraints, 2015

Learning a Hidden Markov Model-Based Hyper-heuristic.
Proceedings of the Learning and Intelligent Optimization - 9th International Conference, 2015

Solving Euclidean Steiner Tree Problems with Multi Swarm Optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

2014
Redundant Sudoku rules.
TPLP, 2014

Tor: Modular search with hookable disjunction.
Sci. Comput. Program., 2014

Lightweight dynamic symmetry breaking.
Constraints, 2014

Heuristics Entwined with Handlers Combined: From Functional Specification to Logic Programming Implementation.
Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, 2014

2013
Delimited continuations for prolog.
TPLP, 2013

Representation sharing for Prolog.
TPLP, 2013

Redundant disequalities in the Latin Square problem.
Constraints, 2013

2012
Introduction to the special issue on Prolog systems.
TPLP, 2012

Redundant Sudoku Rules
CoRR, 2012

Tor: extensible search with hookable disjunction.
Proceedings of the Principles and Practice of Declarative Programming, 2012

2011
On the implementation of the probabilistic logic programming language ProbLog.
TPLP, 2011

High-Level Multi-Threading in hProlog
CoRR, 2011

Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs
CoRR, 2011

Representation Sharing for Prolog
CoRR, 2011

2010
On the Implementation of the Probabilistic Logic Programming Language ProbLog
CoRR, 2010

2009
The computational power and complexity of constraint handling rules.
ACM Trans. Program. Lang. Syst., 2009

2008
CHR for Imperative Host Languages.
Proceedings of the Constraint Handling Rules, 2008

Guard Reasoning in the Refined Operational Semantics of CHR.
Proceedings of the Constraint Handling Rules, 2008

A Flexible Search Framework for CHR.
Proceedings of the Constraint Handling Rules, 2008

Improving Prolog programs: Refactoring for Prolog.
TPLP, 2008

TCHR: a framework for tabled CLP.
TPLP, 2008

Learn Prolog Now! Patrick Blackburn, Johan Bos, Kristina Striegnitz: College Publications, 2006 Paperback, ISBN 1-904987-17-6, xiv + 265 pages.
TPLP, 2008

Uniting the Prolog Community.
Proceedings of the Logic Programming, 24th International Conference, 2008

Towards Typed Prolog.
Proceedings of the Logic Programming, 24th International Conference, 2008

On the Efficient Execution of ProbLog Programs.
Proceedings of the Logic Programming, 24th International Conference, 2008

Environment Reuse in the WAM.
Proceedings of the Logic Programming, 24th International Conference, 2008

Two WAM Implementations of Action Rules.
Proceedings of the Logic Programming, 24th International Conference, 2008

A Novel Approach For Detecting Symmetries in CSP Models.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

2007
Incremental copying garbage collection for WAM-based Prolog systems.
TPLP, 2007

Fast Frequent Querying with Lazy Control Flow Compilation.
TPLP, 2007

Improving Prolog programs: Refactoring for Prolog
CoRR, 2007

TCHR: a framework for tabled CLP
CoRR, 2007

User-definable rule priorities for CHR.
Proceedings of the 9th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2007

Aggregates for CHR through Program Transformation.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2007

Aggregates in Constraint Handling Rules.
Proceedings of the Logic Programming, 23rd International Conference, 2007

The Correspondence Between the Logical Algorithms Language and CHR.
Proceedings of the Logic Programming, 23rd International Conference, 2007

2006
Improving PARMA trailing.
TPLP, 2006

Automatic Implication Checking for CHR Constraints.
Electr. Notes Theor. Comput. Sci., 2006

Fast Frequent Querying with Lazy Control Flow Compilation
CoRR, 2006

Incremental copying garbage collection for WAM-based Prolog systems
CoRR, 2006

Dijkstra's Algorithm with Fibonacci Heaps: An Executable Description in CHR.
Proceedings of the 20th Workshop on Logic Programming, 2006

INCLP(R) - Interval-based Nonlinear Constraint Logic Programming over the Reals.
Proceedings of the 20th Workshop on Logic Programming, 2006

Memory Reuse for CHR.
Proceedings of the Logic Programming, 22nd International Conference, 2006

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.
TPLP, 2005

Checking modes of HAL programs.
TPLP, 2005

Improving PARMA Trailing
CoRR, 2005

Guard Simplification in CHR programs.
Proceedings of the 19th Workshop on (Constraint) Logic Programming, 2005

Guard and Continuation Optimization for Occurrence Representations of CHR.
Proceedings of the Logic Programming, 21st International Conference, 2005

2004
Formally Specifying Dynamic Data Structures for Embedded Software Design: an Initial Approach.
Electr. Notes Theor. Comput. Sci., 2004

Checking modes of HAL programs
CoRR, 2004

Herbrand Constraints in HAL.
Proceedings of the Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development, 2004

2003
Query Transformations for Improving the Efficiency of ILP Systems.
Journal of Machine Learning Research, 2003

Refactoring Logic Programs: Extended Abstract.
Proceedings of the Logic Programming, 19th International Conference, 2003

2002
Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs.
J. Artif. Intell. Res., 2002

Combining an improvement to PARMA trailing with trailing analysis.
Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, 2002

Segment Order Preserving and Generational Garbage Collection for Prolog.
Proceedings of the Practical Aspects of Declarative Languages, 4th International Symposium, 2002

Trailing Analysis for HAL.
Proceedings of the Logic Programming, 18th International Conference, 2002

Copying Garbage Collection for the WAM: To Mark or Not to Mark?
Proceedings of the Logic Programming, 18th International Conference, 2002

A Different Look at Garbage Collection for the WAM.
Proceedings of the Logic Programming, 18th International Conference, 2002

To the Gates of HAL: A HAL Tutorial.
Proceedings of the Functional and Logic Programming, 6th International Symposium, 2002

2001
Heap Memory Management in Prolog with Tabling: Principles and Practice.
Journal of Functional and Logic Programming, 2001

2000
CHAT: the copy-hybrid approach to tabling.
Future Generation Comp. Syst., 2000

Scaling Up Inductive Logic Programming by Learning from Interpretations
CoRR, 2000

Project Report on LP+: A Second Generation Logic Programming Language.
AI Commun., 2000

On the Static Analysis of Indirect Control Transfers in Binaries.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2000

Heap Garbage Collection in XSB: Practice and Experience.
Proceedings of the Practical Aspects of Declarative Languages, 2000

Prolog and abduction 4 writing garbage collectors.
Proceedings of the Extended Abstracts of the 10th International Workshop on Logic-based Program Synthesis and Transformation, 2000

Two Advanced Transormations for Improving the Efficiency of an ILP system.
Proceedings of the Inductive Logic Programming, 10th International Conference, 2000

Executing Query Packs in ILP.
Proceedings of the Inductive Logic Programming, 10th International Conference, 2000

So Many WAM Variations, So Little Time.
Proceedings of the Computational Logic, 2000

1999
CAT: The Copying Approach to Tabling
Journal of Functional and Logic Programming, 1999

Scaling Up Inductive Logic Programming by Learning from Interpretations.
Data Min. Knowl. Discov., 1999

CHAT: The Copy-Hybrid Approach to Tabling.
Proceedings of the Practical Aspects of Declarative Languages, 1999

CHAT Is Theta(SLG-Wam).
Proceedings of the Logic Programming and Automated Reasoning, 6th International Conference, 1999

Herbrand Constraint Solving in HAL.
Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999

An Overview of HAL.
Proceedings of the Principles and Practice of Constraint Programming, 1999

A Finite Domain CLP Solver on Top of Mercury.
Proceedings of the New Trends in Contraints, 1999

1998
Semantics-Based Program Analysis for Logic-Based Languages Using XSB.
STTT, 1998

CAT: The Copying Approach to Tabling.
Proceedings of the Principles of Declarative Programming, 10th International Symposium, 1998

Memory Management for Prolog with Tabling.
Proceedings of the International Symposium on Memory Management, 1998

1997
On Delphi Lemmas and other Memoing Techniques for Deterministic Logic Programs.
J. Log. Program., 1997

XSB as the Natural Habitat for General Purpose Program Analysis.
Proceedings of the Logic Programming, 1997

1996
Partial Translation: Towards a Portable and Efficient Prolog Implementation Technology.
J. Log. Program., 1996

A Freeness and Sharing Analysis of Logic Programs Based on a Pre-interpretation.
Proceedings of the Static Analysis, Third International Symposium, 1996

Segment order preserving copying garbage collection for WAM based Prolog.
Proceedings of the 1996 ACM Symposium on Applied Computing, 1996

1995
Analyzing Logic Programs Using "PROP"-ositional Logic Programs and a Magic Wand.
J. Log. Program., 1995

The power of partial tanslation: an experiment with the C-ification of binary Prolog.
Proceedings of the 1995 ACM symposium on applied computing, 1995

1994
A Fine-Grained Parallel Memory Compaction Algorithm.
J. Parallel Distrib. Comput., 1994

Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop.
SAS, 1994

Language Embedding by Dual Compilation and State Mirroring.
Proceedings of the Sixth Workshop on Logic Programming Environments, 1994

Hybrid Tree Search in the Andorra Model.
Proceedings of the Logic Programming, 1994

A Comparison of Some Schemes for Translating Logic to C.
Proceedings of the Parallel and Data Parallel Execution of Logic Programs, 1994

Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop.
Proceedings of the ICLP 1994 Workshop W2: Verification and Analysis of (Concurrent) Logic Languages, 1994

Deriving Polymorphic Type Dependencies for Logic Programs using Multiple Incarnations of Prop.
Proceedings of the 1994 Joint Conference on Declarative Programming, 1994

1993
Analysing Logic Programs Using 'Prop'-ositional Logic Programs and a Magic Wand.
Proceedings of the Logic Programming, 1993

A Parallel Implementation for AKL.
Proceedings of the Programming Language Implementation and Logic Programming, 1993

Optimization Techniques for Nondeterministic Promotion in the Andorra Kernel Language.
Proceedings of the ICLP'93 Post-Conference Workshop on Concurrent Constraint Programming, 1993

1992
On the Transformation of a Prolog Program to a More Efficient Binary Program.
Proceedings of the Logic Program Synthesis and Transformation, 1992

Garbage Collection in Aurora: An Overview.
Proceedings of the Memory Management, 1992

1991
A New Scheme for Unification in WAM.
Proceedings of the Logic Programming, Proceedings of the 1991 International Symposium, San Diego, California, USA, Oct. 28, 1991

A Framework to Specify Database Update Views for Prolog.
Proceedings of the Programming Language Implementation and Logic Programming, 1991

Implementation of Prolog as Binary Definite Programs.
Proceedings of the Logic Programming, First Russian Conference on Logic Programming, Irkutsk, Russia, September 14-18, 1990, 1991

KAPPA: A Kernel Andorra Prolog Parallel Architecture Design.
Proceedings of the Parallel Execution of Logic Programs, 1991

1990
A la Recherche de la Mémoire Perdue OR Memory Compaction for Shard Memory Multiprocessors.
Proceedings of the Logic Programming, Proceedings of the 1990 North American Conference, Austin, Texas, USA, October 29, 1990

Program Source as Model for Debugging Prolog.
Proceedings of the ICLP 1990 Workshop on Logic Programming Environments, 1990

1989
On the Management of Choicepoint and Environment Frames in the WAM.
Proceedings of the Logic Programming, 1989

Indexing Prolog Clauses.
Proceedings of the Logic Programming, 1989

1988
A Partial Evaluation System for Prolog: some Practical Considerations.
New Generation Comput., 1988

Improving the Register Allocation of WAM by Recording Unification.
Proceedings of the Logic Programming, 1988

A Flexible Prolog-Based Lexical Database System.
Prolog and Databases, 1988

1987
Improving the Execution Speed of Compiled Prolog with Modes, Clause Selection, and Determinism.
Proceedings of the TAPSOFT'87: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1987

Abstract Interpretation: Towards the Global Optimization of Prolog Programs.
Proceedings of the 1987 Symposium on Logic Programming, San Francisco, California, USA, August 31, 1987


  Loading...