Constraint Handling Rules
From MaRDI portal
Publication:3639651
DOI10.1017/CBO9780511609886zbMath1182.68039OpenAlexW4234159174MaRDI QIDQ3639651
Publication date: 26 October 2009
Full work available at URL: https://doi.org/10.1017/cbo9780511609886
Semantics in the theory of computing (68Q55) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Logic programming (68N17)
Related Items (33)
An overview of Ciao and its design philosophy ⋮ Shape Neutral Analysis of Graph-based Data-structures ⋮ Parallelism, concurrency and distribution in constraint handling rules: A survey ⋮ Exchanging Conflict Resolution in an Adaptable Implementation of ACT-R ⋮ On Termination, Confluence and Consistent CHR-based Type Inference ⋮ Automatically improving constraint models in Savile Row ⋮ 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 ⋮ Fifty Years of Prolog and Beyond ⋮ Constraint handling rules with binders, patterns and generic quantification ⋮ Unfolding for CHR programs ⋮ Programming in logic without logic programming ⋮ Combining Forward and Backward Propagation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Confluence and convergence modulo equivalence in probabilistically terminating reduction systems ⋮ Probabilistic legal reasoning in CHRiSM ⋮ On proving confluence modulo equivalence for Constraint Handling Rules ⋮ MiningZinc: a declarative framework for constraint-based mining ⋮ Diagrammatic confluence for Constraint Handling Rules ⋮ A semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials ⋮ Strong Joinability Analysis for Graph Transformation Systems in CHR ⋮ CHR(PRISM)-based probabilistic logic learning ⋮ A complete and terminating execution model for Constraint Handling Rules ⋮ Decidability properties for fragments of CHR ⋮ CHR in Action ⋮ A labelling framework for probabilistic argumentation ⋮ Abstract Compilation of Object-Oriented Languages into Coinductive CLP(X): Can Type Inference Meet Verification? ⋮ As time goes by: Constraint Handling Rules ⋮ Turing-Complete Subclasses of CHR ⋮ Language-Based Program Verification via Expressive Types ⋮ Models and emerging trends of concurrent constraint programming
This page was built for publication: Constraint Handling Rules
