Eighth International Workshop on Constraint Handling Rules Workshop Organization Program Chair Modeling Dependent Events with Chrism for Probabilistic Abduction . . 48 Boosting Chr through Hardware Acceleration Chr for Spoken and Other Biological Languages

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 benefit introduced by a CHR based hardware synthesis is twofold: it increases the abstraction level of the common synthesis work-flow and it can give significant 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 specification 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. The motivations that gave rise to the development of a novel technique to synthesize behavioral hardware components starting from a declarative programming language are basically two. Firstly it introduces a high level of abstraction in an environment that is traditionally described at low level and then secondly it results in hardware blocks that can be interfaced with the high level language execution giving relevant time improvements. Therefore we developed a completely general framework that allows to synthesize reconfigurable hardware easily employable in a wide range of application, since a small modification to the high level code affects a huge portion of low level HDL code (resulting in a remarkable time saving for the programmer). Moreover the generated hardware code is fully compliant with the commonly adopted ones and hence can be easily integrated in the existing hardware project. Once hardware can be directly compiled from a high level language, we implemented a coupled system constituted by a traditional general purpose CPU and a hardware accelerator deployed on a Field Programmable Gate Array (FPGA). Thus such sole system will be compiled from a single high level language specification through a double compilation path resulting in a efficient execution engine. In the following paragraphs we briefly introduce our contributions to the two aforementioned research areas. High Level Synthesis The ability to integrate an ever greater number of transistors within a chip and the consequent complexity growth of the features that

[1]  John Bigelow,et al.  Possible worlds foundations for probability , 1976, J. Philos. Log..

[2]  Ernst W. Mayr An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[3]  Nils J. Nilsson,et al.  Probabilistic Logic * , 2022 .

[4]  Ronald Fagin,et al.  Uncertainty, belief, and probability , 1989, IJCAI 1989.

[5]  Evgeny Dantsin,et al.  Probabilistic Logic Programs and their Semantics , 1990, RCLP.

[6]  Thom Frühwirth,et al.  High-Level Implementations of Constraint Handling Rules , 1995 .

[7]  Antonis C. Kakas,et al.  The role of abduction in logic programming , 1998 .

[8]  Arabellastrasse,et al.  Constraint Handling Rules ? , 1995 .

[9]  Taisuke Sato,et al.  A Statistical Learning Method for Logic Programs with Distribution Semantics , 1995, ICLP.

[10]  Martin Gogolla,et al.  State diagrams in UML: A formal semantics using graph transformations , 1998 .

[11]  Randy Goebel,et al.  Computational intelligence - a logical approach , 1998 .

[12]  Robert Stalnaker,et al.  On the Representation of Context , 1996, J. Log. Lang. Inf..

[13]  Joseph Y. Halpern A Logical Approach to Reasoning about Uncertainty: A Tutorial , 1998 .

[14]  Thom W. Frühwirth,et al.  Theory and Practice of Constraint Handling Rules , 1998, J. Log. Program..

[15]  Olivier Ridoux,et al.  Specifying Prolog Trace Models with a Continuation Semantics , 2000, LOPSTR.

[16]  Salvador,et al.  Observable Semantics and Dynamic Analysis ofComputational Processes , 2000 .

[17]  Peter A. Flach,et al.  Abduction and induction: essays on their relation and integration , 2000 .

[18]  Pretschner,et al.  Model Based Testing with Constraint Logic Programming: First Results and Challenges , 2001 .

[19]  Antonis C. Kakas,et al.  Abduction in Logic Programming , 2002, Computational Logic: Logic Programming and Beyond.

[20]  Patrick Cousot,et al.  Systematic design of program transformation frameworks by abstract interpretation , 2002, POPL '02.

[21]  Daniel Varro Automated Program Generation for and by Model Transformation Systems , 2002 .

[22]  Krzysztof Czarnecki,et al.  Classification of Model Transformation Approaches , 2003 .

[23]  M. Ducassé,et al.  A Generic Trace Schema for the Portability of CP(FD) Debugging Tools , 2003, CSCLP.

[24]  Slim Abdennadher,et al.  Essentials of Constraint Programming , 2010, Cognitive Technologies.

[25]  SWI-Prolog 5.6 Reference Manual , 2004 .

[26]  Philippe Blache,et al.  Property Grammars: A Fully Constraint-Based Theory , 2004, CSLP.

[27]  Verónica Dahl,et al.  Concept Formation Rules: An Executable Cognitive Model of Knowledge Construction , 2016, NLUCS.

[28]  J. Küster,et al.  Comparing Two Model Transformation Approaches , 2004 .

[29]  Peter J. Stuckey,et al.  The Refined Operational Semantics of Constraint Handling Rules , 2004, ICLP.

[30]  Thom W. Frühwirth Parallelizing Union-Find in Constraint Handling Rules Using Confluence Analysis , 2005, ICLP.

[31]  Thom W. Frühwirth,et al.  A Linear-Logic Semantics for Constraint Handling Rules , 2005, CP.

[32]  Verónica Dahl,et al.  HYPROLOG: A New Logic Programming Language with Assumptions and Abduction , 2005, ICLP.

[33]  Henning Christiansen,et al.  CHR grammars , 2004, Theory and Practice of Logic Programming.

[34]  Alexander Königs,et al.  Model transformation with triple graph grammars , 2005 .

[35]  Albert Zündorf,et al.  Statechart Modeling with Fujaba , 2005, Electron. Notes Theor. Comput. Sci..

[36]  Dániel Varró,et al.  Advanced model transformation language constructs in the VIATRA2 framework , 2006, SAC.

[37]  Verónica Dahl,et al.  Constraint Based Methods for Biological Sequence Analysis , 2006, J. Univers. Comput. Sci..

[38]  Alan Hartman,et al.  A UML simulator based on a generic model execution engine , 2006, MoDELS'06.

[39]  Russ Miles,et al.  Learning UML 2.0 , 2006 .

[40]  Bart Demoen,et al.  Search Strategies in CHR(Prolog) , 2006 .

[41]  Tarek A. El-Ghazawi,et al.  Productivity of High-Level Languages on Reconfigurable Computers: An HPC Perspective , 2007, 2007 International Conference on Field-Programmable Technology.

[42]  Tom Mens,et al.  Refactoring of UML models using AGG , 2008, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[43]  Hariolf Betz Relating Coloured Petri Nets to Constraint Handling Rules , 2007, ICLP 2007.

[44]  Bart Demoen,et al.  User-definable rule priorities for CHR , 2007, PPDP '07.

[45]  Ge Hu,et al.  A Comparison of C/C++-based Software/Hardware Co-design Description Languages , 2008, 2008 The 9th International Conference for Young Computer Scientists.

[46]  F. Fages,et al.  Modular CHR with ask and tell , 2008 .

[47]  Henning Christiansen,et al.  Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules , 2009, Constraint Handling Rules.

[48]  Bernhard Schätz,et al.  Formalization and Rule-Based Transformation of EMF Ecore-Based Models , 2009, SLE.

[49]  Taisuke Sato,et al.  A glimpse of symbolic-statistical modeling by PRISM , 2008, Journal of Intelligent Information Systems.

[50]  Stephen Muggleton,et al.  Learning probabilistic logic models from probabilistic examples , 2007, Machine Learning.

[51]  Mireille Ducassé,et al.  Design and implementation of a tracer driver: Easy and efficient dynamic analyses of constraint logic programs , 2008, Theory Pract. Log. Program..

[52]  Bart Demoen,et al.  The computational power and complexity of constraint handling rules , 2009, TOPL.

[53]  Verónica Dahl,et al.  Abductive Logic Grammars , 2009, WoLLIC.

[54]  Tom Schrijvers,et al.  Under Consideration for Publication in Theory and Practice of Logic Programming as Time Goes By: Constraint Handling Rules , 2022 .

[55]  Bran Selic The Theory and Practice of Modeling Language Design for Model-Based Software Engineering - A Personal Perspective , 2009, GTTSE.

[56]  Jens Kohlmeyer Eine formale Semantik für die Verknüpfung von Verhaltensbeschreibungen in der UML 2 , 2009 .

[57]  Verónica Dahl,et al.  Biological Concept Formation Grammars - A Flexible, Multiagent Linguistic Tool for Biological Processes , 2010, ICAART.

[58]  Thom W. Frühwirth,et al.  A complete and terminating execution model for Constraint Handling Rules , 2010, Theory Pract. Log. Program..

[59]  Gemma Bel-Enguix,et al.  Language as a Complex System: Interdisciplinary Approaches , 2010 .

[60]  Wannes Meert,et al.  CHR(PRISM)-based probabilistic logic learning , 2010, Theory Pract. Log. Program..

[61]  Raymond Mooney,et al.  Bayesian Abductive Logic Programs , 2010, StarAI@AAAI.

[62]  Pierre Deransart,et al.  Towards a Generic Framework to Generate Explanatory Traces of Constraint Solving and Rule-Based Reasoning , 2009, ArXiv.

[63]  V. S. Subrahmanian,et al.  Abductive Inference in Probabilistic Logic Programs , 2010, ICLP.

[64]  Frank Raiser,et al.  Graph Transformation Systems in Constraint Handling Rules - Improved Methods for Program Analysis , 2010 .

[65]  Maria Dolores Jiménez-López,et al.  Poetic RNA: Adapting RNA Design Methods to the Analysis of Poetry , 2010, PAAMS.

[66]  Thierry Martinez Semantics-preserving translations between linear concurrent constraint programming and constraint handling rules , 2010, PPDP.

[67]  Thom Frühwirth,et al.  Constraint-based hardware synthesis , 2010 .

[68]  Mats Carlsson,et al.  A Generic Visualization Platform for CP , 2010, CP.

[69]  Antonio Cicchetti,et al.  Logical constraints for managing non-determinism in bidirectional model transformations , 2011 .

[70]  Angelo E. M. Ciarlini AUTOMATIC DERIVATION OF MEANINGFUL EXPERIMENTS FOR HYBRID SYSTEMS , 2011 .

[71]  Frank Raiser,et al.  Constraint Handling Rules: Compilation, Execution, and Analysis , 2011 .

[72]  J. Almendros-Jiménez ODM-based UML Model Transformations using Prolog ? , 2011 .

[73]  Pierre Deransart,et al.  Towards a Generic Trace for Rule Based Constraint Reasoning , 2012, ArXiv.

[74]  Dov M. Gabbay,et al.  What Is Negation as Failure? , 2012, Logic Programs, Norms and Action.