Boolean Algebra for Claim Mapping and Analysis

Patent metadata

Field	Value
Publication number	US-2016342894-A1
Application number	US-201415114521-A
Country	US
Kind code	A1
Filing date	Apr 2, 2014
Priority date	Apr 2, 2014
Publication date	Nov 24, 2016
Grant date	—

Abstract

Some aspects of this specification describe the use of Boolean algebra for patent claim mapping and analysis. In some instances, characteristics of a collection of technologies are represented as binary variables, and each of the technologies has a respective subset of the characteristics. The collection of technologies is represented as a collection of binary functions, and each binary function includes a respective subset of the binary variables. A patent claim is generated based on inverting the binary functions according to Boolean algebra.

First claim

What is claimed is:

1 . A method comprising:
representing characteristics of a plurality of technologies as binary variables, each of the technologies comprising a respective subset of the characteristics; representing the plurality of technologies as a plurality of binary functions, each binary function comprising a respective subset of the binary variables; and generating a patent claim based on inverting the binary functions according to Boolean algebra.

2 . The method of claim 1 , wherein the patent claim is directed to innovative aspects of an invention, and the binary functions represent prior art technologies.

3 . The method of claim 1 , wherein generating the patent claim comprises generating a new patent claim that differs in scope from one or more prior patent claims, and the binary functions represent the prior patent claims.

4 . The method of claim 1 , further comprising:
comparing the generated patent claim to a second patent claim; and detecting, based on the comparison, that the second patent claim was generated based on Boolean algebra.

5 . The method of claim 1 , wherein the binary variables define a concept domain, the plurality of technologies correspond to a first subspace within the domain, and the patent claim corresponds to a second, non-overlapping subspace within the domain.

6 . The method of claim 5 , wherein the plurality of binary functions comprises a first plurality of binary functions, and generating the patent claim comprises:
identifying a second plurality of binary functions outside the first subspace; and converting at least one of the second plurality of binary functions to a patent claim.

7 . The method of claim 5 , comprising generating a graphical representation of the concept domain, the graphical representation comprising a visual indication of the first and second subspaces within the domain.

8 . The method of claim 1 , further comprising:
generating a patent application that includes the patent claim; and submitting the patent application to a patent office.

9 . The method of claim 1 , comprising:
identifying a new technology; superimposing a Boolean inversion of other technology with a Boolean representation of the new technology; and generating an independent claim based on an intersection identified by the superimposing.

10 . A computer system comprising:
memory storing instructions that are executable; and one or more processing devices adapted to execute the instructions to perform operations comprising:
representing characteristics of a plurality of technologies as binary variables, each of the technologies comprising a respective subset of the characteristics;
representing the plurality of technologies as a plurality of binary functions, each binary function comprising a respective subset of the binary variables; and
generating a patent claim based on inverting the binary functions according to Boolean algebra.

11 . The computer system of claim 10 , wherein the patent claim is directed to innovative aspects of an invention, and the binary functions represent prior art technologies.

12 . The computer system of claim 10 , wherein generating the patent claim comprises generating a new patent claim that differs in scope from one or more prior patent claims, and the binary functions represent the prior patent claims.

13 . The computer system of claim 10 , wherein the binary variables define a concept domain, the plurality of technologies correspond to a first subspace within the domain, and the patent claim corresponds to a second, non-overlapping subspace within the domain.

14 . The computer system of claim 13 , the operations further comprising generating a graphical representation of the concept domain, the graphical representation comprising a visual indication of the first and second subspaces within the domain.

15 . The computer system of claim 10 , the operations further comprising:
generating a patent application that includes the patent claim; and submitting the patent application to a patent office.

16 . A non-transitory computer-readable medium storing instruction that are operable, when executed by data processing apparatus, to perform operations comprising:
representing characteristics of a plurality of technologies as binary variables, each of the technologies comprising a respective subset of the characteristics; representing the plurality of technologies as a plurality of binary functions, each binary function comprising a respective subset of the binary variables; and generating a patent claim based on inverting the binary functions according to Boolean algebra.

17 . The non-transitory computer-readable medium of claim 16 , wherein the patent claim is direct to innovative aspects of an invention, and the binary functions represent prior art technologies.

18 . The non-transitory computer-readable medium of claim 16 , wherein generating the patent claim comprises generating a new patent claim that differs in scope from one or more prior patent claims, and the binary functions represent the prior patent claims.

19 . The non-transitory computer-readable medium of claim 16 , the operations further comprising:
comparing the generated patent claim to a second patent claim; and detecting, based on the comparison, that the second patent claim was generated based on Boolean algebra.

20 . The non-transitory computer-readable medium of claim 16 , wherein the binary variables define a concept domain, the plurality of technologies correspond to a first subspace within the domain, and the patent claim corresponds to a second, non-overlapping subspace within the domain.

21 . The non-transitory computer-readable medium of claim 20 , the operations further comprising generating a graphical representation of the concept domain, the graphical representation comprising a visual indication of the first and second subspaces within the domain.

Assignees

• Halliburton Energy Services Inc

Inventors

• Surjaatmadja Jim B
• Funkhouser James Douglas

Classifications

• G06N5/02 Primary

  Knowledge representation; Symbolic representation · CPC title

• G06F17/18

  for evaluating statistical data {, e.g. average values, frequency distributions, probability functions, regression analysis (forecasting specially adapted for a specific administrative, business or logistic context G06Q10/04)} · CPC title

• G06Q50/184

  Intellectual property management · CPC title

• G06F17/10 Primary

  Complex mathematical operations {(function generation by table look-up G06F1/03; evaluation of elementary functions by calculation G06F7/544)} · CPC title

• G06Q50/00

  Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism (healthcare informatics G16H) · CPC title