Analysis and Optimization of CHR Programs

Constraint Handling Rules (CHR) [2] is a high-level, powerful, yet relatively simple “no box” CLP language, embedded in a host language, commonly Prolog. It is based on multi-headed committed-choice rules. Recent implementations of CHR consist of a compiler which translates a CHR program to host lan...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Sneyers, Jon
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Computer science control theory systems Constraint Solver Exact sciences and technology Language theory and syntactical analysis Logic Program Logic Programming Operational Semantic Runtime System Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	451
container_issue
container_start_page	450
container_title
container_volume
creator	Sneyers, Jon
description	Constraint Handling Rules (CHR) [2] is a high-level, powerful, yet relatively simple “no box” CLP language, embedded in a host language, commonly Prolog. It is based on multi-headed committed-choice rules. Recent implementations of CHR consist of a compiler which translates a CHR program to host language code, and a run-time system implementing the constraint store. Originally, CHR was designed for rapid prototyping of user-de.ned constraint solvers. In the early years of CHR limited attention went to optimized compilation. As a consequence, the reference implementation of CHR [4] comprises a general compilation schema, with only a small number of optimizations. Currently, CHR is increasingly used as a general-purpose programming language in a wide range of applications. Therefore, performance becomes more important, and recently, more advanced compilation optimizations have been proposed [3].
doi_str_mv	10.1007/11562931_51
format	Conference Proceeding
fullrecord	<record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_17246969</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>17246969</sourcerecordid><originalsourceid>FETCH-LOGICAL-p247t-4392f911dc1f84f3a8d822b3755b33dfb8e482a6c6df8ebae5e2fdcae4368ebb3</originalsourceid><addsrcrecordid>eNpNkEtLw0AUhccXWGpX_oFsXHQRnTt3Mo9lKdYKhYroerhJZko0LzLZ1F9vpCKezeHwHc7iMHYL_B441w8AmRIWwWVwxhZWG8wkR7BSy3M2AwWQIkp78ceEFdzAJZtx5CK1WuI1W8T4wSchGM1xxparlupjrGJCbZns-7Fqqi8aq65NupCst6_Jy9AdBmriDbsKVEe_-PU5e988vq236W7_9Lxe7dJeSD2mEq0IFqAsIBgZkExphMhRZ1mOWIbceGkEqUKVwficfOZFKAvyEtWUc5yzu9NuT7GgOgzUFlV0_VA1NBwdaCGVVXbqLU-9OKH24AeXd91ndMDdz13u3134DdfmVfw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Analysis and Optimization of CHR Programs</title><source>Springer Books</source><creator>Sneyers, Jon</creator><contributor>Gupta, Gopal ; Gabbrielli, Maurizio</contributor><creatorcontrib>Sneyers, Jon ; Gupta, Gopal ; Gabbrielli, Maurizio</creatorcontrib><description>Constraint Handling Rules (CHR) [2] is a high-level, powerful, yet relatively simple “no box” CLP language, embedded in a host language, commonly Prolog. It is based on multi-headed committed-choice rules. Recent implementations of CHR consist of a compiler which translates a CHR program to host language code, and a run-time system implementing the constraint store. Originally, CHR was designed for rapid prototyping of user-de.ned constraint solvers. In the early years of CHR limited attention went to optimized compilation. As a consequence, the reference implementation of CHR [4] comprises a general compilation schema, with only a small number of optimizations. Currently, CHR is increasingly used as a general-purpose programming language in a wide range of applications. Therefore, performance becomes more important, and recently, more advanced compilation optimizations have been proposed [3].</description><edition>1ère éd</edition><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 9783540292081</identifier><identifier>ISBN: 354029208X</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540319474</identifier><identifier>EISBN: 3540319476</identifier><identifier>DOI: 10.1007/11562931_51</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Constraint Solver ; Exact sciences and technology ; Language theory and syntactical analysis ; Logic Program ; Logic Programming ; Operational Semantic ; Runtime System ; Theoretical computing</subject><ispartof>Lecture notes in computer science, 2005, p.450-451</ispartof><rights>Springer-Verlag Berlin Heidelberg 2005</rights><rights>2005 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11562931_51$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11562931_51$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17246969$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Gupta, Gopal</contributor><contributor>Gabbrielli, Maurizio</contributor><creatorcontrib>Sneyers, Jon</creatorcontrib><title>Analysis and Optimization of CHR Programs</title><title>Lecture notes in computer science</title><description>Constraint Handling Rules (CHR) [2] is a high-level, powerful, yet relatively simple “no box” CLP language, embedded in a host language, commonly Prolog. It is based on multi-headed committed-choice rules. Recent implementations of CHR consist of a compiler which translates a CHR program to host language code, and a run-time system implementing the constraint store. Originally, CHR was designed for rapid prototyping of user-de.ned constraint solvers. In the early years of CHR limited attention went to optimized compilation. As a consequence, the reference implementation of CHR [4] comprises a general compilation schema, with only a small number of optimizations. Currently, CHR is increasingly used as a general-purpose programming language in a wide range of applications. Therefore, performance becomes more important, and recently, more advanced compilation optimizations have been proposed [3].</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Constraint Solver</subject><subject>Exact sciences and technology</subject><subject>Language theory and syntactical analysis</subject><subject>Logic Program</subject><subject>Logic Programming</subject><subject>Operational Semantic</subject><subject>Runtime System</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>9783540292081</isbn><isbn>354029208X</isbn><isbn>9783540319474</isbn><isbn>3540319476</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNpNkEtLw0AUhccXWGpX_oFsXHQRnTt3Mo9lKdYKhYroerhJZko0LzLZ1F9vpCKezeHwHc7iMHYL_B441w8AmRIWwWVwxhZWG8wkR7BSy3M2AwWQIkp78ceEFdzAJZtx5CK1WuI1W8T4wSchGM1xxparlupjrGJCbZns-7Fqqi8aq65NupCst6_Jy9AdBmriDbsKVEe_-PU5e988vq236W7_9Lxe7dJeSD2mEq0IFqAsIBgZkExphMhRZ1mOWIbceGkEqUKVwficfOZFKAvyEtWUc5yzu9NuT7GgOgzUFlV0_VA1NBwdaCGVVXbqLU-9OKH24AeXd91ndMDdz13u3134DdfmVfw</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Sneyers, Jon</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2005</creationdate><title>Analysis and Optimization of CHR Programs</title><author>Sneyers, Jon</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p247t-4392f911dc1f84f3a8d822b3755b33dfb8e482a6c6df8ebae5e2fdcae4368ebb3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Constraint Solver</topic><topic>Exact sciences and technology</topic><topic>Language theory and syntactical analysis</topic><topic>Logic Program</topic><topic>Logic Programming</topic><topic>Operational Semantic</topic><topic>Runtime System</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Sneyers, Jon</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sneyers, Jon</au><au>Gupta, Gopal</au><au>Gabbrielli, Maurizio</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Analysis and Optimization of CHR Programs</atitle><btitle>Lecture notes in computer science</btitle><date>2005</date><risdate>2005</risdate><spage>450</spage><epage>451</epage><pages>450-451</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>9783540292081</isbn><isbn>354029208X</isbn><eisbn>9783540319474</eisbn><eisbn>3540319476</eisbn><abstract>Constraint Handling Rules (CHR) [2] is a high-level, powerful, yet relatively simple “no box” CLP language, embedded in a host language, commonly Prolog. It is based on multi-headed committed-choice rules. Recent implementations of CHR consist of a compiler which translates a CHR program to host language code, and a run-time system implementing the constraint store. Originally, CHR was designed for rapid prototyping of user-de.ned constraint solvers. In the early years of CHR limited attention went to optimized compilation. As a consequence, the reference implementation of CHR [4] comprises a general compilation schema, with only a small number of optimizations. Currently, CHR is increasingly used as a general-purpose programming language in a wide range of applications. Therefore, performance becomes more important, and recently, more advanced compilation optimizations have been proposed [3].</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11562931_51</doi><tpages>2</tpages><edition>1ère éd</edition></addata></record>
fulltext	fulltext
identifier	ISSN: 0302-9743
ispartof	Lecture notes in computer science, 2005, p.450-451
issn	0302-9743 1611-3349
language	eng
recordid	cdi_pascalfrancis_primary_17246969
source	Springer Books
subjects	Applied sciences Computer science control theory systems Constraint Solver Exact sciences and technology Language theory and syntactical analysis Logic Program Logic Programming Operational Semantic Runtime System Theoretical computing
title	Analysis and Optimization of CHR Programs
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T01%3A28%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Analysis%20and%20Optimization%20of%20CHR%20Programs&rft.btitle=Lecture%20notes%20in%20computer%20science&rft.au=Sneyers,%20Jon&rft.date=2005&rft.spage=450&rft.epage=451&rft.pages=450-451&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=9783540292081&rft.isbn_list=354029208X&rft_id=info:doi/10.1007/11562931_51&rft_dat=%3Cpascalfrancis_sprin%3E17246969%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540319474&rft.eisbn_list=3540319476&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true