Talk:Constraint Handling Rules

This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Computing Low‑importance This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles Low This article has been rated as Low-importance on the project's importance scale.

To-do list for Constraint Handling Rules: edit · history · watch · refresh · Updated 2016-11-20 Here are some tasks awaiting attention: Expand : Add information about: hardware-accelerated implementations of Constraint Handling Rules Constraint handling rule grammars and other applications of CHR in natural language processing Type inference systems using CHR

As I understood it, CHRs are interesting mainly because confluence is decidable (which is what sets them apart from general logic programming and term rewriting systems). Is this the case? If so, I guess that article ought to mention this, although I don't feel qualified to write the material... Megacz (talk) 20:14, 17 January 2008 (UTC)[reply]

Confluence is decidable if the program is terminating (because critical pairs are computable [Confluence and Semantics of Constraint Simplification Rules]). Some details for the (undecidable) general case in [On Confluence of Non-terminating CHR Program].88.174.104.199 (talk) 20:45, 11 July 2008 (UTC)[reply]

I'm not sure what the article means by "executed in a committed-choice manner", and I know a fair amount about Prolog, to which CHR is being compared in the early part of the article.Hardmath (talk) 14:41, 13 April 2010 (UTC)[reply]

Hardmath: committed-choice means "no backtracking". When Prolog finds a choice point, it records it, tries one of the options and backtracks to the choice point for further exploration upon failure. When CHR finds a choice point (multiple rules that can match the constraint store), it makes a choice and sticks with it. QVVERTYVS (hm?) 17:50, 23 December 2014 (UTC)[reply]