Pages that link to "Item:Q4245936"

The following pages link to Theory and practice of constraint handling rules (Q4245936):

Displaying 50 items.

• The expressive power of CHR with priorities (Q388222) (← links)
• On proving confluence modulo equivalence for Constraint Handling Rules (Q511019) (← links)
• Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules (Q833735) (← links)
• Termination of floating-point computations (Q850498) (← links)
• Local consistency for extended CSPs (Q1035707) (← links)
• LMNtal as a hierarchical logic programming language (Q1035709) (← links)
• Parsing as semantically guided constraint solving: the role of ontologies (Q1653454) (← links)
• PRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited control (Q1726305) (← links)
• Models and emerging trends of concurrent constraint programming (Q2348541) (← links)
• Type Inference using Constraint Handling Rules (Q2841285) (← links)
• Encoding Distributed Process Calculi into LMNtal (Q2870199) (← links)
• ECLⁱPS^e – From LP to CLP (Q2893096) (← links)
• Confluence Modulo Equivalence in Constraint Handling Rules (Q2949698) (← links)
• Splitting the Control Flow with Boolean Flags (Q3522080) (← links)
• An Analysis of Slow Convergence in Interval Propagation (Q3523087) (← links)
• Expressiveness of Multiple Heads in CHR (Q3599074) (← links)
• Welcome to Constraint Handling Rules (Q3616877) (← links)
• A Flexible Search Framework for CHR (Q3616878) (← links)
• Adaptive CHR Meets CHR ∨ (Q3616881) (← links)
• Constructing Rule-Based Solvers for Intentionally-Defined Constraints (Q3616883) (← links)
• Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules (Q3616884) (← links)
• A Compositional Semantics for CHR with Propagation Rules (Q3616886) (← links)
• CHR for Imperative Host Languages (Q3616887) (← links)
• Guard Reasoning in the Refined Operational Semantics of CHR (Q3616888) (← links)
• Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities (Q3621268) (← links)
• Abductive Logic Grammars (Q3638282) (← links)
• Monadic constraint programming (Q3648354) (← links)
• The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments (Q3648356) (← links)
• (Q4499247) (← links)
• (Q4499264) (← links)
• Shape Neutral Analysis of Graph-based Data-structures (Q4559807) (← 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)
• <scp>OutsideIn(X)</scp>Modular type inference with local assumptions (Q4918240) (← links)
• On the Number of Rule Applications in Constraint Programs (Q4923523) (← links)
• (Q5020541) (← links)
• (Q5020558) (← links)
• Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR (Q5302727) (← links)
• Attributed Data for CHR Indexing (Q5325765) (← links)
• Integration of Abductive Reasoning and Constraint Optimization in SCIFF (Q5325766) (← links)
• Demand-Driven Normalisation for ACD Term Rewriting (Q5325772) (← links)
• Proving Termination by Invariance Relations (Q5325774) (← links)
• Automating Termination Proofs for CHR (Q5325775) (← links)
• Closures and Modules Within Linear Logic Concurrent Constraint Programming (Q5458864) (← links)
• Aggregates for CHR through Program Transformation (Q5504593) (← links)
• Generation of Rule-Based Constraint Solvers: Combined Approach (Q5504596) (← links)
• Verification from Declarative Specifications Using Logic Programming (Q5504672) (← links)
• Optimization of CHR Propagation Rules (Q5504675) (← links)
• Termination Analysis of CHR Revisited (Q5504676) (← links)