Wikipedia:Articles for deletion/Natural Constraint Language: Difference between revisions
Content deleted Content added
SophiePaul (talk | contribs) |
SophiePaul (talk | contribs) |
||
| Line 11: | Line 11: | ||
:::I was able to take a ''bit'' more out of it. (I must be a very clever fellow!) I gathered that this theory or research had to do with solving complex problems involving constraints (how do I paint the map with a limited palette, so that no border has the same color on either side? What's the best way from here to the zoo, avoiding traffic jams, stop lights, and extra miles, with each factor weighted?) These problems are mathematically hard, from what I'm told. Solving them is one of the few things humans usually do better with than computers. I don't know enough about the field to suggest a merger subject, but I did want to point out that this seems to be well written technical material of the sort we ought to save somehow if possible. The two articles do seem to be mergeable, though. - [[User:Ihcoyc|Smerdis of Tlön]] - [[User talk:Ihcoyc|killing the human spirit since 2003!]] 20:29, 8 June 2011 (UTC) |
:::I was able to take a ''bit'' more out of it. (I must be a very clever fellow!) I gathered that this theory or research had to do with solving complex problems involving constraints (how do I paint the map with a limited palette, so that no border has the same color on either side? What's the best way from here to the zoo, avoiding traffic jams, stop lights, and extra miles, with each factor weighted?) These problems are mathematically hard, from what I'm told. Solving them is one of the few things humans usually do better with than computers. I don't know enough about the field to suggest a merger subject, but I did want to point out that this seems to be well written technical material of the sort we ought to save somehow if possible. The two articles do seem to be mergeable, though. - [[User:Ihcoyc|Smerdis of Tlön]] - [[User talk:Ihcoyc|killing the human spirit since 2003!]] 20:29, 8 June 2011 (UTC) |
||
::::Well, now you're just talking about what an NP or NP-hard problem is, not anything this article could have contributed to your knowledge. But what does this Natural Constraint Language stuff have to do with any of that? Do you describe one of these problems and have it tell you if a solution is computable? Does it search for good solutions if perfect ones are too expensive? Or is this just a notation and perhaps an algebra for working these kinds of things on a whiteboard? Who can tell. [[User:Msnicki|Msnicki]] ([[User talk:Msnicki|talk]]) 20:37, 8 June 2011 (UTC) |
::::Well, now you're just talking about what an NP or NP-hard problem is, not anything this article could have contributed to your knowledge. But what does this Natural Constraint Language stuff have to do with any of that? Do you describe one of these problems and have it tell you if a solution is computable? Does it search for good solutions if perfect ones are too expensive? Or is this just a notation and perhaps an algebra for working these kinds of things on a whiteboard? Who can tell. [[User:Msnicki|Msnicki]] ([[User talk:Msnicki|talk]]) 20:37, 8 June 2011 (UTC) |
||
:::::People can understand very well that if a mathematician describes an industrial problem naturally in conventional mathematical logic and a computer language can recognize it and solve it efficiently, it is fantastic. NCL can do this. NCL aims to solve industrial problems such as logistics optimization, production scheduling, human resources optimization and other problems. So this is a very hard research and very interesting, though it may be a long and lonely work. [[User:SophiePaul|SophiePaul]] ([[User talk:SophiePaul|talk]]) 12:10, 9 June 2011 (UTC) |
|||
*'''Delete'''. The article is based on primary sources by a single author, and therefore doesn't satisfy [[WP:GNG]]. I spent some time searching [[Web of Science]] for more sources, but found nothing useful; I found only two citations of Dr Zhou's articles by other authors, and those papers didn't include any significant discussion of NCL. It seems that a company called Enginest [http://www.enginest.com/en/product2.asp?NID=89 uses NCL], but I don't think that counts as an independent source since Dr Zhou [http://www.enginest.cn/en/ne.asp?NID=163 seems to be affiliated with them]. I agree with [[User:Ihcoyc|Smerdis of Tlön]] that the article looks interesting and it would be nice to retain this content. However, without seeing an independent source, ideally a secondary source, it's hard to justify keeping it. [[User:Jowa fan|Jowa fan]] ([[User talk:Jowa fan|talk]]) 06:53, 9 June 2011 (UTC) |
*'''Delete'''. The article is based on primary sources by a single author, and therefore doesn't satisfy [[WP:GNG]]. I spent some time searching [[Web of Science]] for more sources, but found nothing useful; I found only two citations of Dr Zhou's articles by other authors, and those papers didn't include any significant discussion of NCL. It seems that a company called Enginest [http://www.enginest.com/en/product2.asp?NID=89 uses NCL], but I don't think that counts as an independent source since Dr Zhou [http://www.enginest.cn/en/ne.asp?NID=163 seems to be affiliated with them]. I agree with [[User:Ihcoyc|Smerdis of Tlön]] that the article looks interesting and it would be nice to retain this content. However, without seeing an independent source, ideally a secondary source, it's hard to justify keeping it. [[User:Jowa fan|Jowa fan]] ([[User talk:Jowa fan|talk]]) 06:53, 9 June 2011 (UTC) |
||
Revision as of 12:10, 9 June 2011
- Natural Constraint Language (edit | talk | history | protect | delete | links | watch | logs | views) – (View log)
- (Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL)
No independent secondary sources to establish notability as required by WP:GNG. A search suggests independent sources may not exist. The only contributors to the article are WP:SPAs. Msnicki (talk) 13:27, 8 June 2011 (UTC)
- Note: This debate has been included in the list of Computing-related deletion discussions.
- Comment. Both this article and the companion article Mixed Set Programming (see Wikipedia:Articles for deletion/Mixed Set Programming) seem to be referenced entirely to the work of one "J. Zhou". They seem to be on highly technical subjects, but the style seems generally informative; they don't read like typical WP:COI text. If they're meant to promote something, I'm so far outside the target market that I didn't notice. No opinion yet on whether this should be kept or deleted. If one is kept, I suspect the other could be merged into it. - Smerdis of Tlön - killing the human spirit since 2003! 14:24, 8 June 2011 (UTC)
- It's certainly highly technical. But generally informative is another matter. I think I know enough about programming languages and compilers and what an NP-hard problem is that if an article on one these topics has been written WP:NOT#JARGON "for everyday readers, not for academics" that after reading it, I should be able guess what it's about. But I have no idea what this thing is or what it does. This article told me nothing. Do you write programs in this language and do they get compiled and run? What do they do? Who can tell. I'm guessing it's yet another academic (in this case a researcher at Microsoft) self-promoting his little-known work. WP:NOT PAPERS, WP:NOTPROMOTION, WP:INDISCRIMINATE Msnicki (talk) 15:22, 8 June 2011 (UTC)
- I was able to take a bit more out of it. (I must be a very clever fellow!) I gathered that this theory or research had to do with solving complex problems involving constraints (how do I paint the map with a limited palette, so that no border has the same color on either side? What's the best way from here to the zoo, avoiding traffic jams, stop lights, and extra miles, with each factor weighted?) These problems are mathematically hard, from what I'm told. Solving them is one of the few things humans usually do better with than computers. I don't know enough about the field to suggest a merger subject, but I did want to point out that this seems to be well written technical material of the sort we ought to save somehow if possible. The two articles do seem to be mergeable, though. - Smerdis of Tlön - killing the human spirit since 2003! 20:29, 8 June 2011 (UTC)
- Well, now you're just talking about what an NP or NP-hard problem is, not anything this article could have contributed to your knowledge. But what does this Natural Constraint Language stuff have to do with any of that? Do you describe one of these problems and have it tell you if a solution is computable? Does it search for good solutions if perfect ones are too expensive? Or is this just a notation and perhaps an algebra for working these kinds of things on a whiteboard? Who can tell. Msnicki (talk) 20:37, 8 June 2011 (UTC)
- People can understand very well that if a mathematician describes an industrial problem naturally in conventional mathematical logic and a computer language can recognize it and solve it efficiently, it is fantastic. NCL can do this. NCL aims to solve industrial problems such as logistics optimization, production scheduling, human resources optimization and other problems. So this is a very hard research and very interesting, though it may be a long and lonely work. SophiePaul (talk) 12:10, 9 June 2011 (UTC)
- Well, now you're just talking about what an NP or NP-hard problem is, not anything this article could have contributed to your knowledge. But what does this Natural Constraint Language stuff have to do with any of that? Do you describe one of these problems and have it tell you if a solution is computable? Does it search for good solutions if perfect ones are too expensive? Or is this just a notation and perhaps an algebra for working these kinds of things on a whiteboard? Who can tell. Msnicki (talk) 20:37, 8 June 2011 (UTC)
- I was able to take a bit more out of it. (I must be a very clever fellow!) I gathered that this theory or research had to do with solving complex problems involving constraints (how do I paint the map with a limited palette, so that no border has the same color on either side? What's the best way from here to the zoo, avoiding traffic jams, stop lights, and extra miles, with each factor weighted?) These problems are mathematically hard, from what I'm told. Solving them is one of the few things humans usually do better with than computers. I don't know enough about the field to suggest a merger subject, but I did want to point out that this seems to be well written technical material of the sort we ought to save somehow if possible. The two articles do seem to be mergeable, though. - Smerdis of Tlön - killing the human spirit since 2003! 20:29, 8 June 2011 (UTC)
- It's certainly highly technical. But generally informative is another matter. I think I know enough about programming languages and compilers and what an NP-hard problem is that if an article on one these topics has been written WP:NOT#JARGON "for everyday readers, not for academics" that after reading it, I should be able guess what it's about. But I have no idea what this thing is or what it does. This article told me nothing. Do you write programs in this language and do they get compiled and run? What do they do? Who can tell. I'm guessing it's yet another academic (in this case a researcher at Microsoft) self-promoting his little-known work. WP:NOT PAPERS, WP:NOTPROMOTION, WP:INDISCRIMINATE Msnicki (talk) 15:22, 8 June 2011 (UTC)
- Delete. The article is based on primary sources by a single author, and therefore doesn't satisfy WP:GNG. I spent some time searching Web of Science for more sources, but found nothing useful; I found only two citations of Dr Zhou's articles by other authors, and those papers didn't include any significant discussion of NCL. It seems that a company called Enginest uses NCL, but I don't think that counts as an independent source since Dr Zhou seems to be affiliated with them. I agree with Smerdis of Tlön that the article looks interesting and it would be nice to retain this content. However, without seeing an independent source, ideally a secondary source, it's hard to justify keeping it. Jowa fan (talk) 06:53, 9 June 2011 (UTC)
- Delete. I don't see independent coverage. Self-promotion of academic topics is still self-promotion. FuFoFuEd (talk) 10:35, 9 June 2011 (UTC)
- Please do not delete. 1) Please retain the articles "Natural Constraint Language" and "Mixed Set Programming". They are about new subjects, fundamental and are significant for industrial applications. Independent research work since more than 12 years by J.Zhou (who is not in academy, no need for academic promotion) should be respected scientifically. A search for "NCL Constraint Language" on Google can tell that there are many sources about NCL and MSP. 2) Please do not merge NCL and MSP. They are different subjects. "Natural Constraint Language" is about a computer programming language for modeling and solving problems. "Mixed Set Programming" is about an algorithmic framework. 3) For NCL, there is a journal paper "J.Zhou. Introduction to the constraint language NCL. JLP 45(1-3): 71-103(2000)". A book "The NCL Natural Constraint Language" in English will be published soon. These two Wikipedia articles will also be further developed to provide readers with detailed knowledge. Merci. SophiePaul (talk) 11:46, 9 June 2011 (UTC)