PATENT CLAIM ANALYSIS

Application Number: 15901300
Application Type: Utility
Filing Date: 2018-02
Publication Date: 2019-02
Patent Classification: ["717", "104000"]

Abstract:
Technologies are provided for creating and using template constraint expressions in constraint-based systems. Template constraint expressions can be created that can be used to define multiple usages of a same constraint rule in a configuration model. Using the template constraint expression, the constraint rule can be translated once and used multiple times as different instances of the rule are activated. Updates to the rule can be made to the template constraint expression and applied to all of the related instances. Constraint expressions can be created based on the template constraint expression. Multiple object instances in a configuration model can be identified that satisfy matching criteria of the template constraint expression. Variables of the matching object instances can be mapped to variable placeholders in the template constraint expression to create constraint expressions. A constraint solver can be used to evaluate the constraint expressions.

Claim (Index 20):
One or more computer-readable media storing instructions that, when executed by one or more processors, cause the one or more processors to perform operations, the operations comprising:\n receiving a configuration model definition comprising an object instance graph and multiple configuration rule definitions; generating a template constraint expression for one of the configuration rule definitions, wherein the template constraint expression comprises matching criteria and a variable placeholder comprising a variable qualifier; generating multiple constraint expressions using the template constraint expression, wherein the generating the constraint expressions comprises:\n identifying multiple subgraphs of object instances in the object instance graph that satisfy the matching criteria of the template constraint expression, and \n generating a constraint expression for each of the identified subgraphs, wherein generating a constraint expression comprises mapping a variable of a subgraph to the variable placeholder of the template constraint expression using the variable qualifier; and \n evaluating the constraint expressions using a constraint solver.

Metadata:
- Claim Count in Document: 33.0
- Percentile: 88.0
- Lexical Diversity: 2.39683
- Patent Class: 717.0
- Transitional Phrase Type: open
- Component Type: 1
- Foreign Priority: False
- Related Applications: ['12490725', '14138870', '12579850', '13343613', '12407062']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.3730290408935974
- 35 USC 102 Novelty (BERT): 0.4790243937191553
- Combined Prediction Score: 0.3836285761761532
- Mean Citation Score: 182.285416
- Max Citation Score: 197.94814
- Similarity Product: 167.313496463902

Labels:
- Claim Label 101: 1
- Claim Label 102: 0
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 0
- Label 101 Adjusted: 1

Dataset: test