Name
Abstract | ||
|---|---|---|
Constraint Handling Rules (CHR) is an elegant, high-level programming language based on multi-headed, forward chaining rules. To ensure CHR propagation rules are applied at most once with the same combination of constraints, CHR implementations maintain a so-called propagation history . The performance impact of this history can be significant. We introduce several optimizations that, for the majority of CHR rules, eliminate this overhead. We formally prove their correctness, and evaluate their implementation in two state-of-the-art CHR systems. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-89982-2_42 | ICLP |
Keywords | Field | DocType |
programming language | Forward chaining,Programming language,Computer science,Correctness,Algorithm,Implementation,Theoretical computer science,Constraint satisfaction problem,Constraint Handling Rules,Fibonacci number | Conference |
Volume | ISSN | Citations |
5366 | 0302-9743 | 1 |
PageRank | References | Authors |
0.36 | 6 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| peter van weert | 1 | 65 | 4.48 |