The allowance rate statistics for class 705 reflect how difficult it is for a patent applicant to overcome an Alice rejection, but a close reading of the Federal Circuit’s opinion in Enfish, LLC v. Microsoft Corporation suggests a way forward. In that case, the Federal Circuit reversed a determination that a claim was directed to ineligible subject matter because “the district court oversimplified the self-referential component of the claims and downplayed the invention’s benefits.” However, the “self-referential component” wasn’t explicitly recited in the claim in question. Instead, it was incorporated as part of the supporting structure for a “means for configuring” that the claim actually did recite. Given that how a claim’s limitations should be treated when determining what it is “directed to” is often a point of contention when analyzing subject matter eligibility, the fact that means + function limitations are required by statute to be construed as covering the supporting structure described in the specification and its equivalents could provide a useful tool for responding to Alice rejections.
So can using means + function language in this way actually overcome Alice rejections? Yes, but examiners hate it. In one example from my practice, we were able to overcome an Alice rejection using a pre-appeal brief by pointing out that the rejection relied on improperly interpreting a software implemented means + function limitation as simply “a computer configured to perform processes.” Unfortunately, rather than this leading to the application being allowed, the result was that prosecution was re-opened with an 89 page long office action that attacked the means + function language at length for (allegedly) being both indefinite and not properly supported. Ultimately, we were able to overcome those rejections as well, but it required submission of a declaration walking through the corresponding structure in the specification and explaining how it would be understood by one of ordinary skill in the art. I believe the fact that we got the rejections in the first place and had to make such a submission to overcome them reflects a significant level discomfort on the part of the examiner (which I believe is much less the exception than the rule within the PTO) with software implemented means plus function limitations. Nevertheless, despite the fact that it might require dealing with an unfamiliar mode of analysis, if you’re faced with an Alice rejection, means + function language might just be the one weird trick you need to get a patent.
For a version of this post with supporting citations, see here.