Jon Sneyers, Tom Schrijvers, Bart Demoen  Home/Search
Context
Related
| cs.kuleuven.ac.be/~dtai/pub...41821.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.kuleuven.ac.be/...2005E.shtml (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce the CHR machine, a model of computation based on the Constraint Handling Rules programming language. Its computational power and time complexity properties are compared with those of the Turing machine and Random Access Memory machine. Our major result is the proof that every algorithm can be implemented in CHR with the best known time and space complexity. (Update)
Active bibliography (related documents): More All
1.1: Automatic Implication Checking for CHR Constraints - Schrijvers, Demoen, Duck.. (2005) (Correct)
0.8: Analysing the CHR Implementation of Union-Find - Schrijvers, Frühwirth (2005) (Correct)
0.5: Guard and Continuation Optimization for Occurrence.. - Sneyers, Schrijvers.. (2005) (Correct)
Similar documents based on text: More All
0.6: Guard Simplification in CHR programs - Sneyers, Schrijvers, Demoen (2004) (Correct)
0.3: Refactoring Prolog Programs - Schrijvers, Serebrenik, Demoen (2001) (Correct)
0.3: Refactoring Prolog Code - Schrijvers, Serebrenik, Demoen (2004) (Correct)
BibTeX entry: (Update)
@misc{ sneyers-computational,
author = "Jon Sneyers and Tom Schrijvers and Bart Demoen",
title = "The Computational Power and Complexity of Constraint Handling Rules",
url = "citeseer.ist.psu.edu/732011.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Motwani et al. - 2001
1450 The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft et al. - 1975
64 Theory and practice of constraint handling rules - Fruhwirth - 1998
57 the computational complexity of algorithms (context) - Hartmanis, Stearns - 1965
24 Operational Semantics and Confluence of Constraint Propagati.. - Abdennadher - 1997
10 Models of Computation (context) - Savage - 1998
10 A new meta-complexity theorem for bottom-up logic programs - Ganzinger, McAllester - 2001
8 Optimizing Compilation of Constraint Handling Rules in HAL - Holzbaur, de la et al. - 2005
6 JACK: A Java Constraint Kit - Abdennadher, Kramer et al. - 2001
6 Compiling constraint handling rules into Prolog with attribu.. (context) - Holzbaur, Fruhwirth - 1999
6 Adaptive Constraint Handling with CHR in Java (context) - Wolf - 2001
5 The Refined Operational Semantics of Constraint Handling Rul.. (context) - Duck, Stuckey et al. - 2004
4 Leuven CHR system: Implementation and application (context) - Schrijvers, Demoen - 2004
3 Optimal Union-Find in Constraint Handling Rules - Schrijvers, Fruhwirth - 2005
1 As Time Goes By: Automatic Complexity Analysis of Concurrent.. (context) - Fruhwirth - 2002
1 ACM Transations on Programming Languages and Systems (context) - Stuckey, Sulzmann et al. - 2005
1 Automatic Implication Checking for CHR Constraint Solvers - Schrijvers, Demoen et al. - 2005
Documents on the same site (http://www.cs.kuleuven.ac.be/~dtai/publications/2005-E.shtml): More
Inference of Well-typings for Logic Programs with.. - Bruynooghe.. (2005) (Correct)
Experiments with Relational Neural Networks - Uwents, Blockeel (Correct)
Guard Simplification in CHR programs - Sneyers, Schrijvers, Demoen (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC