Wikipedia:Articles for deletion/Subclass reachability
- The following discussion is an archived debate of the proposed deletion of the article below. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.
The result was merge to Concept class. Sandstein 10:22, 11 December 2021 (UTC)
[Hide this box] New to Articles for deletion (AfD)? Read these primers!
- Subclass reachability (edit | talk | history | protect | delete | links | watch | logs | views) – (View log | edits since nomination)
- (Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL)
PROD'd per discussion at Wikipedia talk:WikiProject Mathematics#Subclass reachability, where commenters Jochen Burghardt and Caleb Stanford did not believe it was notable as a standalone or that it ought to be merged anywhere. On a search I have found no sources indicating that this is even used as a technical term, let alone a notable one.
De-PROD'd by Spinningspark who recommended "Merge to reachability problem", except that article does not mention this term, and no reliable sources mention this term in that context, so that would not be appropriate in my opinion. ♠PMC♠ (talk) 00:32, 25 November 2021 (UTC)
- Is it relevant that the target article does not mention it? If it did already, then a merge would not be necessary, and if it doesn't then the merge will make it so. It's true that finding the phrase "subclass reachability" is rare, but that doesn't mean the concept is rare. There are plenty of papers talking about the reachability of subclasses, [1][2] for instance. SpinningSpark 13:52, 25 November 2021 (UTC)
- Note: This discussion has been included in the list of Mathematics-related deletion discussions. ♠PMC♠ (talk) 00:32, 25 November 2021 (UTC)
- Note: This discussion has been included in the list of Computing-related deletion discussions. ♠PMC♠ (talk) 00:32, 25 November 2021 (UTC)
- Comment The concept seems to exist [3]. But I agree, the term is not widely used. It seems a minor definition in the context of concept classes. That may be a possible merge target, but I an not sure it warrants it. --
{{u|Mark viking}} {Talk}
11:09, 25 November 2021 (UTC) - Merge to
Reachability problem. SpinningSpark 13:40, 25 November 2021 (UTC)- Striking target and deferring to Duckmather who clearly has a better understanding of the subject than I do. SpinningSpark 10:17, 4 December 2021 (UTC)
- Delete no references to establish sufficient notability even for a merge. PianoDan (talk) 23:09, 25 November 2021 (UTC)
- Comment user:Duckmather has expanded the article and added a source. SpinningSpark 11:04, 28 November 2021 (UTC)
- Comment h/t User:Mark viking for finding this source! (I'll look for more sources; though I haven't been able to find an RS that uses the phrase "subclass reachability" per se, it seems that there are scholarly articles that mention the idea of a subclass and of being reachable separately. Also from my extremely limited understanding, it seems that the two papers found by User:SpinningSpark are about variants of a Reachability problem in general, and not something about computational learning theory in particular.) Duckmather (talk) 21:12, 28 November 2021 (UTC)
Relisted to generate a more thorough discussion and clearer consensus.
Relisting comment: Evaluate expansion
Please add new comments below this notice. Thanks, Daniel (talk) 02:12, 3 December 2021 (UTC)
- Merge, to Reachability problem. I've added a reference but I don't think that this topic is sufficiently notable for a stand-alone article. SailingInABathTub (talk) 11:17, 3 December 2021 (UTC)
- Merge to Concept class (or some other article relating to computational learning theory). AFAICT the general idea of a reachability problem is basically determining whether it's possible for a system to reach a certain state, whereas the idea of "subclass reachability" as described in this article is instead about a special property of certain subsets of sets of sets important in computational learning theory, so merging to Reachability problem would be inappropriate and create a confusing Frankenstein article. (I'm starting to doubt whether I can find good sources on this topic - some frantic Google Scholar searches like this one or this other one don't seem to turn up anything else related to this particular idea, at least of the papers I checked out - so that's why I'm not !voting for Keep.) Duckmather (talk) 09:51, 4 December 2021 (UTC)
- Merge to Concept class. Thanks go to Duckmather for investigating this topic more thoroughly and adding citations for verification. Given the development, I think WP:HEY applies for a merge to concept class. --
{{u|Mark viking}} {Talk}
18:46, 4 December 2021 (UTC)
- The above discussion is preserved as an archive of the debate. Please do not modify it. Subsequent comments should be made on the appropriate discussion page (such as the article's talk page or in a deletion review). No further edits should be made to this page.