Theory and practice of constraint handling rules

From MaRDI portal
Publication:4245936

DOI10.1016/S0743-1066(98)10005-5zbMath0920.68029OpenAlexW2079333278WikidataQ60358208 ScholiaQ60358208MaRDI QIDQ4245936

Thom Frühwirth

Publication date: 23 September 1999

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0743-1066(98)10005-5




Related Items (55)

ECLiPSe – From LP to CLPExecutable specifications for hypothesis-based reasoning with Prolog and Constraint Handling RulesQuasi-Linear-Time Algorithms by Generalisation of Union-Find in CHRTermination of floating-point computationsParsing as semantically guided constraint solving: the role of ontologiesShape Neutral Analysis of Graph-based Data-structuresAttributed Data for CHR IndexingIntegration of Abductive Reasoning and Constraint Optimization in SCIFFDemand-Driven Normalisation for ACD Term RewritingProving Termination by Invariance RelationsAutomating Termination Proofs for CHRThe expressive power of CHR with prioritiesConfluence Modulo Equivalence in Constraint Handling RulesAnalysis and Transformation of Constrained Horn Clauses for Program VerificationConstraint handling rules with binders, patterns and generic quantificationUnfolding for CHR programsProgramming in logic without logic programmingSplitting the Control Flow with Boolean FlagsAn Analysis of Slow Convergence in Interval PropagationUnnamed ItemUnnamed ItemUnnamed ItemUnnamed ItemPRISM revisited: declarative implementation of a probabilistic programming language using multi-prompt delimited controlOn proving confluence modulo equivalence for Constraint Handling Rules<scp>OutsideIn(X)</scp>Modular type inference with local assumptionsOn the Number of Rule Applications in Constraint ProgramsCHR in ActionExpressiveness of Multiple Heads in CHRWelcome to Constraint Handling RulesA Flexible Search Framework for CHRAdaptive CHR Meets CHR ∨Constructing Rule-Based Solvers for Intentionally-Defined ConstraintsImplementing Probabilistic Abductive Logic Programming with Constraint Handling RulesA Compositional Semantics for CHR with Propagation RulesCHR for Imperative Host LanguagesGuard Reasoning in the Refined Operational Semantics of CHRReactive Answer Set ProgrammingClosures and Modules Within Linear Logic Concurrent Constraint ProgrammingLogical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule prioritiesAbductive Logic GrammarsMonadic constraint programmingThe CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experimentsLocal consistency for extended CSPsLMNtal as a hierarchical logic programming languageType Inference using Constraint Handling RulesAggregates for CHR through Program TransformationGeneration of Rule-Based Constraint Solvers: Combined ApproachVerification from Declarative Specifications Using Logic ProgrammingOptimization of CHR Propagation RulesTermination Analysis of CHR RevisitedTransactions in Constraint Handling RulesCadmium: An Implementation of ACD Term RewritingEncoding Distributed Process Calculi into LMNtalModels and emerging trends of concurrent constraint programming


Uses Software



This page was built for publication: Theory and practice of constraint handling rules