Jump to content

Talk:Nondeterministic constraint logic

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Mostly-duplicate page created

[edit]

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)[reply]

  checkY Merger complete. Klbrain (talk) 11:48, 9 August 2020 (UTC)[reply]