The Computational Power and Complexity of Constraint Handling Rules (2005)
Cached
Download Links
| Venue: | In Second Workshop on Constraint Handling Rules, at ICLP05 |
| Citations: | 47 - 21 self |
BibTeX
@INPROCEEDINGS{Sneyers05thecomputational,
author = {Jon Sneyers and Tom Schrijvers and Bart Demoen},
title = {The Computational Power and Complexity of Constraint Handling Rules},
booktitle = {In Second Workshop on Constraint Handling Rules, at ICLP05},
year = {2005},
pages = {3--17}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Constraint Handling Rules (CHR) is a high-level rule-based programming language which is increasingly used for general purposes. We introduce the CHR machine, a model of computation based on the operational semantics of CHR. Its computational power and time complexity properties are compared to those of the well-understood Turing machine and Random Access Memory machine. This allows us to prove the interesting result that every algorithm can be implemented in CHR with the best known time and space complexity. We also investigate the practical relevance of this result and the constant factors involved. Finally we expand the scope of the discussion to other (declarative) programming languages.
