The following pages link to Constraint Handling Rules (Q3639651):
Displaying 33 items.
- On proving confluence modulo equivalence for Constraint Handling Rules (Q511019) (← links)
- MiningZinc: a declarative framework for constraint-based mining (Q511753) (← links)
- A semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials (Q692280) (← links)
- A labelling framework for probabilistic argumentation (Q722102) (← links)
- Automatically improving constraint models in Savile Row (Q1680696) (← links)
- Confluence and convergence modulo equivalence in probabilistically terminating reduction systems (Q1726351) (← links)
- Models and emerging trends of concurrent constraint programming (Q2348541) (← links)
- Language-Based Program Verification via Expressive Types (Q2866340) (← links)
- An overview of Ciao and its design philosophy (Q2893101) (← links)
- Exchanging Conflict Resolution in an Adaptable Implementation of ACT-R (Q2931262) (← links)
- On Termination, Confluence and Consistent CHR-based Type Inference (Q2931268) (← links)
- Confluence Modulo Equivalence in Constraint Handling Rules (Q2949698) (← links)
- Exhaustive Execution of CHR Through Source-to-Source Transformation (Q2949701) (← links)
- A Formal Semantics for the Cognitive Architecture ACT-R (Q2949702) (← links)
- Combining Forward and Backward Propagation (Q2964470) (← links)
- Abstract Compilation of Object-Oriented Languages into Coinductive CLP(X): Can Type Inference Meet Verification? (Q3067532) (← links)
- As time goes by: Constraint Handling Rules (Q3400960) (← links)
- CHR(PRISM)-based probabilistic logic learning (Q3585158) (← links)
- A complete and terminating execution model for Constraint Handling Rules (Q3585170) (← links)
- Decidability properties for fragments of CHR (Q3585171) (← links)
- Shape Neutral Analysis of Graph-based Data-structures (Q4559807) (← links)
- Parallelism, concurrency and distribution in constraint handling rules: A survey (Q4559827) (← links)
- Constraint handling rules with binders, patterns and generic quantification (Q4592722) (← links)
- Unfolding for CHR programs (Q4592981) (← links)
- Programming in logic without logic programming (Q4593027) (← links)
- Diagrammatic confluence for Constraint Handling Rules (Q4911146) (← links)
- (Q5020558) (← links)
- (Q5020651) (← links)
- Strong Joinability Analysis for Graph Transformation Systems in CHR (Q5170283) (← links)
- Probabilistic legal reasoning in CHRiSM (Q5398310) (← links)
- Turing-Complete Subclasses of CHR (Q5504695) (← links)
- CHR in Action (Q5743605) (← links)
- Fifty Years of Prolog and Beyond (Q6063890) (← links)
