Corpus ID: 14105619

Generalized CHR Machines

@inproceedings{LeuvenGeneralizedCM,
  title={Generalized CHR Machines},
  author={K. Leuven}
}
Constraint Handling Rules (CHR) is a high-level rule-based programming language. In [11], a model of computation based on the operational semantics of CHR is introduced, called the CHR machine. The CHR machine was used to prove a complexity-wise completeness result for the CHR language and its implementations. In this paper, we investigate three generalizations of CHR machines: CHR machines with an instantiated operational semantics, non-deterministic CHR machines, and self-modifying CHR… Expand

Figures from this paper

The computational power and complexity of constraint handling rules
TLDR
The CHR machine is introduced, a model of computation based on the operational semantics of CHR that is compared to those of the well-understood Turing machine and Random Access Memory machine and proves the interesting result that every algorithm can be implemented in CHR with the best known time and space complexity. Expand
CHR(PRISM)-based probabilistic logic learning
TLDR
This paper introduces a new probabilistic logic formalism, called CHRiSM, based on a combination of CHR and PRISM, which can be used for high-level rapid prototyping of complex statistical models by means of “chance rules”. Expand
Result-directed CHR Execution
The traditional execution mode of CHR is bottom-up, that is, given a goal, the result is computed by exhaustively applying rules. This paper proposes a result-directed execution mode for CHR, to beExpand
Workshop Coordinators:
The notion of “rule” is ubiqitous in computer science, from theoretical formalisms to practical programming languages. Matured rulebased programming experiences a renaissance due to its applicationsExpand
CHRiSM: CHance Rules induce Statistical Models
A new probabilistic-logic formalism, called CHRiSM, is introduced. CHRiSM is based on a combination of CHR and PRISM. It can be used for high-level rapid prototyping of complex statistical models byExpand
Learning Semantic Parsers: A Constraint Handling Rule Approach
TLDR
This work states that semantic parsing is a challenging and interesting problem that has been severely understudied and previous approaches to semantic parsing are not robust enough or are limited in its applicability because they are applied to simple domains where semantic parsing reduces to filling slots on a frame. Expand
Proceedings of the 7 th International Workshop on Constraint Handling Rules
This volume contains the papers presented at CHR 2010, the Seventh International Workshop on Constraint Handling Rules held at the occasion of ICLP 2010, part of FLoC 2010, on 20 July 2010 inExpand
CHR 2009 — Proceedings of the 6th International Workshop on Constraint Handling Rules
This volume contains the papers presented at CHR 2013, the 10th International Workshop on Constraint Handling Rules held on July 13th 2013 in Berlin (Germany), at the occasion of the ThirdExpand
Constraint Handling Rules Bibliography
A data connector is disclosed herein which includes a plurality of terminals situated in an insulative housing, and the housing is surrounded by shielding members to form a shielded subassembly, theExpand
Optimizing Compilation and Computational Complexity of Constraint Handling Rules
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 anExpand

References

SHOWING 1-10 OF 12 REFERENCES
The computational power and complexity of constraint handling rules
TLDR
The CHR machine is introduced, a model of computation based on the operational semantics of CHR that is compared to those of the well-understood Turing machine and Random Access Memory machine and proves the interesting result that every algorithm can be implemented in CHR with the best known time and space complexity. Expand
The Refined Operational Semantics of Constraint Handling Rules
TLDR
This paper formally defines this refined operational semantics of CHRs and proves it implements the theoretical operational semantics, and shows how to create a (partial) confluence checker capable of detecting programs which are confluent under this semantics, but not under the theoretical Operational semantics. Expand
User-definable rule priorities for CHR
This paper introduces CHRrp: Constraint Handling Rules with user-definable rule priorities. CHRrp offers flexible execution control which is lacking in CHR. A formal operational semantics for theExpand
Theory and Practice of Constraint Handling Rules
TLDR
This survey describes implementations of the CHR language, defines syntax and semantics for CHR, introduces an important decidable property, confluence, of CHR programs and defines a tight integration of CHR with constraint logic programming languages. Expand
Expressiveness of Multiple Heads in CHR
TLDR
It is proved that multiple heads augment the expressive power of the CHR language, and it is obtained that CHR can be encoded neither in (constraint) logic programming nor in pure Prolog. Expand
As time goes by: Constraint Handling Rules
TLDR
Covering more than 180 publications, this new survey provides an overview of recent results in a wide range of research areas, from semantics and analysis to systems, extensions, and applications. Expand
Observable Confluence for Constraint Handling Rules
TLDR
The notion of observable confluence is introduced, a more general notion of confluence which takes into account whether states are observable, which allows for verified confluence for a range of CHR programs dealing with agents, type systems, and the union-find algorithm. Expand
Probabilistic Constraint Handling Rules
TLDR
Probabilistic CHRs (PCHR) allow the probabilistic “weighting” of rules, specifying the probability of their application, and are able to formalise various randomised algorithms such as for example Simulated Annealing. Expand
Constraint Handling Rules
TLDR
This book, written by the creator of CHR, describes the theory of CHR and how to use it in practice and compares CHR with other formalisms and languages and illustrates how it can capture their essential features. Expand
Computational complexity of random access stored program machines
TLDR
It is shown that there exist arbitrarily complex functions with optimal RASP programs whose running time cannot be improved by any multiplicative constant and these optimal programs cannot be fixed procedures, and the difference in computation speed between fixed procedures and self-modifying programs. Expand
...
1
2
...