1. Slim Abdennadher, Thom Frühwirth, and Christian Holzbaur, editors. Special Issue on Constraint Handling Rules, volume 5(4–5) of Theory and Practice of Logic Programming. Cambridge University Press, July 2005.
   

   @book{tplp05,
   editor = {Slim Abdennadher and Thom Fr\"uhwirth and Christian Holzbaur},
   title = {Special Issue on {C}onstraint {H}andling {R}ules},
   series = {Theory and Practice of Logic Programming},
   volume = {5(4--5)},
   year = {2005},
   month = jul,
   publisher = CUP,
   
   }
   




2. P. Barahona and A.P. Felty, editors. PPDP '05: Proc. 7th Intl. Conf. Princ. Pract. Declarative Programming, July 2005. ACM Press. ISBN: 1-59593-090-6.
   

   @proceedings{pppdp05,
   title = PPDP05l,
   booktitle = PPDP05,
   editor = {P. Barahona and A.P. Felty},
   month = jul,
   year = {2005},
   isbn = {1-59593-090-6},
   location = {Lisbon, Portugal},
   city = {Lisbon, Portugal},
   publisher = ACM,
   
   }
   




3. M. Gabbrielli and G. Gupta, editors. ICLP '05: Proc. 21st Intl. Conf. Logic Programming, volume 3668 of Lecture Notes in Computer Science, October 2005. Springer-Verlag.
   

   @proceedings{piclp05,
   title = ICLP05l,
   booktitle = ICLP05,
   editor = {M. Gabbrielli and G. Gupta},
   year = {2005},
   month = oct,
   location = {Sitges, Spain},
   city = {Sitges, Spain},
   series = LNCS,
   volume = 3668,
   publisher = SV 
   }
   




4. T. Schrijvers and Th. Frühwirth, editors. CHR '05: Proc. 2nd Workshop on Constraint Handling Rules, 2005. K.U.Leuven, Department of Computer Science, Technical report CW 421. Keyword(s): CHR 2005.
   

   @proceedings{pchr05,
   title = CHR05l,
   booktitle = CHR05,
   year = {2005},
   editor = {T. Schrijvers and Th. Fr{\"u}hwirth},
   location = {Sitges, Spain},
   city = {Sitges, Spain},
   publisher = KULCW # {, Technical report CW 421},
   keywords = {CHR 2005},
   
   }
   




5. A. Wolf, Th. Frühwirth, and M. Meister, editors. W(C)LP '05: Proc. 19th Workshop on (Constraint) Logic Programming, volume 2005-01 of Ulmer Informatik-Berichte, February 2005. [WWW]
   

   @proceedings{pwclp05,
   title = {W(C)LP '05: {P}roc. 19th {W}orkshop on ({C}onstraint) {L}ogic {P}rogramming},
   booktitle = {W(C)LP '05: {P}roc. 19th {W}orkshop on ({C}onstraint) {L}ogic {P}rogramming},
   editor = {A. Wolf and Th. Fr{\"u}hwirth and M. Meister},
   location = {Universit{\"a}t Ulm, Germany},
   city = {Universit{\"a}t Ulm, Germany},
   series = UIB,
   volume = {2005-01},
   month = feb,
   year = {2005},
   url = {http://www.informatik.uni-ulm.de/epin/pw/11541},
   
   }
   

1. Marco Alberti. A Computational Logic-based System for Specification and Verification of Agent Interaction. PhD thesis, University of Ferrara, Italy, 2005.
   

   @phdthesis{alberti_phdthesis05,
   author = {Marco Alberti},
   title = {A Computational Logic-based System for Specification and Verification of Agent Interaction},
   school = {University of Ferrara},
   address = {Italy},
   year = 2005,
   
   }
   




2. Alma Barranco-Mendoza. Stochastic and heuristic modelling for analysis of the growth of pre-invasive lesions and for a multidisciplinary approach to early cancer diagnosis. PhD thesis, Simon Fraser University, Burnaby, Canada, 2005. [WWW]
   

   @phdthesis{alma_thesis05,
   author = {Alma Barranco-Mendoza},
   title = {Stochastic and heuristic modelling for analysis of the growth of pre-invasive lesions and for a multidisciplinary approach to early cancer diagnosis},
   year = 2005,
   school = {Simon Fraser University},
   address = {Burnaby, Canada},
   url = {http://ir.lib.sfu.ca/handle/1892/2187},
   
   }
   




3. Gregory J. Duck. Compilation of Constraint Handling Rules. PhD thesis, University of Melbourne, Australia, December 2005. Keyword(s): implementation, optimizing compilation.
   

   @phdthesis{duck_phdthesis05,
   author = "Gregory J. Duck",
   title = {Compilation of {C}onstraint {H}andling {R}ules},
   keywords = {implementation, optimizing compilation},
   school = {University of Melbourne},
   year = 2005,
   address = {Australia},
   month = dec,
   
   }
   




4. Tom Schrijvers. Analyses, optimizations and extensions of Constraint Handling Rules. PhD thesis, K.U.Leuven, Belgium, June 2005. [WWW] [PDF] [POSTSCRIPT] Keyword(s): implementation, optimizing compilation.
   

   @phdthesis{schr_phdthesis05,
   author = "Tom Schrijvers",
   title = {Analyses, optimizations and extensions of {C}onstraint {H}andling {R}ules},
   keywords = {implementation, optimizing compilation},
   school = {K.U.Leuven},
   year = 2005,
   address = {Belgium},
   month = jun,
   url = {http://www.cs.kuleuven.be/publicaties/doctoraten/cw/CW2005_02.abs.html},
   pdf = {http://www.cs.kuleuven.be/publicaties/doctoraten/cw/CW2005_02.pdf},
   ps = {http://www.cs.kuleuven.be/publicaties/doctoraten/cw/CW2005_02.ps},
   
   }
   




5. Hongwei Zhu. Effective Information Integration and Reutilization: Solutions to Technological Deficiency and Legal Uncertainty. PhD thesis, Engineering Systems Division, Massachusetts Institute of Technology, Cambridge, MA, USA, September 2005.
   

   @phdthesis{zhu_05,
   title = {Effective Information Integration and Reutilization: Solutions to Technological Deficiency and Legal Uncertainty},
   author = {Hongwei Zhu},
   school = {Engineering Systems Division, Massachusetts Institute of Technology, Cambridge, MA, USA},
   month = {September},
   year = {2005} 
   }
   

1. Peter J. Stuckey and Martin Sulzmann. A theory of overloading. ACM Trans. Program. Lang. Syst., 27(6):1216-1269, 2005. ISSN: 0164-0925. Keyword(s): type systems.
   

   @article{stuck_sulz_theory_of_overloading_toplas05,
   author = {Peter J. Stuckey and Martin Sulzmann},
   title = {A theory of overloading},
   journal = TOPLAS,
   volume = {27},
   number = {6},
   year = {2005},
   issn = {0164-0925},
   pages = {1216--1269},
   keywords = {type systems},
   publisher = ACM,
   
   }
   




2. Slim Abdennadher and Christophe Rigotti. Automatic generation of CHR constraint solvers. In Slim Abdennadher, Thom Frühwirth, and Christian Holzbaur, editors, Special Issue on Constraint Handling Rules, volume 5(4–5) of Theory and Practice of Logic Programming, pages 403-418. Cambridge University Press, July 2005. [doi:10.1017/S1471068405002371] Keyword(s): program generation.
   

   @incollection{abd_rigotti_automatic_generation_tplp05,
   author = {Slim Abdennadher and Christophe Rigotti},
   title = {Automatic generation of {CHR} constraint solvers},
   keywords = {program generation},
   pages = {403--418},
   crossref = {tplp05},
   doi = {10.1017/S1471068405002371},
   year = 2005,
   
   }
   




3. Marco Alberti, Marco Gavanelli, Evelina Lamma, Paola Mello, and Michela Milano. A CHR-based implementation of known arc-consistency. In Slim Abdennadher, Thom Frühwirth, and Christian Holzbaur, editors, Special Issue on Constraint Handling Rules, volume 5(4–5) of Theory and Practice of Logic Programming, pages 419-440. Cambridge University Press, July 2005. [doi:10.1017/S147106840500236X]
   

   @incollection{alberti_et_al_chr_implementation_of_arc_consistency_tplp05,
   author = {Marco Alberti and Marco Gavanelli and Evelina Lamma and Paola Mello and Michela Milano},
   title = {A {CHR}-based implementation of known arc-consistency},
   pages = {419--440},
   crossref = {tplp05},
   doi = {10.1017/S147106840500236X},
   year = 2005,
   
   }
   




4. Sebastian Brand and Krzysztof R. Apt. Schedulers and Redundancy for a Class of Constraint Propagation Rules. In Slim Abdennadher, Thom Frühwirth, and Christian Holzbaur, editors, Special Issue on Constraint Handling Rules, volume 5(4–5) of Theory and Practice of Logic Programming, pages 441-465. Cambridge University Press, July 2005. [doi:10.1017/S1471068405002401]
   

   @incollection{brand_apt_schedulers_redundancy_tplp05,
   author = {Sebastian Brand and Krzysztof R. Apt},
   title = {Schedulers and Redundancy for a Class of Constraint Propagation Rules},
   pages = {441--465},
   crossref = {tplp05},
   doi = {10.1017/S1471068405002401},
   year = 2005,
   
   }
   




5. Henning Christiansen. CHR grammars. In Slim Abdennadher, Thom Frühwirth, and Christian Holzbaur, editors, Special Issue on Constraint Handling Rules, volume 5(4–5) of Theory and Practice of Logic Programming, pages 467-501. Cambridge University Press, July 2005. [doi:10.1017/S1471068405002395] Keyword(s): applications, linguistics.
   

   @incollection{christ_chr_grammars_tplp05,
   author = {Henning Christiansen},
   title = {{CHR} grammars},
   keywords = {applications, linguistics},
   pages = {467--501},
   crossref = {tplp05},
   doi = {10.1017/S1471068405002395},
   year = 2005,
   
   }
   




6. Christian Holzbaur, Marìa Garcìa de la Banda, Peter J. Stuckey, and Gregory J. Duck. Optimizing compilation of Constraint Handling Rules in HAL. In Slim Abdennadher, Thom Frühwirth, and Christian Holzbaur, editors, Special Issue on Constraint Handling Rules, volume 5(4–5) of Theory and Practice of Logic Programming, pages 503-531. Cambridge University Press, July 2005. [doi:10.1017/S1471068405002413] Keyword(s): implementation, optimizing compilation.
   

   @incollection{holz_garc_stuck_duck_opt_comp_chr_hal_tplp05,
   author = {Christian Holzbaur and Mar{\'i}a {Garc{\'i}a de la Banda} and Peter J. Stuckey and Gregory J. Duck},
   title = {Optimizing compilation of {C}onstraint {H}andling {R}ules in {HAL}},
   keywords = {implementation, optimizing compilation},
   pages = {503--531},
   crossref = {tplp05},
   doi = {10.1017/S1471068405002413},
   year = 2005,
   
   }
   




7. Michael Thielscher. FLUX: A Logic Programming Method for Reasoning Agents. In Slim Abdennadher, Thom Frühwirth, and Christian Holzbaur, editors, Special Issue on Constraint Handling Rules, volume 5(4–5) of Theory and Practice of Logic Programming, pages 533-565. Cambridge University Press, July 2005. [doi:10.1017/S1471068405002358] Keyword(s): FLUX.
   

   @incollection{thielscher_flux_tplp05,
   author = "Michael Thielscher",
   title = "{FLUX}: A Logic Programming Method for Reasoning Agents",
   keywords = {FLUX},
   pages = {533--565},
   crossref = {tplp05},
   doi = {10.1017/S1471068405002358},
   year = 2005,
   
   }
   




8. Armin Wolf. Intelligent search strategies based on adaptive Constraint Handling Rules. In Slim Abdennadher, Thom Frühwirth, and Christian Holzbaur, editors, Special Issue on Constraint Handling Rules, volume 5(4–5) of Theory and Practice of Logic Programming, pages 567-594. Cambridge University Press, July 2005. [doi:10.1017/S1471068405002383]
   

   @incollection{wolf_intelligent_search_tplp05,
   author = {Armin Wolf},
   title = {Intelligent search strategies based on adaptive {C}onstraint {H}andling {R}ules},
   pages = {567--594},
   crossref = {tplp05},
   doi = {10.1017/S1471068405002383},
   year = 2005,
   
   }
   

1. Marco Alberti, Federico Chesani, Marco Gavanelli, and Evelina Lamma. The CHR-based Implementation of a System for Generation and Confirmation of Hypotheses. In A. Wolf, Th. Frühwirth, and M. Meister, editors, W(C)LP '05: Proc. 19th Workshop on (Constraint) Logic Programming, volume 2005-01 of Ulmer Informatik-Berichte, pages 111-122, February 2005. [WWW]
   

   @inproceedings{alberti_et_al_sys_gen_conf_hypoth_wclp05,
   author = {Marco Alberti and Federico Chesani and Marco Gavanelli and Evelina Lamma},
   title = {The {CHR}-based Implementation of a System for Generation and Confirmation of Hypotheses},
   pages = {111--122},
   crossref = {pwclp05} 
   }
   




2. Hariolf Betz and Thom Frühwirth. A Linear-Logic Semantics for Constraint Handling Rules. In CP '05, volume 3709 of Lecture Notes in Computer Science, pages 137-151, October 2005. Springer-Verlag. Keyword(s): semantics, linear logic.
   

   @inproceedings{betz_fru_linear_logic_semantics_cp05,
   author = {Hariolf Betz and Thom Fr{\"u}hwirth},
   title = {A Linear-Logic Semantics for {C}onstraint {H}andling {R}ules},
   keywords = {semantics, linear logic},
   booktitle = CP05,
   location = {Sitges, Spain},
   city = {Sitges, Spain},
   pages = {137--151},
   series = LNCS,
   volume = 3709,
   month = oct,
   year = {2005},
   publisher = SV 
   }
   




3. Henning Christiansen. Experiences and directions for Abduction and Induction using Constraint Handling Rules. In AIAI '05: Proc. Intl. Workshop on the Integration of Abduction and Induction in Artificial Intelligence, July 2005. Note: Position Paper. Keyword(s): abduction.
   

   @inproceedings{christ_abduction_position_aiai05,
   author = {Henning Christiansen},
   title = {Experiences and directions for Abduction and Induction using {C}onstraint {H}andling {R}ules},
   keywords = {abduction},
   booktitle = {AIAI '05: Proc.\ Intl. Workshop on the Integration of Abduction and Induction in Artificial Intelligence},
   location = {Edinburgh, Scotland},
   city = {Edinburgh, Scotland},
   month =jul,
   year = 2005,
   note = {Position Paper},
   
   }
   




4. Henning Christiansen. Reasoning about passive declarations in CHR. In T. Schrijvers and Th. Frühwirth, editors, CHR '05: Proc. 2nd Workshop on Constraint Handling Rules, pages 93-108, 2005. K.U.Leuven, Department of Computer Science, Technical report CW 421. [POSTSCRIPT] Keyword(s): CHR 2005, optimizing compilation, CHR 2005, CHR 2005. Abstract:

   The programming language of Constraint Handling Rules (CHR) is gaining more and more popularity and this has motivated the development of new optimization techniques to be applied in implementations of CHR. As for other logic programming languages, a program written CHR can be understood declaratively as a logical formula and as a procedural specification, and CHR has different tools for manual optimization at the procedural level whose application may (or may not) sacrifice the declarative reading. One such optimization is given by passive declarations by means of which the search for rules to be applied can be optimized, perhaps changing which rules that are applied and in which order. A framework for analyzing the effect of passive declarations is presented in terms of a slightly abstract operational semantics which takes into account the effect of passive declarations. Based on it, we can give different classifications of the effect of some passive declarations that do not affect the logical semantics. This may be used for reasoning about manual optimizations as well as proposals for automatic strategies to be applied by a compiler for adding passive declarations.

   
   

   @inproceedings{christ_passive_reasoning_chr05,
   author = {Henning Christiansen},
   title = {Reasoning about passive declarations in {CHR}},
   pages = {93--108},
   crossref = {pchr05},
   abstract = { The programming language of Constraint Handling Rules (CHR) is gaining more and more popularity and this has motivated the development of new optimization techniques to be applied in implementations of CHR. As for other logic programming languages, a program written CHR can be understood declaratively as a logical formula and as a procedural specification, and CHR has different tools for manual optimization at the procedural level whose application may (or may not) sacrifice the declarative reading. One such optimization is given by passive declarations by means of which the search for rules to be applied can be optimized, perhaps changing which rules that are applied and in which order. A framework for analyzing the effect of passive declarations is presented in terms of a slightly abstract operational semantics which takes into account the effect of passive declarations. Based on it, we can give different classifications of the effect of some passive declarations that do not affect the logical semantics. This may be used for reasoning about manual optimizations as well as proposals for automatic strategies to be applied by a compiler for adding passive declarations. },
   keywords = {CHR 2005, optimizing compilation},
   ps = PAPERSHOME # {chr2005/christ_passive_reasoning_chr05.ps},
   
   }
   




5. Henning Christiansen and Verónica Dahl. HYPROLOG: A New Logic Programming Language with Assumptions and Abduction. In M. Gabbrielli and G. Gupta, editors, ICLP '05: Proc. 21st Intl. Conf. Logic Programming, volume 3668 of Lecture Notes in Computer Science, pages 159-173, October 2005. Springer-Verlag. Keyword(s): abduction.
   

   @inproceedings{christiansen_dahl_hyprolog_iclp05,
   author = {Henning Christiansen and Ver{\'o}nica Dahl},
   title = {{HYPROLOG}: A New Logic Programming Language with Assumptions and Abduction},
   keywords = {abduction},
   pages = {159--173},
   crossref = {piclp05} 
   }
   




6. Henning Christiansen and Verónica Dahl. Meaning in Context. In A. Dey, B. Kokinov, and R. Turner, editors, CONTEXT '05: Proc. 4th Intl. and Interdisciplinary Conf. Modeling and Using Context, volume 3554 of Lecture Notes in Artificial Intelligence, pages 97-111, 2005. Springer-Verlag.
   

   @inproceedings{christ_dahl_meaning_in_context_context05,
   title = {Meaning in Context},
   author = {Henning Christiansen and Ver{\'o}nica Dahl},
   booktitle = {CONTEXT '05: Proc.\ 4th Intl.\ and Interdisciplinary Conf.\ Modeling and Using Context},
   editor = {A. Dey and B. Kokinov and R. Turner},
   location = {Paris, France},
   city = {Paris, France},
   series = LNAI,
   volume = 3554,
   pages = {97--111},
   year = 2005,
   publisher = SV,
   
   }
   




7. Emmanuel Coquery and François Fages. A Type System for CHR. In T. Schrijvers and Th. Frühwirth, editors, CHR '05: Proc. 2nd Workshop on Constraint Handling Rules, pages 19-33, 2005. K.U.Leuven, Department of Computer Science, Technical report CW 421. [PDF] Keyword(s): CHR 2005, type systems, CHR 2005, CHR 2005. Abstract:

   We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension of a host language, such as Prolog or Java, this type system is parameterized by the type system of the host language. We show the consistency of the type system for CHR w.r.t. its operational semantics. We also study the case when the host language is a constraint logic programming language, typed with the prescriptive type system we developed in our previous work. In particular, we show the consistency of the resulting type system w.r.t. the extended execution model CLP+CHR. This system is implemented through an extension of our type checker TCLP for constraint logic languages. We report on experimental results about the type-checking of 12 CHR solvers and programs, including TCLP itself.

   
   

   @inproceedings{coquery_fages_type_system_chr05,
   author = {Emmanuel Coquery and Fran{\c{c}}ois Fages},
   title = {A Type System for {CHR}},
   pages = {19--33},
   crossref = {pchr05},
   abstract = { We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension of a host language, such as Prolog or Java, this type system is parameterized by the type system of the host language. We show the consistency of the type system for CHR w.r.t. its operational semantics. We also study the case when the host language is a constraint logic programming language, typed with the prescriptive type system we developed in our previous work. In particular, we show the consistency of the resulting type system w.r.t. the extended execution model CLP+CHR. This system is implemented through an extension of our type checker TCLP for constraint logic languages. We report on experimental results about the type-checking of 12 CHR solvers and programs, including TCLP itself. },
   keywords = {CHR 2005, type systems},
   pdf = PAPERSHOME # {chr2005/coquery_fages_type_system_chr05.pdf},
   
   }
   




8. Verónica Dahl and Philippe Blache. Extracting Selected Phrases through Constraint Satisfaction. In Proc. 2nd Intl. Workshop on Constraint Solving and Language Processing, October 2005.
   

   @inproceedings{dahl_blache_extracting_phrases_cslp05,
   title = {Extracting Selected Phrases through Constraint Satisfaction},
   author = {Dahl, Ver{\'o}nica and Blache, Philippe},
   booktitle = {Proc.\ 2nd Intl.\ Workshop on Constraint Solving and Language Processing},
   year = 2005,
   month = oct,
   location = {Sitges, Spain},
   city = {Sitges, Spain},
   
   }
   




9. Giorgio Delzanno, Maurizio Gabbrielli, and Maria Chiara Meo. A compositional semantics for CHR. In P. Barahona and A.P. Felty, editors, PPDP '05: Proc. 7th Intl. Conf. Princ. Pract. Declarative Programming, pages 209-217, July 2005. ACM Press. ISBN: 1-59593-090-6. Keyword(s): semantics.
   

   @inproceedings{delz_gab_meo_comp_sem_chr_ppdp05,
   author = {Giorgio Delzanno and Maurizio Gabbrielli and Maria Chiara Meo},
   title = {A compositional semantics for {CHR}},
   keywords = {semantics},
   pages = {209--217},
   crossref = {pppdp05} 
   }
   




10. Gregory J. Duck and Tom Schrijvers. Accurate Functional Dependency Analysis for Constraint Handling Rules. In T. Schrijvers and Th. Frühwirth, editors, CHR '05: Proc. 2nd Workshop on Constraint Handling Rules, pages 109-124, 2005. K.U.Leuven, Department of Computer Science, Technical report CW 421. [POSTSCRIPT] Keyword(s): CHR 2005, implementation, optimizing compilation, CHR 2005, CHR 2005. Abstract:

    Information about functional dependencies is used by modern CHR compilers for both optimisation and for further program analysis (e.g. confluence analysis). Before this work, CHR compilers relied on an ad hoc analysis for functional dependencies based on searching for rules of a particular form and the results from late storage analysis. We present a more formal functional dependency analysis of CHRs based on abstract interpretation. We show, by example, that the new analysis is more accurate than the existing ad hoc analysis.

    
    

    @inproceedings{duck_schr_accurate_funcdep_chr05,
    author = {Gregory J. Duck and Tom Schrijvers},
    title = {Accurate Functional Dependency Analysis for {C}onstraint {H}andling {R}ules},
    pages = {109--124},
    crossref = {pchr05},
    abstract = { Information about functional dependencies is used by modern CHR compilers for both optimisation and for further program analysis (e.g. confluence analysis). Before this work, CHR compilers relied on an ad hoc analysis for functional dependencies based on searching for rules of a particular form and the results from late storage analysis. We present a more formal functional dependency analysis of CHRs based on abstract interpretation. We show, by example, that the new analysis is more accurate than the existing ad hoc analysis. },
    keywords = {CHR 2005, implementation, optimizing compilation},
    ps = PAPERSHOME # {chr2005/duck_schr_accurate_funcdep_chr05.ps},
    
    }
    




11. Thom Frühwirth. Logical Rules for a Lexicographic Order Constraint Solver. In T. Schrijvers and Th. Frühwirth, editors, CHR '05: Proc. 2nd Workshop on Constraint Handling Rules, pages 79-91, 2005. K.U.Leuven, Department of Computer Science, Technical report CW 421. [POSTSCRIPT] Keyword(s): CHR 2005, CHR 2005, CHR 2005. Abstract:

    We give an executable specification of the global constraint of lexicographic order in Constraint Handling Rules (CHR) language. In contrast to previous approaches, the implementation is short and concise without giving up on linear time worst case time complexity. It is incremental and concurrent by nature of CHR. It is provably correct and confluent. It is independent of the underlying constraint system, and therefore not restricted to finite domains. We also show completeness of constraint propagation, i.e. that all possible consequences of the constraint are generated by the implementation. Our algorithm is encoded by three pairs of rules, two corresponding to base cases, two performing the obvious traversal of the sequences to be compared and two covering a not so obvious special case when the lexicographic constraint has a unique solution.

    
    

    @INPROCEEDINGS{fru_lexicographic_chr05,
    AUTHOR = {Thom Fr{\"u}hwirth},
    TITLE = {Logical Rules for a Lexicographic Order Constraint Solver},
    PAGES = {79--91},
    crossref = {pchr05},
    abstract = { We give an executable specification of the global constraint of lexicographic order in Constraint Handling Rules (CHR) language. In contrast to previous approaches, the implementation is short and concise without giving up on linear time worst case time complexity. It is incremental and concurrent by nature of CHR. It is provably correct and confluent. It is independent of the underlying constraint system, and therefore not restricted to finite domains. We also show completeness of constraint propagation, i.e. that all possible consequences of the constraint are generated by the implementation. Our algorithm is encoded by three pairs of rules, two corresponding to base cases, two performing the obvious traversal of the sequences to be compared and two covering a not so obvious special case when the lexicographic constraint has a unique solution. },
    keywords = {CHR 2005},
    ps = PAPERSHOME # {chr2005/fru_lexicographic_chr05.ps},
    
    }
    




12. Thom Frühwirth. Parallelizing Union-Find in Constraint Handling Rules Using Confluence. In M. Gabbrielli and G. Gupta, editors, ICLP '05: Proc. 21st Intl. Conf. Logic Programming, volume 3668 of Lecture Notes in Computer Science, pages 113-127, October 2005. Springer-Verlag. Keyword(s): confluence, algorithms, parallelism.
    

    @INPROCEEDINGS{fru_parallel_union_find_iclp05,
    AUTHOR = {Thom Fr{\"u}hwirth},
    TITLE = {Parallelizing Union-Find in {C}onstraint {H}andling {R}ules Using Confluence},
    PAGES = {113--127},
    keywords = {confluence, algorithms, parallelism},
    crossref = {piclp05} 
    }
    




13. Thom Frühwirth. Specialization of Concurrent Guarded Multi-Set Transformation Rules. In S. Etalle, editor, LOPSTR '04, volume 3573 of Lecture Notes in Computer Science, pages 133-148, 2005. Springer-Verlag. [PDF]
    

    @INPROCEEDINGS{fru_specialization_lopstr04,
    AUTHOR = {Thom Fr{\"u}hwirth},
    TITLE = {Specialization of Concurrent Guarded Multi-Set Transformation Rules},
    EDITOR = {Etalle, S.},
    BOOKTITLE = LOPSTR04,
    PUBLISHER = SV,
    SERIES = LNCS,
    VOLUME = 3573,
    YEAR = 2005,
    PAGES = {133--148},
    location = {Verona, Italy},
    city = {Verona, Italy},
    pdf = {http://www.informatik.uni-ulm.de/pm/mitarbeiter/fruehwirth/Papers/trans1.pdf},
    
    }
    




14. Luis Menezes, Jairson Vitorino, and Marcos Aurelio. A High Performance CHR^∨ Execution Engine. In T. Schrijvers and Th. Frühwirth, editors, CHR '05: Proc. 2nd Workshop on Constraint Handling Rules, pages 35-45, 2005. K.U.Leuven, Department of Computer Science, Technical report CW 421. [PDF] Keyword(s): CHR 2005, implementation, disjunction, CHR 2005, CHR 2005. Abstract:

    Constraint Handling Rules with disjunction is a high-level language for writing constraint solvers either from scratch or by modifying existing solvers. In this work we present a proposal for a new rule execution strategy of CHR_ taking advantage of data structures more adequate to treat disjunctions within rules. We then compare this new approach with existing CHR_ implementations.

    
    

    @inproceedings{menezes_vitorino_aurelio_high_performance_chr_or_chr05,
    author = {Luis Menezes and Jairson Vitorino and Marcos Aurelio},
    title = {A High Performance {CHR}${}^\lor$ Execution Engine},
    pages = {35--45},
    crossref = {pchr05},
    abstract = { Constraint Handling Rules with disjunction is a high-level language for writing constraint solvers either from scratch or by modifying existing solvers. In this work we present a proposal for a new rule execution strategy of CHR_ taking advantage of data structures more adequate to treat disjunctions within rules. We then compare this new approach with existing CHR_ implementations. },
    keywords = {CHR 2005, implementation, disjunction},
    pdf = PAPERSHOME # {chr2005/menezes_vitorino_aurelio_high_performance_chr_or_chr05.pdf},
    
    }
    




15. Tom Schrijvers and Thom Frühwirth. Analysing the CHR Implementation of Union-Find. In A. Wolf, Th. Frühwirth, and M. Meister, editors, W(C)LP '05: Proc. 19th Workshop on (Constraint) Logic Programming, volume 2005-01 of Ulmer Informatik-Berichte, pages 135-146, February 2005. [WWW] Keyword(s): algorithms, complexity.
    

    @inproceedings{schr_fru_analysing_union_find_wclp05,
    author = {Tom Schrijvers and Thom Fr{\"u}hwirth},
    title = {Analysing the {CHR} Implementation of Union-Find},
    keywords = {algorithms, complexity},
    pages = {135--146},
    crossref = {pwclp05} 
    }
    




16. Tom Schrijvers, Peter J. Stuckey, and Gregory J. Duck. Abstract interpretation for Constraint Handling Rules. In P. Barahona and A.P. Felty, editors, PPDP '05: Proc. 7th Intl. Conf. Princ. Pract. Declarative Programming, pages 218-229, July 2005. ACM Press. ISBN: 1-59593-090-6. Keyword(s): optimizing compilation.
    

    @inproceedings{schr_stuck_duck_ai_chr_ppdp05,
    author = {Tom Schrijvers and Peter J. Stuckey and Gregory J. Duck},
    title = {Abstract interpretation for {C}onstraint {H}andling {R}ules},
    keywords = {optimizing compilation},
    pages = {218--229},
    crossref = {pppdp05} 
    }
    




17. Tom Schrijvers, Jan Wielemaker, and Bart Demoen. Poster: Constraint Handling Rules for SWI-Prolog. In A. Wolf, Th. Frühwirth, and M. Meister, editors, W(C)LP '05: Proc. 19th Workshop on (Constraint) Logic Programming, volume 2005-01 of Ulmer Informatik-Berichte, February 2005. [WWW]
    

    @inproceedings{schr_wielemaker_demoen_chr_swi_wclp05,
    author = "Schrijvers, Tom and Wielemaker, Jan and Demoen, Bart",
    TITLE = {{P}oster: {C}onstraint {H}andling {R}ules for {SWI}-{P}rolog},
    crossref = {pwclp05} 
    }
    




18. Jon Sneyers, Tom Schrijvers, and Bart Demoen. Guard and Continuation Optimization for Occurrence Representations of CHR. In M. Gabbrielli and G. Gupta, editors, ICLP '05: Proc. 21st Intl. Conf. Logic Programming, volume 3668 of Lecture Notes in Computer Science, pages 83-97, October 2005. Springer-Verlag. Keyword(s): implementation, optimizing compilation.
    

    @inproceedings{sney_schr_demoen_guard_and_continuation_opt_iclp05,
    author = {Jon Sneyers and Tom Schrijvers and Bart Demoen},
    title = {Guard and Continuation Optimization for Occurrence Representations of {CHR}},
    keywords = {implementation, optimizing compilation},
    pages = {83--97},
    crossref = {piclp05} 
    }
    




19. Jon Sneyers, Tom Schrijvers, and Bart Demoen. The Computational Power and Complexity of Constraint Handling Rules. In T. Schrijvers and Th. Frühwirth, editors, CHR '05: Proc. 2nd Workshop on Constraint Handling Rules, pages 3-17, 2005. K.U.Leuven, Department of Computer Science, Technical report CW 421. [POSTSCRIPT] Keyword(s): CHR 2005, computability, complexity, CHR 2005, CHR 2005. Abstract:

    We introduce the CHR machine, a model of computation based on the Constraint Handling Rules programming language. Its computational power and time complexity properties are compared with those of the Turing machine and Random Access Memory machine. Our major result is the proof that every algorithm can be implemented in CHR with the best known time and space complexity.

    
    

    @inproceedings{sney_schr_demoen_chr_complexity_chr05,
    author = {Jon Sneyers and Tom Schrijvers and Bart Demoen},
    title = {The Computational Power and Complexity of {C}onstraint {H}andling {R}ules},
    pages = {3--17},
    crossref = {pchr05},
    abstract = { We introduce the CHR machine, a model of computation based on the Constraint Handling Rules programming language. Its computational power and time complexity properties are compared with those of the Turing machine and Random Access Memory machine. Our major result is the proof that every algorithm can be implemented in CHR with the best known time and space complexity. },
    keywords = {CHR 2005, computability, complexity},
    ps = PAPERSHOME # {chr2005/sney_schr_demoen_chr_complexity_chr05.ps},
    
    }
    




20. Martin Sulzmann. Chameleon: Systematic Type System Design via Constraint Handling Rules. In T. Schrijvers and Th. Frühwirth, editors, CHR '05: Proc. 2nd Workshop on Constraint Handling Rules, pages 1, 2005. K.U.Leuven, Department of Computer Science, Technical report CW 421. Note: Invited talk. Keyword(s): type systems, CHR 2005, CHR 2005.
    

    @inproceedings{sulz_chameleon_chr05,
    author = {Martin Sulzmann},
    title = {Chameleon: Systematic Type System Design via {C}onstraint {H}andling {R}ules},
    pages = {1},
    note = {Invited talk},
    keywords = {type systems},
    crossref = {pchr05} 
    }
    




21. Martin Sulzmann, Jeremy Wazny, and Peter J. Stuckey. Constraint Abduction and Constraint Handling Rules. In T. Schrijvers and Th. Frühwirth, editors, CHR '05: Proc. 2nd Workshop on Constraint Handling Rules, pages 63-78, 2005. K.U.Leuven, Department of Computer Science, Technical report CW 421. [POSTSCRIPT] Keyword(s): CHR 2005, abduction, CHR 2005, CHR 2005. Abstract:

    Type inference for advanced type extensions demands constraints consisting of implications, universal quantifiers etc. Hence, the current CHR solving which rewrites sets of primitive constraints is not applicable. We define an extension of the CHR solving mechanism which incorporates abductive reasoning to solve implication constraints. We state some fundamental results such as soundness and under some sufficient conditions completeness and termination. We have implemented a prototype solver as part of the Chameleon system. Our results allows us to advance the state of art in constraint solving and achieve inference for expressive type extensions.

    
    

    @inproceedings{sulz_wazny_stuck_abduction_chr05,
    author = {Martin Sulzmann and Jeremy Wazny and Peter J. Stuckey},
    title = {Constraint Abduction and {C}onstraint {H}andling {R}ules},
    crossref = {pchr05},
    pages = {63--78},
    abstract = { Type inference for advanced type extensions demands constraints consisting of implications, universal quantifiers etc. Hence, the current CHR solving which rewrites sets of primitive constraints is not applicable. We define an extension of the CHR solving mechanism which incorporates abductive reasoning to solve implication constraints. We state some fundamental results such as soundness and under some sufficient conditions completeness and termination. We have implemented a prototype solver as part of the Chameleon system. Our results allows us to advance the state of art in constraint solving and achieve inference for expressive type extensions. },
    keywords = {CHR 2005, abduction},
    ps = PAPERSHOME # {chr2005/sulz_wazny_stuck_abduction_chr05.ps},
    
    }
    




22. Peter Thiemann. Grammar-based analysis of string expressions. In TLDI '05: Proc. 2005 ACM SIGPLAN Intl. workshop on Types in Languages Design and Implementation, New York, NY, USA, pages 59-70, 2005. ACM. ISBN: 1-58113-999-3. [doi:10.1145/1040294.1040300]
    

    @inproceedings{thiemann_grammar_string_exprs_tldi05,
    author = {Thiemann, Peter},
    title = {Grammar-based analysis of string expressions},
    booktitle = {TLDI '05: Proc.\ 2005 ACM SIGPLAN Intl.\ workshop on Types in Languages Design and Implementation},
    year = {2005},
    isbn = {1-58113-999-3},
    pages = {59--70},
    location = {Long Beach, California, USA},
    city = {Long Beach, California, USA},
    doi = {10.1145/1040294.1040300},
    publisher = {ACM},
    address = {New York, NY, USA},
    
    }
    




23. Peter Van Weert, Tom Schrijvers, and Bart Demoen. K.U.Leuven JCHR: a user-friendly, flexible and efficient CHR system for Java. In T. Schrijvers and Th. Frühwirth, editors, CHR '05: Proc. 2nd Workshop on Constraint Handling Rules, pages 47-62, 2005. K.U.Leuven, Department of Computer Science, Technical report CW 421. [WWW] [PDF] Keyword(s): CHR 2005, Java, implementation, CHR 2005, CHR 2005. Abstract:

    A new integration of Constraint Handling Rules (CHR) and Java is presented: the K.U.Leuven JCHR system. It was designed with three aims in mind: user-friendliness, exibility and efficiency. User-friendliness is achieved by providing a high-level syntax that feels familiar to both Java programmers and users of other CHR embeddings, and by full compliance to the refined operational semantics. Flexibility is the result of a well thought-out design, allowing e.g. an easy integration of built-in constraint solvers and variable types. Efficiency is achieved through an optimized compilation to Java and the use of a very efficient constraint store. The design of the K.U.Leuven JCHR system is presented, its implementation discussed and its performance is compared with other CHR systems embedded in Java and Prolog.

    
    

    @inproceedings{vanweert_schr_demoen_jchr_chr05,
    author = {Van Weert, Peter and Tom Schrijvers and Bart Demoen},
    title = {{K.U.Leuven JCHR}: a user-friendly, flexible and efficient {CHR} system for {Java}},
    pages = {47--62},
    crossref = {pchr05},
    url = {http://people.cs.kuleuven.be/~peter.vanweert/JCHR/},
    abstract = { A new integration of Constraint Handling Rules (CHR) and Java is presented: the K.U.Leuven JCHR system. It was designed with three aims in mind: user-friendliness, exibility and efficiency. User-friendliness is achieved by providing a high-level syntax that feels familiar to both Java programmers and users of other CHR embeddings, and by full compliance to the refined operational semantics. Flexibility is the result of a well thought-out design, allowing e.g. an easy integration of built-in constraint solvers and variable types. Efficiency is achieved through an optimized compilation to Java and the use of a very efficient constraint store. The design of the K.U.Leuven JCHR system is presented, its implementation discussed and its performance is compared with other CHR systems embedded in Java and Prolog. },
    keywords = {CHR 2005, Java, implementation},
    pdf = PAPERSHOME # {chr2005/vanweert_schr_demoen_jchr_chr05.pdf},
    
    }
    

1. Olivier Bouissou. A CHR library for SiLCC. Diplomarbeit, Technical University of Berlin, Germany, January 2005.
   

   @mastersthesis{bouissou_chr_for_silcc_2005,
   author = {Olivier Bouissou},
   title = {A {CHR} library for {SiLCC}},
   school = {Technical University of Berlin},
   address = {Germany},
   year = 2005,
   month = jan,
   type = {Diplomarbeit},
   
   }
   

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

The contents of this webpage is provided by the authors stated below. KU Leuven is not bound by the information provided. It is possible that the information is not or no longer completely accurate. Where necessary, the authors can adjust and update faulty information. The authors have taken all reasonable care to ensure that all information available on this website is accurate at the time of publication and on the basis of the current state of knowledge. KU Leuven nor the authors are responsible for the content of any links to external organisations that are referred to on this website.

• Peter Van Weert [home, mail]
• Jon Sneyers [home, mail]
• Tom Schrijvers [home, mail]
• Leslie De Koninck

This document was translated from BibT_EX by bibtex2html