Optimizing compilation and computational complexity of Constraint Handling Rules - Ph.D. thesis summary

Optimizing compilation and computational complexity of Constraint Handling Rules - Ph.D. thesis summary

Constraint Handling Rules [1,2] is a high-level programming language extension based on multi-headed committed-choice multiset rewrite rules. It can be used as a stand-alone language or as an extension to an existing host language. CHR systems have been implemented for nearly every Prolog system, an...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Sneyers, Jon
Format: Tagungsbericht
Sprache:eng
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 498
container_issue
container_start_page 494
container_title
container_volume 5649
creator Sneyers, Jon
description Constraint Handling Rules [1,2] is a high-level programming language extension based on multi-headed committed-choice multiset rewrite rules. It can be used as a stand-alone language or as an extension to an existing host language. CHR systems have been implemented for nearly every Prolog system, and there are also CHR systems for Haskell, Java and C.
format Conference Proceeding
fullrecord <record><control><sourceid>kuleuven</sourceid><recordid>TN_cdi_kuleuven_dspace_123456789_249842</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>123456789_249842</sourcerecordid><originalsourceid>FETCH-kuleuven_dspace_123456789_2498423</originalsourceid><addsrcrecordid>eNqVi0sKwjAUAAMq-L3D27mQSkyibdd-cKeI-xI0rdE0Lb5XUU-vFg-gq2FgpsG6cqYEF5GaqibrcMlFEIdKtlkX8cw5F2EsOizblGRz-7Q-g0ORl9ZpsoUH7Y-1V1S7drU5c7f0gCKFeeGRrtp6gvW7dZ9_VzmDEMD2NF6MgU4GLQJWea6vjz5rpdqhGXzZY8PVcj9fB5f3VN2MT45Y6oNJJkKq6SyM4kSoOFJC_lOOfisTupN8AXQOV-k</addsrcrecordid><sourcetype>Institutional Repository</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Optimizing compilation and computational complexity of Constraint Handling Rules - Ph.D. thesis summary</title><source>Lirias (KU Leuven Association)</source><source>Springer Books</source><creator>Sneyers, Jon</creator><contributor>Hill, Patricia ; Warren, David</contributor><creatorcontrib>Sneyers, Jon ; Hill, Patricia ; Warren, David</creatorcontrib><description>Constraint Handling Rules [1,2] is a high-level programming language extension based on multi-headed committed-choice multiset rewrite rules. It can be used as a stand-alone language or as an extension to an existing host language. CHR systems have been implemented for nearly every Prolog system, and there are also CHR systems for Haskell, Java and C.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3642028454</identifier><identifier>ISBN: 9783642028458</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer-Verlag Berlin</publisher><ispartof>Proceedings of the 25th International Conference on Logic Programming, 2009, Vol.5649, p.494-498</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>309,310,315,777,781,786,787,27841</link.rule.ids></links><search><contributor>Hill, Patricia</contributor><contributor>Warren, David</contributor><creatorcontrib>Sneyers, Jon</creatorcontrib><title>Optimizing compilation and computational complexity of Constraint Handling Rules - Ph.D. thesis summary</title><title>Proceedings of the 25th International Conference on Logic Programming</title><description>Constraint Handling Rules [1,2] is a high-level programming language extension based on multi-headed committed-choice multiset rewrite rules. It can be used as a stand-alone language or as an extension to an existing host language. CHR systems have been implemented for nearly every Prolog system, and there are also CHR systems for Haskell, Java and C.</description><issn>0302-9743</issn><isbn>3642028454</isbn><isbn>9783642028458</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>FZOIL</sourceid><recordid>eNqVi0sKwjAUAAMq-L3D27mQSkyibdd-cKeI-xI0rdE0Lb5XUU-vFg-gq2FgpsG6cqYEF5GaqibrcMlFEIdKtlkX8cw5F2EsOizblGRz-7Q-g0ORl9ZpsoUH7Y-1V1S7drU5c7f0gCKFeeGRrtp6gvW7dZ9_VzmDEMD2NF6MgU4GLQJWea6vjz5rpdqhGXzZY8PVcj9fB5f3VN2MT45Y6oNJJkKq6SyM4kSoOFJC_lOOfisTupN8AXQOV-k</recordid><startdate>200907</startdate><enddate>200907</enddate><creator>Sneyers, Jon</creator><general>Springer-Verlag Berlin</general><scope>FZOIL</scope></search><sort><creationdate>200907</creationdate><title>Optimizing compilation and computational complexity of Constraint Handling Rules - Ph.D. thesis summary</title><author>Sneyers, Jon</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-kuleuven_dspace_123456789_2498423</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sneyers, Jon</creatorcontrib><collection>Lirias (KU Leuven Association)</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sneyers, Jon</au><au>Hill, Patricia</au><au>Warren, David</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Optimizing compilation and computational complexity of Constraint Handling Rules - Ph.D. thesis summary</atitle><btitle>Proceedings of the 25th International Conference on Logic Programming</btitle><date>2009-07</date><risdate>2009</risdate><volume>5649</volume><spage>494</spage><epage>498</epage><pages>494-498</pages><issn>0302-9743</issn><isbn>3642028454</isbn><isbn>9783642028458</isbn><abstract>Constraint Handling Rules [1,2] is a high-level programming language extension based on multi-headed committed-choice multiset rewrite rules. It can be used as a stand-alone language or as an extension to an existing host language. CHR systems have been implemented for nearly every Prolog system, and there are also CHR systems for Haskell, Java and C.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer-Verlag Berlin</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0302-9743
ispartof Proceedings of the 25th International Conference on Logic Programming, 2009, Vol.5649, p.494-498
issn 0302-9743
language eng
recordid cdi_kuleuven_dspace_123456789_249842
source Lirias (KU Leuven Association); Springer Books
title Optimizing compilation and computational complexity of Constraint Handling Rules - Ph.D. thesis summary
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T16%3A14%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-kuleuven&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Optimizing%20compilation%20and%20computational%20complexity%20of%20Constraint%20Handling%20Rules%20-%20Ph.D.%20thesis%20summary&rft.btitle=Proceedings%20of%20the%2025th%20International%20Conference%20on%20Logic%20Programming&rft.au=Sneyers,%20Jon&rft.date=2009-07&rft.volume=5649&rft.spage=494&rft.epage=498&rft.pages=494-498&rft.issn=0302-9743&rft.isbn=3642028454&rft.isbn_list=9783642028458&rft_id=info:doi/&rft_dat=%3Ckuleuven%3E123456789_249842%3C/kuleuven%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true