1. Thom Frühwirth and Frank Raiser, editors. Constraint Handling Rules: Compilation, Execution, and Analysis. March 2011. ISBN: 978-3-83-911591-6. Keyword(s): implementation, complexity, optimizing compilation, parallelism, priorities.
   

   @book{chr_book_2011,
   editor = {Thom Fr{\"u}hwirth and Frank Raiser},
   title = {Constraint Handling Rules: Compilation, Execution, and Analysis},
   month = {March},
   year = {2011},
   isbn = {978-3-83-911591-6},
   keywords = {implementation, complexity, optimizing compilation, parallelism, priorities} 
   }
   




2. John Gallagher and Michael Gelfond, editors. ICLP '11: Proc. 27th Intl. Conf. Logic Programming, volume 11(4–5) of Theory and Practice of Logic Programming. Cambridge University Press, July 2011.
   

   @book{piclp11,
   title = ICLP11l,
   year = 2011,
   month = jul,
   location = {Lexington, Kentucky, USA},
   city = {Lexington, Kentucky, USA},
   editor = {John Gallagher and Michael Gelfond},
   series = TPLP,
   volume = {11(4--5)},
   publisher = CUP,
   
   }
   




3. John Gallagher and Michael Gelfond, editors. Technical Communications of the 27th Intl. Conf. on Logic Programming, volume 11 of Leibniz Intl. Proc. in Informatics (LIPIcs), Dagstuhl, Germany, July 2011. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
   

   @proceedings{tciclp11,
   title = {Technical Communications of the 27th Intl. Conf. on Logic Programming},
   booktitle = {Technical Communications of the 27th Intl. Conf. on Logic Programming},
   series ={Leibniz Intl. Proc. in Informatics (LIPIcs)},
   year = 2011,
   month = jul,
   volume = 11,
   editor = {John Gallagher and Michael Gelfond},
   publisher ={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
   address = {Dagstuhl, Germany},
   location = {Lexington, Kentucky, USA},
   city = {Lexington, Kentucky, USA},
   
   }
   




4. Michael Hanus, editor. PPDP '11: Proc. 13th Intl. Conf. Princ. Pract. Declarative Programming, July 2011. ACM Press.
   

   @proceedings{pppdp11,
   title = PPDP11l,
   booktitle = PPDP11,
   editor = {Michael Hanus},
   publisher = ACM,
   year = 2011,
   month = jul,
   location = {Odense, Denmark},
   city = {Odense, Denmark},
   
   }
   




5. Jon Sneyers, editor. CHR '11: Proc. 8th Workshop on Constraint Handling Rules, September 2011. GUC, Technical report. [PDF] Keyword(s): CHR 2011.
   

   @proceedings{pchr11,
   title = CHR11l,
   booktitle = CHR11,
   year = {2011},
   month = sep,
   location = {Cairo, Egypt},
   city = {Cairo, Egypt},
   editor = {Jon Sneyers},
   publisher = {GUC, Technical report},
   pdf = PAPERSHOME # {chr2011/CHR_2011_proceedings.pdf},
   keywords = {CHR 2011},
   
   }
   




6. German Vidal, editor. LOPSTR '11: 21st Intl. Symp. Logic-Based Program Synthesis and Transformation, Pre-Proceedings, 2011.
   

   @proceedings{plopstr11pre,
   title = LOPSTR11prel,
   booktitle = LOPSTR11pre,
   year = 2011,
   location = {Odense, Denmark},
   city = {Odense, Denmark},
   editor = {German Vidal},
   
   }
   




7. German Vidal, editor. LOPSTR '11: 21st Intl. Symp. Logic-Based Program Synthesis and Transformation, Revised Selected Papers, Lecture Notes in Computer Science, 2011.
   

   @proceedings{plopstr11,
   title = LOPSTR11l,
   booktitle = LOPSTR11,
   year = 2011,
   location = {Odense, Denmark},
   city = {Odense, Denmark},
   editor = {German Vidal},
   series = LNCS,
   
   }
   

1. Edmund Soon Lee Lam. Parallel execution of Constraint Handling Rules – Theory, Implementation and Application. PhD thesis, School of Computing, Department of Computing Science, National University of Singapore, 2011. Keyword(s): parallelism, implementation.
   

   @phdthesis{lam_parallel_chr_11,
   title = {Parallel execution of Constraint Handling Rules -- Theory, Implementation and Application},
   author = {Edmund Soon Lee Lam},
   school = {School of Computing, Department of Computing Science, National University of Singapore},
   year = {2011},
   keywords = {parallelism,implementation} 
   }
   

1. Marco Alberti, Marco Gavanelli, Evelina Lamma, Fabrizio Riguzzi, and Sergio Storari. Learning specifications of interaction protocols and business processes and proving their properties. Intelligenza artificiale, 5(1):71-75, February 2011. ISSN: 1724-8035. [PDF] [doi:10.3233/IA-2011-0006] Abstract:

   In this paper, we overview our recent research activity concerning the induction of Logic Programming specifications, and the proof of their properties via Abductive Logic Programming. Both the inductive and abductive tools here briefly described have been applied to respectively learn and verify (properties of) interaction protocols in multi-agent systems, Web service choreographies, careflows and business processes.

   
   

   @article{AlbGavLam10-IA-IJ,
   author = {Marco Alberti and Marco Gavanelli and Evelina Lamma and Fabrizio Riguzzi and Sergio Storari},
   title = {Learning specifications of interaction protocols and business processes and proving their properties},
   journal = {Intelligenza artificiale},
   year = 2011,
   volume = 5,
   number = 1,
   pages = {71--75},
   month = feb,
   doi = {10.3233/IA-2011-0006},
   issn = {1724-8035},
   abstract = {In this paper, we overview our recent research activity concerning the induction of Logic Programming specifications, and the proof of their properties via Abductive Logic Programming. Both the inductive and abductive tools here briefly described have been applied to respectively learn and verify (properties of) interaction protocols in multi-agent systems, Web service choreographies, careflows and business processes.},
   pdf = {http://www.ing.unife.it/docenti/FabrizioRiguzzi/Papers/AlbGavLam-IA08.pdf} 
   }
   




2. A.M. Cheadle, W. Harvey, A.J. Sadler, J. Schimpf, K. Shen, and M.G. Wallace. ECLⁱPS^e: A Tutorial Introduction. 2011. Keyword(s): tutorial.
   

   @article{cheadle2011tutorial,
   title={{ECL$^i$PS$^e$}: A Tutorial Introduction},
   author={Cheadle, A.M. and Harvey, W. and Sadler, A.J. and Schimpf, J. and Shen, K. and Wallace, M.G.},
   year={2011},
   publisher={Technical Report, Imperial college London},
   keywords={tutorial} 
   }
   




3. János Csorba, Zsolt Zombori, and Péter Szeredi. Using Constraint Handling Rules to Provide Static Type Analysis for the Q Functional Language. CoRR, abs/1112.3784, 2011.
   

   @article{DBLP:journals/corr/abs-1112-3784,
   author = {J{\'a}nos Csorba and Zsolt Zombori and P{\'e}ter Szeredi},
   title = {Using Constraint Handling Rules to Provide Static Type Analysis for the {Q} Functional Language},
   journal = {CoRR},
   volume = {abs/1112.3784},
   year = {2011},
   ee = {http://arxiv.org/abs/1112.3784},
   
   }
   




4. Gregory J. Duck, Joxan Jaffar, and Nicolas Koh. A Symbolic Execution Framework with Explicit Heaps and Separation. 2011.
   

   @article{ id9,
   author = {Gregory J. Duck and Joxan Jaffar and Nicolas Koh},
   title = {A Symbolic Execution Framework with Explicit Heaps and Separation},
   journal = {},
   year = {2011},
   
   }
   




5. Andrea Triossi. Hardware Execution of Constraint Handling Rules. PhD Thesis, 2011.
   

   @article{ triossi_phd11,
   author = {Andrea Triossi},
   title = {Hardware Execution of Constraint Handling Rules},
   journal = {PhD Thesis},
   year = {2011},
   
   }
   




6. Veronica Dahl. Informing Datalog through Language Intelligence - A Personal Perspective. In Oege de Moor, Georg Gottlob, Tim Furche, and Andrew Sellers, editors, Datalog Reloaded, volume 6702 of Lecture Notes in Computer Science, pages 161-180. Springer Berlin / Heidelberg, 2011. ISBN: 978-3-642-24205-2. [WWW] Keyword(s): linguistics.
   

   @incollection{ dahl_informing_datalog_2011,
   author = {Veronica Dahl},
   title = {Informing Datalog through Language Intelligence - A Personal Perspective},
   booktitle = {Datalog Reloaded},
   series = {Lecture Notes in Computer Science},
   editor = {de Moor, Oege and Gottlob, Georg and Furche, Tim and Sellers, Andrew},
   publisher = {Springer Berlin / Heidelberg},
   isbn = {978-3-642-24205-2},
   keyword = {linguistics},
   pages = {161-180},
   volume = {6702},
   url = {http://dx.doi.org/10.1007/978-3-642-24206-9_10},
   year = {2011} 
   }
   




7. Veronica Dahl, Baohua Gu, and Erez Maharask. In Gemma Bel-Enguix and M. Dolores Jimenez-Lopez, editors, Bio-Inspired Models for Natural and Formal Languages, pages 205ff. Cambridge Scholars Publishing, April 2011.
   

   @incollection{ title = {Modeling Concepts and Relations through Property Grammars},
   author = {Veronica Dahl and Baohua Gu and Erez Maharask},
   booktitle = {Bio-Inspired Models for Natural and Formal Languages},
   year = {2011},
   month = {April},
   publisher = {Cambridge Scholars Publishing},
   editor = {Gemma Bel-Enguix and M. Dolores Jimenez-Lopez},
   pages = {205ff} 
   }
   




8. Veronica Dahl and Erez Maharask. In Gemma Bel-Enguix and M. Dolores Jimenez-Lopez, editors, Bio-Inspired Models for Natural and Formal Languages, pages 259ff. Cambridge Scholars Publishing, April 2011.
   

   @incollection{ title = {Synalysis - a Dual Processing Scheme for Both Human and Biological Languages},
   author = {Veronica Dahl and Erez Maharask},
   booktitle = {Bio-Inspired Models for Natural and Formal Languages},
   year = {2011},
   month = {April},
   publisher = {Cambridge Scholars Publishing},
   editor = {Gemma Bel-Enguix and M. Dolores Jimenez-Lopez},
   pages = {259ff} 
   }
   




9. Rémy Haemmerlé. (Co-)Inductive semantics for Constraint Handling Rules. In John Gallagher and Michael Gelfond, editors, ICLP '11: Proc. 27th Intl. Conf. Logic Programming, volume 11(4–5) of Theory and Practice of Logic Programming, pages 593-609. Cambridge University Press, July 2011. [doi:10.1017/S1471068411000196] Keyword(s): semantics, termination. Abstract:

   In this paper, we address the problem of defining a fixpoint semantics for Constraint Handling Rules (CHR) that captures the behavior of both simplification and propagation rules in a sound and complete way with respect to their declarative semantics. Firstly, we show that the logical reading of states with respect to a set of simplification rules can be characterized by a least fixpoint over the transition system generated by the abstract operational semantics of CHR. Similarly, we demonstrate that the logical reading of states with respect to a set of propagation rules can be characterized by a greatest fixpoint. Then, in order to take advantage of both types of rules without losing fixpoint characterization, we present an operational semantics with persistent. We finally establish that this semantics can be characterized by two nested fixpoints, and we show the resulting language is an elegant framework to program using coinductive reasoning

   
   

   @incollection{haemmerle2011coinductive,
   author = {R{\'e}my Haemmerl{\'e}},
   title = {({C}o-){I}nductive semantics for {C}onstraint {H}andling {R}ules},
   keywords = {semantics,termination},
   year = 2011,
   crossref = {piclp11},
   pages = {593-609},
   doi = {10.1017/S1471068411000196},
   abstract = {In this paper, we address the problem of defining a fixpoint semantics for Constraint Handling Rules (CHR) that captures the behavior of both simplification and propagation rules in a sound and complete way with respect to their declarative semantics. Firstly, we show that the logical reading of states with respect to a set of simplification rules can be characterized by a least fixpoint over the transition system generated by the abstract operational semantics of CHR. Similarly, we demonstrate that the logical reading of states with respect to a set of propagation rules can be characterized by a greatest fixpoint. Then, in order to take advantage of both types of rules without losing fixpoint characterization, we present an operational semantics with persistent. We finally establish that this semantics can be characterized by two nested fixpoints, and we show the resulting language is an elegant framework to program using coinductive reasoning},
   
   }
   




10. Rémy Haemmerlé. Observational equivalences for linear logic concurrent constraint languages. In John Gallagher and Michael Gelfond, editors, ICLP '11: Proc. 27th Intl. Conf. Logic Programming, volume 11(4–5) of Theory and Practice of Logic Programming, pages 469-485. Cambridge University Press, July 2011. [doi:10.1017/S1471068411000123] Keyword(s): linear logic, semantics, confluence, related formalisms. Abstract:

    Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC), where the constraint system is based on Girard's linear logic instead of the classical logic. In this paper, we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition system and investigate different notions of observational equivalences inspired by the state of art of process algebras. Then, we demonstrate that the asynchronous π-calculus can be viewed as simple syntactical restrictions of LCC. Finally, we show that LCC observational equivalences can be transposed straightforwardly to classical Concurrent Constraint languages and Constraint Handling Rules, and investigate the resulting equivalences.

    
    

    @incollection{haemmerle2011equivalence,
    author = {R{\'e}my Haemmerl{\'e}},
    title = {Observational equivalences for linear logic concurrent constraint languages},
    keywords = {linear logic, semantics, confluence, related formalisms},
    year = 2011,
    crossref = {piclp11},
    pages = {469-485},
    doi = {10.1017/S1471068411000123},
    abstract = {Linear logic Concurrent Constraint programming (LCC) is an extension of concurrent constraint programming (CC), where the constraint system is based on Girard's linear logic instead of the classical logic. In this paper, we address the problem of program equivalence for this programming framework. For this purpose, we present a structural operational semantics for LCC based on a label transition system and investigate different notions of observational equivalences inspired by the state of art of process algebras. Then, we demonstrate that the asynchronous π-calculus can be viewed as simple syntactical restrictions of LCC. Finally, we show that LCC observational equivalences can be transposed straightforwardly to classical Concurrent Constraint languages and Constraint Handling Rules, and investigate the resulting equivalences.},
    
    }
    

1. Marco Alberti, Marco Gavanelli, and Evelina Lamma. The CHR-based Implementation of the SCIFF Abductive System. In Proc. 26th CILC: 26-esimo Convegno Italiano di Logica Computazionale, August-September 2011.
   

   @inproceedings{alberti_sciff_chr_cilc11,
   title = {The {CHR}-based Implementation of the {SCIFF} Abductive System},
   author = {Marco Alberti and Marco Gavanelli and Evelina Lamma},
   booktitle = {Proc. 26th CILC: 26-esimo Convegno Italiano di Logica Computazionale},
   month = {August-September},
   year = {2011},
   location = {Pescara, Italy} 
   }
   




2. J. Cheney. Satisfiability algorithms for conjunctive queries over trees. In Proceedings of the 14th International Conference on Database Theory, pages 150-161, 2011. ACM.
   

   @inproceedings{cheney2011satisfiability,
   title={Satisfiability algorithms for conjunctive queries over trees},
   author={Cheney, J.},
   booktitle={Proceedings of the 14th International Conference on Database Theory},
   pages={150--161},
   year={2011},
   organization={ACM} 
   }
   




3. Henning Christiansen and Amr Hany Saleh. Modeling Dependent Events with CHRiSM for Probabilistic Abduction. In Jon Sneyers, editor, CHR '11: Proc. 8th Workshop on Constraint Handling Rules, pages 48-63, September 2011. GUC, Technical report. [PDF] Keyword(s): abduction, probabilistic CHR, CHRiSM, CHR 2011, CHR 2011. Abstract:

   Most earlier approaches to probabilistic abductive logic programming are based on the assumption that abducibles represent independent events. This enables eient and incremental calculation of probabilities, but may not be suitable for all real world problems. As an attempt to introduce such dependencies in a logic programming setting, we have applied CHRiSM, which is a recent probabilistic extension to Constraint Handling Rules, for specication and evaluation of probability distributions over dependent abducibles. It is shown that this principle integrates well with earlier work on probabilistic abduction based on CHR, generalizing it to handle such dependencies. We present our rst experiments with a working implementation that show the potential for interesting applications. On the other hand, our experience underlines problems concerning high complexity due to lacking incremental methods for probability calculation.

   
   

   @inproceedings{christiansen_saleh_dependent_events_chr11,
   author = {Henning Christiansen and Amr Hany Saleh},
   title = {Modeling Dependent Events with CHRiSM for Probabilistic Abduction},
   crossref = {pchr11},
   pages={48--63},
   abstract = { Most earlier approaches to probabilistic abductive logic programming are based on the assumption that abducibles represent independent events. This enables eient and incremental calculation of probabilities, but may not be suitable for all real world problems. As an attempt to introduce such dependencies in a logic programming setting, we have applied CHRiSM, which is a recent probabilistic extension to Constraint Handling Rules, for specication and evaluation of probability distributions over dependent abducibles. It is shown that this principle integrates well with earlier work on probabilistic abduction based on CHR, generalizing it to handle such dependencies. We present our rst experiments with a working implementation that show the potential for interesting applications. On the other hand, our experience underlines problems concerning high complexity due to lacking incremental methods for probability calculation. },
   keywords = {abduction, probabilistic CHR, CHRiSM},
   pdf = PAPERSHOME # {chr2011/05-Christiansen_Saleh-chr11.pdf},
   
   }
   




4. Verónica Dahl. CHR for Spoken and other Biological Languages. In Jon Sneyers, editor, CHR '11: Proc. 8th Workshop on Constraint Handling Rules, pages 4-18, September 2011. GUC, Technical report. Note: Invited talk. [PDF] Keyword(s): abduction, linguistics, applications, CHR 2011, CHR 2011. Abstract:

   CHR is now well established as an invaluable tool for computing and other formal science applications. Much less studied is their use in the humanistic sciences. In this article we bring together our personal view on applying Constraint Reasoning as embodied in CHR to joining the humanistic with the formal sciences, through the link of language understood in a broad sense as including both spoken languages and molecular biology languages. and we try to distill from these heterogeneous enterprises some common threads that can possibly lead to an embryonic model of humanistic investigation through CHR. The applications we cover include such themes as a dual processing scheme for both human and biological languages; decoding nucleic acid strings through human language; DNA replication as a model for computational linguistics; multi-disciplinary biological knowledge representation for early cancer diagnosis; RNA-inspired analysis of poetry; parsing medical text into de-identied databases; and biological concept-formation.

   
   

   @inproceedings{dahl_languages_chr11,
   author = {Ver{\'o}nica Dahl},
   title = {CHR for Spoken and other Biological Languages},
   crossref = {pchr11},
   note = {Invited talk},
   pages={4--18},
   abstract = { CHR is now well established as an invaluable tool for computing and other formal science applications. Much less studied is their use in the humanistic sciences. In this article we bring together our personal view on applying Constraint Reasoning as embodied in CHR to joining the humanistic with the formal sciences, through the link of language understood in a broad sense as including both spoken languages and molecular biology languages. and we try to distill from these heterogeneous enterprises some common threads that can possibly lead to an embryonic model of humanistic investigation through CHR. The applications we cover include such themes as a dual processing scheme for both human and biological languages; decoding nucleic acid strings through human language; DNA replication as a model for computational linguistics; multi-disciplinary biological knowledge representation for early cancer diagnosis; RNA-inspired analysis of poetry; parsing medical text into de-identied databases; and biological concept-formation. },
   keywords = {abduction, linguistics, applications},
   pdf = PAPERSHOME # {chr2011/02-Dahl-chr11.pdf},
   
   }
   




5. Marcel Dausend and Frank Raiser. Model Transformation using Constraint Handling Rules as a basis for Model Interpretation. In Jon Sneyers, editor, CHR '11: Proc. 8th Workshop on Constraint Handling Rules, pages 64-78, September 2011. GUC, Technical report. [PDF] Keyword(s): applications, CHR 2011, CHR 2011. Abstract:

   In this paper, we present a model transformation approach aiming to simplify automatic processing of UML state machine models, especially for interpretation. The main requirements are easing the implementation of the interpreter and reducing the number of calculations necessary to execute a model. Our model transformation preserves the semantics and is implemented using CHR. The result of the transformation is an UML state machine model based on the concept of compound transitions. Furthermore we provide an interpreter for those models which supports a comprehensive subset of UML state machine concepts, i. a. junction, fork, join. Our preliminary results show that state machine interpreters can prot from the former model transformation. It simplies certain aspects of the interpreter implementation and positively aects the performance of the interpreter, e.g. regarding transition selection and transition execution.

   
   

   @inproceedings{dausend_raiser_model_transformation_chr11,
   author = {Marcel Dausend and Frank Raiser},
   title = {Model Transformation using Constraint Handling Rules as a basis for Model Interpretation},
   crossref = {pchr11},
   pages={64--78},
   abstract = { In this paper, we present a model transformation approach aiming to simplify automatic processing of UML state machine models, especially for interpretation. The main requirements are easing the implementation of the interpreter and reducing the number of calculations necessary to execute a model. Our model transformation preserves the semantics and is implemented using CHR. The result of the transformation is an UML state machine model based on the concept of compound transitions. Furthermore we provide an interpreter for those models which supports a comprehensive subset of UML state machine concepts, i. a. junction, fork, join. Our preliminary results show that state machine interpreters can prot from the former model transformation. It simplies certain aspects of the interpreter implementation and positively aects the performance of the interpreter, e.g. regarding transition selection and transition execution. },
   keywords = {applications},
   pdf = PAPERSHOME # {chr2011/06-Dausend_Raiser-chr11.pdf},
   
   }
   




6. Krishna S. R. Dubba, Mehul Bhatt, Frank Dylla, David C. Hogg, and Anthony G. Cohn. Interleaved Inductive-Abductive Reasoning for Learning Complex Event Models. In Stephen Muggleton, Alireza Tamaddoni-Nezhad, and Francesca A. Lisi, editors, ILP, volume 7207 of Lecture Notes in Computer Science, pages 113-129, 2011. Springer. ISBN: 978-3-642-31950-1.
   

   @inproceedings{DBLP:conf/ilp/DubbaBDHC12,
   author = {Krishna S. R. Dubba and Mehul Bhatt and Frank Dylla and David C. Hogg and Anthony G. Cohn},
   title = {Interleaved Inductive-Abductive Reasoning for Learning Complex Event Models},
   booktitle = {ILP},
   year = {2011},
   pages = {113-129},
   ee = {http://dx.doi.org/10.1007/978-3-642-31951-8_14},
   crossref = {DBLP:conf/ilp/2011},
   bibsource = {DBLP, http://dblp.uni-trier.de} 
   }
   




7. Armando Gonçalves, Marcos Aurélio Almeida da Silva, Pierre Deransart, and Jacques Robin. Towards a Generic Trace for Rule Based Constraint Reasoning. In Jon Sneyers, editor, CHR '11: Proc. 8th Workshop on Constraint Handling Rules, pages 32-47, September 2011. GUC, Technical report. [PDF] Keyword(s): debugging, CHR 2011, CHR 2011. Abstract:

   CHR is a very versatile programming language that allows programmers to declaratively specify constraint solvers. An important part of the development of such solvers is in their testing and debugging phases. Current CHR implementations support those phases by offering tracing facilities with limited information. In this paper, we propose a new trace for CHR which contains enough information to analyze any aspects of CHR∨ execution at some general abstract level. This approach is based on the idea of generic trace. Such a trace is formally defined as an extension of the refined CHR∨ semantics. It is currently prototyped in a SWI Prolog based CHR implementation.

   
   

   @inproceedings{goncalves_generic_trace_chr11,
   author = {Armando Gon{\c{c}}alves and Aur{\'e}lio Almeida da Silva, Marcos and Pierre Deransart and Jacques Robin},
   title = {Towards a Generic Trace for Rule Based Constraint Reasoning},
   crossref = {pchr11},
   pages={32--47},
   abstract = { CHR is a very versatile programming language that allows programmers to declaratively specify constraint solvers. An important part of the development of such solvers is in their testing and debugging phases. Current CHR implementations support those phases by offering tracing facilities with limited information. In this paper, we propose a new trace for CHR which contains enough information to analyze any aspects of CHR$^\vee$ execution at some general abstract level. This approach is based on the idea of generic trace. Such a trace is formally defined as an extension of the refined CHR$^\vee$ semantics. It is currently prototyped in a SWI Prolog based CHR implementation. },
   keywords = {debugging},
   pdf = PAPERSHOME # {chr2011/04-Goncalves_et_al-chr11.pdf},
   
   }
   




8. R. Haemmerlé, P. Lopez-Garcia, and M.V. Hermenegildo. CLP Projection for Constraint Handling Rules. In Michael Hanus, editor, PPDP '11: Proc. 13th Intl. Conf. Princ. Pract. Declarative Programming, pages 137-148, July 2011. ACM Press. [doi:10.1145/2003476.2003496] Keyword(s): semantics, related formalisms, termination, confluence. Abstract:

   This paper introduces and studies the notion of CLP projection for Constraint Handling Rules (CHR). The CLP projection consists of a naive translation of CHR programs into Constraint Logic Programs (CLP). We show that the CLP projection provides a safe operational and declarative approximation for CHR programs. We demonstrate moreover that a confluent CHR program has a least model, which is precisely equal to the least model of its CLP projection (closing hence a ten year-old conjecture by Abdennadher et al.). Finally, we illustrate how the notion of CLP projection can be used in practice to apply CLP analyzers to CHR. In particular, we show results from applying AProVE to prove termination, and CiaoPP to infer both complexity upper bounds and types for CHR programs.

   
   

   @inproceedings{haemmerle2011clp,
   title={CLP Projection for Constraint Handling Rules},
   author={Haemmerl{\'e}, R. and Lopez-Garcia, P. and Hermenegildo, M.V.},
   crossref = {pppdp11},
   pages = {137-148},
   keywords = {semantics, related formalisms, termination, confluence},
   year={2011},
   doi={10.1145/2003476.2003496},
   abstract = { This paper introduces and studies the notion of CLP projection for Constraint Handling Rules (CHR). The CLP projection consists of a naive translation of CHR programs into Constraint Logic Programs (CLP). We show that the CLP projection provides a safe operational and declarative approximation for CHR programs. We demonstrate moreover that a confluent CHR program has a least model, which is precisely equal to the least model of its CLP projection (closing hence a ten year-old conjecture by Abdennadher et al.). Finally, we illustrate how the notion of CLP projection can be used in practice to apply CLP analyzers to CHR. In particular, we show results from applying AProVE to prove termination, and CiaoPP to infer both complexity upper bounds and types for CHR programs. },
   
   }
   




9. Christian Theil Have. Constraints and Global Optimization for Gene Prediction Overlap Resolution. In Alessandro Dal Palù, Agostino Dovier, and Andrea Formisano, editors, WCB'11: Workshop on Constraint Based Methods for Bioinformatics, pages 17-26, September 2011. Keyword(s): applications.
   

   @inproceedings{have_wcb11,
   author = {Christian Theil Have},
   title = {Constraints and Global Optimization for Gene Prediction Overlap Resolution},
   booktitle = {WCB'11: Workshop on Constraint Based Methods for Bioinformatics},
   month = {September},
   year = 2011,
   editor = {Alessandro Dal Pal{\`u} and Agostino Dovier and Andrea Formisano},
   pages = {17-26},
   keywords = {applications} 
   }
   




10. Johannes Langbein, Roland Stelzer, and Thom Frühwirth. A Rule-Based Approach to Long-Term Routing for Autonomous Sailboats. In Robotic Sailing 2011, Part V, pages 195-204, 2011. [doi:10.1007/978-3-642-22836-0_14] Keyword(s): applications.
    

    @inproceedings{langbein_routing_robsail11,
    author = {Johannes Langbein and Roland Stelzer and Thom Fr{\"u}hwirth},
    title = {A Rule-Based Approach to Long-Term Routing for Autonomous Sailboats},
    booktitle = {Robotic Sailing 2011, Part V},
    year = 2011,
    pages = {195-204},
    doi = {10.1007/978-3-642-22836-0_14},
    keywords = {applications} 
    }
    




11. Ester Mart'inez-Martìn and M. Teresa Escrig. A General Qualitative Spatio-Temporal Model Based on Intervals. In QR2011: 25th International Workshop on Qualitative Reasoning, 2011.
    

    @inproceedings{martinez_qr11,
    author = {Ester Mart{\''i}nez-Mart{\'\i}n and M. Teresa Escrig},
    title = {A General Qualitative Spatio-Temporal Model Based on Intervals},
    booktitle = {QR2011: 25th International Workshop on Qualitative Reasoning},
    year = 2011,
    
    }
    




12. Thierry Martinez. Angelic CHR. In Jon Sneyers, editor, CHR '11: Proc. 8th Workshop on Constraint Handling Rules, pages 19-31, September 2011. GUC, Technical report. [PDF] Keyword(s): semantics, CHR 2011, CHR 2011. Abstract:

    Implementations of CHR follow a committed-choice forwardchaining execution model: the non-determinism of the abstract semantics is partly rened with extra-logical syntactic convention on the program order and possibly notations for weighted semantics (with priorities or probabilities), and partly left unspecied in the underlying compiler. This paper proposes an alternative execution model which explores all the possible choices, by opposition to the committed-choice strategy. This execution model is angelic in the sense that if there exists a successful execution strategy (with respect to a given observable), then this strategy will be found. Formally, the set of computed goals is complete with respect to the set of the logical consequences of the interpretation of the initial goal in linear logic. In practice, this paper introduces a new data representation for sets of goals, the derivation nets. Sharing strategies between computation paths can be dened for derivation nets to make execution algorithmically tracktable in some cases where a naive exploration would be exponential. Control for rened execution is recovered with the introduction of user constraints to encode sequencing, fully captured in the linear-logic interpretation. As a consequence of angelic execution, CHR rules become decomposable while preserving accessibility properties. This decomposability makes natural the denition in angelic CHR of meta-interpreters to change the execution strategy. More generally, arbitrary computation can be interleaved during head matching, for custom user constraint indexation and deep guard denition.

    
    

    @inproceedings{martinez_angelic_chr11,
    author = {Thierry Martinez},
    title = {Angelic {CHR}},
    crossref = {pchr11},
    pages={19--31},
    abstract = { Implementations of CHR follow a committed-choice forwardchaining execution model: the non-determinism of the abstract semantics is partly rened with extra-logical syntactic convention on the program order and possibly notations for weighted semantics (with priorities or probabilities), and partly left unspecied in the underlying compiler. This paper proposes an alternative execution model which explores all the possible choices, by opposition to the committed-choice strategy. This execution model is angelic in the sense that if there exists a successful execution strategy (with respect to a given observable), then this strategy will be found. Formally, the set of computed goals is complete with respect to the set of the logical consequences of the interpretation of the initial goal in linear logic. In practice, this paper introduces a new data representation for sets of goals, the derivation nets. Sharing strategies between computation paths can be dened for derivation nets to make execution algorithmically tracktable in some cases where a naive exploration would be exponential. Control for rened execution is recovered with the introduction of user constraints to encode sequencing, fully captured in the linear-logic interpretation. As a consequence of angelic execution, CHR rules become decomposable while preserving accessibility properties. This decomposability makes natural the denition in angelic CHR of meta-interpreters to change the execution strategy. More generally, arbitrary computation can be interleaved during head matching, for custom user constraint indexation and deep guard denition. },
    keywords = {semantics},
    pdf = PAPERSHOME # {chr2011/03-Martinez-chr11.pdf},
    
    }
    




13. Jose F. Morales, Manuel Hermenegildo, and Rémy Haemmerlé. Modular Extensions for Modular (Logic) Languages. In German Vidal, editor, LOPSTR '11: 21st Intl. Symp. Logic-Based Program Synthesis and Transformation, Revised Selected Papers, Lecture Notes in Computer Science, 2011. Keyword(s): extensions.
    

    @inproceedings{morales_lopstr11,
    author = {Jose F. Morales and Manuel Hermenegildo and R{\'e}my Haemmerl{\'e}},
    title = {Modular Extensions for Modular (Logic) Languages},
    crossref = {plopstr11},
    keywords = {extensions},
    
    }
    




14. Paolo Pilozzi and Danny De Schreye. Improved termination analysis of CHR using self-sustainability analysis. In German Vidal, editor, LOPSTR '11: 21st Intl. Symp. Logic-Based Program Synthesis and Transformation, Revised Selected Papers, Lecture Notes in Computer Science, 2011. Keyword(s): termination.
    

    @inproceedings{pilozzi_improved_termination_lopstr11,
    author = {Pilozzi, Paolo and De Schreye, Danny},
    title = {Improved termination analysis of {CHR} using self-sustainability analysis},
    crossref = {plopstr11},
    keywords = {termination} 
    }
    




15. Evgeny Skvortsov, Nima Kaviani, and Veronica Dahl. Chemical Signaling as a Useful Metafor for Resource Management. In Proc. IWANN 2011 (International Work Conference on Artificial Neural Networks), 2011.
    

    @inproceedings{skvortsov_chemical_iwann11,
    title = {Chemical Signaling as a Useful Metafor for Resource Management},
    author = {Evgeny Skvortsov and Nima Kaviani and Veronica Dahl},
    booktitle = {Proc. IWANN 2011 (International Work Conference on Artificial Neural Networks)},
    year = 2011 
    }
    




16. Evgeny Skvortsov, Nima Kaviani, and Veronica Dahl. Chemical signaling as a useful metaphor for resource management. In Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I, IWANN'11, Berlin, Heidelberg, pages 449-456, 2011. Springer-Verlag. ISBN: 978-3-642-21500-1. [WWW]
    

    @inproceedings{Skvortsov:2011:CSU:2023252.2023316,
    author = {Skvortsov, Evgeny and Kaviani, Nima and Dahl, Veronica},
    title = {Chemical signaling as a useful metaphor for resource management},
    booktitle = {Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I},
    series = {IWANN'11},
    year = {2011},
    isbn = {978-3-642-21500-1},
    location = {Torremolinos-M\&\#255;laga, Spain},
    pages = {449--456},
    numpages = {8},
    url = {http://dl.acm.org/citation.cfm?id=2023252.2023316},
    acmid = {2023316},
    publisher = {Springer-Verlag},
    address = {Berlin, Heidelberg},
    
    }
    




17. Jon Sneyers and Danny De Schreye. Probabilistic Termination of CHRiSM Programs. In German Vidal, editor, LOPSTR '11: 21st Intl. Symp. Logic-Based Program Synthesis and Transformation, Pre-Proceedings, 2011. Keyword(s): termination, CHRiSM, probabilistic CHR.
    

    @inproceedings{sneyers_probabilistic_termination_lopstr11,
    author = {Jon Sneyers and De Schreye, Danny},
    title = {Probabilistic Termination of {CHRiSM} Programs},
    crossref = {plopstr11pre},
    keywords = {termination, CHRiSM, probabilistic CHR} 
    }
    




18. Andrea Triossi. Boosting CHR through Hardware Acceleration. In Jon Sneyers, editor, CHR '11: Proc. 8th Workshop on Constraint Handling Rules, pages 1-3, September 2011. GUC, Technical report. Note: Invited talk. [PDF] Keyword(s): implementation, parallelism, CHR 2011, CHR 2011. Abstract:

    The aim of this talk is to present a general framework for compiling Constraint Handling Rules (CHR) to a low level hardware description language (HDL). The benet introduced by a CHR based hardware synthesis is twofold: it increases the abstraction level of the common synthesis workflow and it can give signicant speed up to the execution of a CHR program. I will describe a practical method that set CHR as starting point for a hardware description and afterwards I will show how to integrate the generated hardware code, deployed in a Field Programmable Gate Array (FPGA), within the traditional software execution model of CHR. The result is a prototype CHR execution engine composed of a general purpose processor coupled with a specialized hardware accelerator. The former executes a CHR specication while the latter unburdens the processor by executing in parallel the most computational intensive rules. The talk will have a practical focus, illustrating the achieved performance obtained by a prototype system architecture.

    
    

    @inproceedings{triossi_hardware_acceleration_chr11,
    author = {Andrea Triossi},
    title = {Boosting CHR through Hardware Acceleration},
    crossref = {pchr11},
    note = {Invited talk},
    pages={1--3},
    abstract = { The aim of this talk is to present a general framework for compiling Constraint Handling Rules (CHR) to a low level hardware description language (HDL). The benet introduced by a CHR based hardware synthesis is twofold: it increases the abstraction level of the common synthesis workflow and it can give signicant speed up to the execution of a CHR program. I will describe a practical method that set CHR as starting point for a hardware description and afterwards I will show how to integrate the generated hardware code, deployed in a Field Programmable Gate Array (FPGA), within the traditional software execution model of CHR. The result is a prototype CHR execution engine composed of a general purpose processor coupled with a specialized hardware accelerator. The former executes a CHR specication while the latter unburdens the processor by executing in parallel the most computational intensive rules. The talk will have a practical focus, illustrating the achieved performance obtained by a prototype system architecture. },
    keywords = {implementation, parallelism},
    pdf = PAPERSHOME # {chr2011/01-Triossi-chr11.pdf},
    
    }
    




19. Zsolt Zombori, János Csorba, and Péter Szeredi. Static Type Checking for the Q Functional Language in Prolog. In John Gallagher and Michael Gelfond, editors, Technical Communications of the 27th Intl. Conf. on Logic Programming, volume 11 of Leibniz Intl. Proc. in Informatics (LIPIcs), Dagstuhl, Germany, pages 62-72, July 2011. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik. Keyword(s): type systems.
    

    @inproceedings{zombori_iclp11,
    author = {Zsolt Zombori and J{\'a}nos Csorba and P{\'e}ter Szeredi},
    title = {Static Type Checking for the {Q} Functional Language in {P}rolog},
    crossref = {tciclp11},
    pages={62-72},
    keywords = {type systems},
    
    }
    

1. Gregory M. Flanagan. Conceptual Requirement Validation for Architecture Design Systems. Master's thesis, California Polytechnic State University, San Luis Obispo, September 2011.
   

   @mastersthesis{flanagan_11,
   title = {Conceptual Requirement Validation for Architecture Design Systems},
   author = {Gregory M. Flanagan},
   school = {California Polytechnic State University, San Luis Obispo},
   month = {September},
   year = {2011} 
   }
   




2. Henning Christiansen and Bo Li. Approaching the Chinese Word Segmentation Problem with CHR Grammars, September 2011.
   

   @inproceeding{christiansen_li_chinese_word_seg_context11,
   author = {Henning Christiansen and Bo Li},
   title = {Approaching the {C}hinese Word Segmentation Problem with {CHR} Grammars},
   booktitle = {Proceedings of the 6th International Workshop on Constraints and Language Processing},
   location = {Karlsruhe, Germany},
   month = {September},
   year = {2011} 
   }
   




3. T.W.D. Jongstra. Inequality Reasoning for Qualitative Models using Constraint Handling Rules. Bachelor thesis, University of Amsterdam, December 2011.
   

   @misc{jongstra_bachelorthesis11,
   title = {Inequality Reasoning for Qualitative Models using Constraint Handling Rules},
   author = {T.W.D. Jongstra},
   howpublished = {Bachelor thesis, University of Amsterdam},
   month = {December},
   year = {2011} 
   }
   

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