Constraint Handling Rules

DOI10.1017/CBO9780511609886zbMath1182.68039MaRDI QIDQ3639651

Thom Frühwirth

Publication date: 26 October 2009

Full work available at URL: https://doi.org/10.1017/cbo9780511609886

zbMATH Keywords

logic programming; rule-based formalism; graph-based formalism

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

68-02: Research exposition (monographs, survey articles) pertaining to computer science

68N17: Logic programming

Related Items

Shape Neutral Analysis of Graph-based Data-structures, Parallelism, concurrency and distribution in constraint handling rules: A survey, Constraint handling rules with binders, patterns and generic quantification, Unfolding for CHR programs, Programming in logic without logic programming, Unnamed Item, Unnamed Item, Diagrammatic confluence for Constraint Handling Rules, Strong Joinability Analysis for Graph Transformation Systems in CHR, Probabilistic legal reasoning in CHRiSM, Turing-Complete Subclasses of CHR, CHR in Action, On proving confluence modulo equivalence for Constraint Handling Rules, MiningZinc: a declarative framework for constraint-based mining, A semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials, A labelling framework for probabilistic argumentation, Automatically improving constraint models in Savile Row, Confluence and convergence modulo equivalence in probabilistically terminating reduction systems, Models and emerging trends of concurrent constraint programming, Language-Based Program Verification via Expressive Types, An overview of Ciao and its design philosophy, Exchanging Conflict Resolution in an Adaptable Implementation of ACT-R, On Termination, Confluence and Consistent CHR-based Type Inference, Confluence Modulo Equivalence in Constraint Handling Rules, Exhaustive Execution of CHR Through Source-to-Source Transformation, A Formal Semantics for the Cognitive Architecture ACT-R, Combining Forward and Backward Propagation, Abstract Compilation of Object-Oriented Languages into Coinductive CLP(X): Can Type Inference Meet Verification?, As time goes by: Constraint Handling Rules, CHR(PRISM)-based probabilistic logic learning, A complete and terminating execution model for Constraint Handling Rules, Decidability properties for fragments of CHR