Welcome
Welcome to my semi-professional, not-so-personal homepage. Here, you can find some information about me, my research, and my educational responsabilities. This website also contains a complete list of my publications (see below for some recent drafts and publications).
In a nutshell, I am PhD student at the DTAI research group of the Department of Computer Science at the K.U.Leuven university. My research is mostly centered around the The K.U.Leuven JCHR System, a state-of-the-art CHR implementation for Java. My research interests include:
- Programming language design
- Compilation, analysis, and optimization, particularly of rule based languages
- Declarative programming
- Constraint Handling Rules (CHR)
Recent News
-
The CHR survey has (finally)
been published in Theory and Practice of Logic Programming
.
Also, my article on
Efficient Lazy Evaluation of Rule-Based Programs,
accepted for publication in IEEE Transactions on Knowledge and Data Engineering,
is available as PrePrint
.
- I am co-organizing the CHR 2010 Workshop. This year's workshop will be held July 20, 2010 in Edinburgh (Scotland) at the occasion of ICLP 2010 (part of FLoC 2010), the premier international venue for presenting research in logic programming. The first call for papers is available.
- I presented two invited talks at the very productive CHR Working Week, organized by the University of Ulm (slides).
- Together with my teammates Leslie De Koninck and Hanne Vlaeminck, I won the 16th Prolog Programming Constest on July 15 at ICLP 2009 in Pasadena (CA), USA (photos).
Recent Publications
Under Review
There are currently no publications under review
In Press
-
,
Efficient Lazy Evaluation of Rule-Based Programs.
In IEEE Transactions on Knowledge and Data Engineering,
Special issue on Rule Representation, Interchange and Reasoning in Distributed, Heterogeneous Environments,
2010.
Accepted for publication.
Abstract
Thirty years after Forgy's seminal dissertation, Rete remains the de facto standard matching algorithm. Despite promising research results, alternative algorithms such as TREAT and LEAPS have had little impact on modern production rule engines. Constraint Handling Rules (CHR) is a high-level, declarative programming language, similar to production rules. In recent years, CHR has increasingly been used in a wide range of general-purpose applications. State-of-the-art CHR systems use LEAPS-like lazy matching, and implement a large body of novel program analyses and optimization techniques to further improve performance.
While obviously related, CHR and production rules research have mostly evolved independently from each other. With this article, we aim to foster cross-fertilization of implementation techniques. We provide a lucid, comprehensive overview of CHR's rule evaluation methodology, and survey recent contributions to the field of lazy matching. Our empirical evaluation confirms Rete-based engines would surely benefit from incorporating similar techniques and optimizations.@article{vanweert_lazy_evaluation_tkde10, author = {Van Weert, Peter}, title = {Efficient Lazy Evaluation of Rule-Based Programs}, year = 2010, journal = {IEEE Transactions on Knowledge and Data Engineering}, publisher = {IEEE Computer Society}, note = {Accepted for publication}, }
Recently Published
-
,
As Time Goes By: Constraint Handling Rules – A Survey of CHR Research between 1998 and 2007.
In Theory and Practice of Logic Programming,
10(1):1-47,
2010.
@article{chr_survey_tplp09, author = {Sneyers, Jon and Van Weert, Peter and Schrijvers, Tom and De Koninck, Leslie}, title = {As Time Goes By: {C}onstraint {H}andling {R}ules -- {A} Survey of {CHR} Research between 1998 and 2007}, year = 2009, journal = {Theory and Practice of Logic Programming}, pdf = {http://www.cs.kuleuven.be/~dtai/projects/CHR/papers/draft_chr_survey.pdf}, note = {Accepted for publication}, }Abstract
Constraint Handling Rules (CHR) is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers, it is now recognized as an elegant general purpose language.
CHR-related research has surged during the decade following the previous survey by Frühwirth (J. Logic Programming, Special Issue on Constraint Logic Programming, 1998, vol. 37, nos. 1-3, pp. 95-138). Covering more than 180 publications, this new survey provides an overview of recent results in a wide range of research areas, from semantics and analysis to systems, extensions and applications. -
,
A Proposal for a Next Generation of CHR.
In F. Raiser and J. Sneyers, editors,
CHR 2009: Proceedings of the Sixth Workshop on Constraint Handling Rules,
Pasadena, California,
pages 77-93,
July 2009.
@inproceedings{vanweert_dekoninck_sneyers_chr2_chr09, author = {Van Weert, Peter and De Koninck, Leslie and Sneyers, Jon}, title = {A Proposal for a Next Generation of {CHR}}, editor = {F. Raiser and J. Sneyers}, booktitle = {CHR'09: Proceedings of the 6th International Workshop on Constraint Handling Rules}, location = {Pasadena, California}, year = 2009, month = jul, note = {To appear}, }Abstract
This is a proposal for a next generation of CHR called CHR2. It combines the best features of language extensions proposed in earlier work and o.ers a solution to their main drawbacks. We introduce several novel language features, designed to allow the flexible, high-level specification of readable, efficient programs. Moreover, CHR2 is backwards compatible, such that existing programs can make use of CHR2's new features, but do not need to be changed.
Contact Information
- E-mail:
- Peter Van Weert
- Adress:
-
Department of Computer Science
K.U.Leuven
Celestijnenlaan 200A
3001 Heverlee
Belgium
- Room:
- 200A01.167
- Phone:
- +32 16 327665
- Fax:
- +32 16 327996