Stem chr$ (all stems)

35 papers:

PADL-2015-Hanus #compilation #constraints

CHR(Curry): Interpretation and Compilation of Constraint Handling Rules in Curry (MH), pp. 74–89.

ICLP-2015-ElsawyZA #execution #revisited

CHR Exhaustive Execution — Revisited (AE, AZ, SA).

LOPSTR-2014-ElsawyZA #execution #text-to-text

Exhaustive Execution of CHR Through Source-to-Source Transformation (AE, AZ, SA), pp. 59–73.

LOPSTR-2014-SharafAF #animation #constraints #named

CHRAnimation: An Animation Tool for Constraint Handling Rules (NS, SA, TWF), pp. 92–110.

ICLP-J-2014-DuckHS #confluence #consistency #on the #termination #type inference

On Termination, Confluence and Consistent CHR-based Type Inference (GJD, RH, MS), pp. 619–632.

LOPSTR-2013-FakhrySA #implementation #semantics #text-to-text #towards

Towards the Implementation of a Source-to-Source Transformation Tool for CHR Operational Semantics (GF, NS, SA), pp. 145–163.

PPDP-2012-TriossiORF #compilation #hardware #parallel

Compiling CHR to parallel hardware (AT, SO, AR, TWF), pp. 173–184.

ICLP-2012-AbdennadherS #text-to-text #visualisation

Visualization of CHR through Source-to-Source Transformation (SA, NS), pp. 109–118.

ICLP-2012-DahlCMM #social

CHR for Social Responsibility (VD, BC, JEM, EM), pp. 370–380.

LOPSTR-2011-PilozziS #analysis #self #termination #using

Improved Termination Analysis of CHR Using Self-sustainability Analysis (PP, DDS), pp. 189–204.

ICLP-J-2010-GabbrielliMMS #decidability

Decidability properties for fragments of CHR (MG, JM, MCM, JS), pp. 611–626.

ICLP-J-2010-SneyersMVKS #learning #logic #probability

CHR(PRISM)-based probabilistic logic learning (JS, WM, JV, YK, TS), pp. 433–447.

LOPSTR-2009-PilozziSB #approach #constraints #proving

A Transformational Approach for Proving Properties of the CHR Constraint Store (PP, TS, MB), pp. 22–36.

PPDP-2009-GabbrielliMM #on the #power of

On the expressive power of priorities in CHR (MG, JM, MCM), pp. 267–276.

ICLP-2009-Koninck #execution

Execution Control for CHR (LDK), pp. 479–483.

ICLP-2009-Pilozzi #research #summary #termination

Research Summary: Termination of CHR (PP), pp. 534–535.

ICLP-2009-PilozziS09a #automation #proving #termination

Automating Termination Proofs for CHR (PP, DDS), pp. 504–508.

ICLP-2009-Sarna-StarostaS

Attributed Data for CHR Indexing (BSS, TS), pp. 357–371.

FLOPS-2008-KoninckSD #compilation #optimisation

Optimizing Compilation of CHR with Rule Priorities (LDK, PJS, GJD), pp. 32–47.

ICLP-2008-PilozziS #analysis #revisited #termination

Termination Analysis of CHR Revisited (PP, DDS), pp. 501–515.

ICLP-2008-Sneyers #subclass

Turing-Complete Subclasses of CHR (JS), pp. 759–763.

ICLP-2008-Weert #optimisation

Optimization of CHR Propagation Rules (PVW), pp. 485–500.

LOPSTR-2007-WeertSD #program transformation

Aggregates for CHR through Program Transformation (PVW, JS, BD), pp. 59–73.

PPDP-2007-KoninckSD

User-definable rule priorities for CHR (LDK, TS, BD), pp. 25–36.

PPDP-2007-TacchellaGM

Unfolding in CHR (PT, MG, MCM), pp. 179–186.

SAC-2007-DjelloulDF #constraints #finite #first-order #infinity #prolog #theorem proving #towards #unification #using

Toward a first-order extension of Prolog’s unification using CHR: a CHR first-order constraint solver over finite or infinite trees (KD, TBHD, TWF), pp. 58–64.

ICLP-2007-KoninckSD #algorithm #logic

The Correspondence Between the Logical Algorithms Language and CHR (LDK, TS, BD), pp. 209–223.

ICLP-2007-Raiser #graph transformation

Graph Transformation Systems in CHR (FR), pp. 240–254.

ICLP-2007-Weert #implementation

Extension and Implementation of CHR (PVW), pp. 466–468.

ICLP-2006-SneyersSD #memory management #reuse

Memory Reuse for CHR (JS, TS, BD), pp. 72–86.

PPDP-2005-DelzannoGM #composition #semantics

A compositional semantics for CHR (GD, MG, MCM), pp. 209–217.

ICLP-2005-CoqueryF #type system

A Type System for CHR (EC, FF), pp. 402–403.

ICLP-2005-Sneyers #analysis #optimisation #source code

Analysis and Optimization of CHR Programs (JS), pp. 450–451.

ICLP-2005-SneyersSD #continuation #optimisation

Guard and Continuation Optimization for Occurrence Representations of CHR (JS, TS, BD), pp. 83–97.

ICLP-2004-Schrijvers #generative #java #memory management #named #prolog

JmmSolve: A Generative Java Memory Model Implemented in Prolog and CHR (TS), pp. 475–476.