DETAILED ACTION
Notice of Pre-AIA or AIA Status
The present application, filed on or after March 16, 2013, is being examined under the first inventor to file provisions of the AIA .
Double Patenting
The nonstatutory double patenting rejection is based on a judicially created doctrine grounded in public policy (a policy reflected in the statute) so as to prevent the unjustified or improper timewise extension of the “right to exclude” granted by a patent and to prevent possible harassment by multiple assignees. A nonstatutory double patenting rejection is appropriate where the conflicting claims are not identical, but at least one examined application claim is not patentably distinct from the reference claim(s) because the examined application claim is either anticipated by, or would have been obvious over, the reference claim(s). See, e.g., In re Berg, 140 F.3d 1428, 46 USPQ2d 1226 (Fed. Cir. 1998); In re Goodman, 11 F.3d 1046, 29 USPQ2d 2010 (Fed. Cir. 1993); In re Longi, 759 F.2d 887, 225 USPQ 645 (Fed. Cir. 1985); In re Van Ornum, 686 F.2d 937, 214 USPQ 761 (CCPA 1982); In re Vogel, 422 F.2d 438, 164 USPQ 619 (CCPA 1970); In re Thorington, 418 F.2d 528, 163 USPQ 644 (CCPA 1969).
A timely filed terminal disclaimer in compliance with 37 CFR 1.321(c) or 1.321(d) may be used to overcome an actual or provisional rejection based on nonstatutory double patenting provided the reference application or patent either is shown to be commonly owned with the examined application, or claims an invention made as a result of activities undertaken within the scope of a joint research agreement. See MPEP § 717.02 for applications subject to examination under the first inventor to file provisions of the AIA as explained in MPEP § 2159. See MPEP §§ 706.02(l)(1) - 706.02(l)(3) for applications not subject to examination under the first inventor to file provisions of the AIA . A terminal disclaimer must be signed in compliance with 37 CFR 1.321(b).
The USPTO Internet website contains terminal disclaimer forms which may be used. Please visit www.uspto.gov/patent/patents-forms. The filing date of the application in which the form is filed determines what form (e.g., PTO/SB/25, PTO/SB/26, PTO/AIA /25, or PTO/AIA /26) should be used. A web-based eTerminal Disclaimer may be filled out completely online using web-screens. An eTerminal Disclaimer that meets all requirements is auto-processed and approved immediately upon submission. For more information about eTerminal Disclaimers, refer to www.uspto.gov/patents/process/file/efs/guidance/eTD-info-I.jsp.
Claim 5 is rejected on the ground of nonstatutory double patenting as being unpatentable over claim 6 of U.S. Patent No. 12,423,336. Although the claims at issue are not identical, they are not patentably distinct from each other because one of ordinary skill in the art would recognize that claim 6 of U.S. Patent No. 12,423,336 are directed to a similar invention because they anticipate the claims in the present application.
Claim
US 19/334,130
Claim
US 12,423,336
5
A method, comprising: receiving, by a computer system having a processor and a memory and a plurality of lines of instruction executed by the processor, a search query;
performing, by the computer system, a search process based on the search query to return a search result that matches the search query that includes a plurality of returned documents; selecting a returned document;
performing, by the computer system, a discovery process based on the selected returned document to generate a lexical map associated with the selected returned document, the lexical map having a plurality of nodes and a plurality of edges wherein each edge connects two nodes together and each node contains a phrase from the selected returned document;
receiving, by the computer system, a selection of a node in the lexical map wherein the selected node is fed back into the search process to form a discovery loop process;
perform a second search process based on the selected node in the lexical map;
and display a revised search result from the search query, the selected returned document, the selected node of the lexical map
6
A method, comprising:
receiving, by a computer system having a processor and a memory and a plurality of lines of instruction executed by the processor, a search query;
parsing, by the computer system, a plurality of events from the search query;
performing, by the computer system, a search process based on the search query to return a search result that matches the search query that includes a plurality of returned documents;
receiving, by the computer system, a selection of a returned document of the plurality of returned documents;
performing, by the computer system, a discovery process based on the selected returned document to generate a lexical map of the selected returned document, the lexical map having nodes and edges that connect two nodes together wherein each node is a phrase from the selected returned document;
receiving, by the computer system, a selection of a node in the lexical map that are fed back into the search process to form a discovery loop process that loops from content to the search result which is displayed as one of a document and a map and from a selected one of document and a node in the map to one of second documents and a second map;
performing, by the computer system, a second search process based on the selected node in the lexical map;
generating, by the computer system, a plot from a plurality of episodes, wherein the plot is a visual rendition of the plurality of events and a plurality of protagonists in the content;
aggregating the plurality of events into one or more situations and aggregating a causal chain of the one or more situations;
generating, by the computer system, each episode of the one or more episodes using a model of the episode having a model of the causal chain, a model of each protagonist to extract from an event of the plurality of events, and, a model to chain the plurality of events into said each episode and decide on a causative link and a questionnaire to close an open narrative closure (NC) and incrementally complete said each episode; and
displaying, by a display of the computer system, a revised search result from the search query, the selected returned document, and the selected node of the lexical map using the discovery loop process
Conclusion
Any inquiry concerning this communication or earlier communications from the examiner should be directed to WILLIAM P BARTLETT whose telephone number is (469)295-9085. The examiner can normally be reached on M-Th 11:30-8:30, F 11-3.
Examiner interviews are available via telephone, in-person, and video conferencing using a USPTO supplied web-based collaboration tool. To schedule an interview, applicant is encouraged to use the USPTO Automated Interview Request (AIR) at http://www.uspto.gov/interviewpractice.
If attempts to reach the examiner by telephone are unsuccessful, the examiner’s supervisor, Sherief Badawi can be reached on 571-272-9782. The fax phone number for the organization where this application or proceeding is assigned is 571-273-8300.
Information regarding the status of an application may be obtained from the Patent Application Information Retrieval (PAIR) system. Status information for published applications may be obtained from either Private PAIR or Public PAIR. Status information for unpublished applications is available through Private PAIR only. For more information about the PAIR system, see http://pair-direct.uspto.gov. Should you have questions on access to the Private PAIR system, contact the Electronic Business Center (EBC) at 866-217-9197 (toll-free). If you would like assistance from a USPTO Customer Service Representative or access to the automated information system, call 800-786-9199 (IN USA OR CANADA) or 571-272-1000.
/WILLIAM P BARTLETT/
Primary Examiner, Art Unit 2169
Prosecution Insights