Talk:Nondeterministic constraint logic
Jump to navigation
Jump to search
 | This article has not yet been rated on Wikipedia's content assessment scale. |
 | The contents of the Constraint logic problem page were merged into Nondeterministic constraint logic on 9 August 2020. For the contribution history and old versions of the redirected page, please see its history; for the discussion at that location, see its talk page. |
Mostly-duplicate page created
Constraint Logic Problem covers essentially the same material as this page, so they should be merged. The only thing not covered in this article is constraint graph satisfaction, which could be described as a variant. NCL is the most commonly used source problem, so I think keeping NCL as the page title is appropriate. Jeffrey Bosboom (talk) 07:32, 28 May 2019 (UTC)
Merger complete. Klbrain (talk) 11:48, 9 August 2020 (UTC)
