Optimizing compilation and computational complexity of constraint handling rules Ph.D. thesis summary

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Constraint Handling Rules [1,2] is a high-level programming language extension based on multi-headed committed-choice multiset rewrite rules. It can be used as a stand-alone language or as an extension to an existing host language. CHR systems have been implemented for nearly every Prolog system, and there are also CHR systems for Haskell, Java and C. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Sneyers, J. (2009). Optimizing compilation and computational complexity of constraint handling rules Ph.D. thesis summary. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5649 LNCS, pp. 494–498). https://doi.org/10.1007/978-3-642-02846-5_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free