# Claire M. Bagley, Carlisle US

## Claire M. Bagley, Carlisle, MA US

Patent application number | Description | Published |
---|---|---|

20100036747 | INTERACTIVE PRODUCT CONFIGURATOR THAT ALLOWS MODIFICATION TO AUTOMATED SELECTIONS - A product configurator includes a constraint based network that includes a plurality of nodes. The configurator receives one or more user selections and generates one or more automatic selections to form a complete configuration. The configurator receives a request to change the configuration after forming the complete configuration, and retracts the automatic selections. For each of the retracted automatic selections, the configurator determines if the retracted automatic selection is a configuration-defining selection and reasserts the configuration-defining selections. | 02-11-2010 |

20100036787 | Dynamic Constraint Satisfaction Problem Solver That Recreates Structure Across Sessions - A dynamic constraint solver for solving a constraint satisfaction problem model receives a request for a current solving session to recreate a first solving session for the model. The solver then collects a deferred port list comprising one or more ports in the model that need a sub-problem and creates one or more runtime constraints for the model. For each of the created runtime constraints, the solver propagates the constraint and determines if the propagation generates a conflict. If the propagation generates a conflict, the solver dismisses the constraint and reverts the model to a state before the constraint was propagated. | 02-11-2010 |

20100037142 | INTERACTIVE PRODUCT CONFIGURATOR WITH DEFAULT DECISIONS - An interactive product configurator includes a constraint network having a plurality of nodes. The configurator receives a new user choice after previously asserting one or more default decisions. The configurator then retracts the previously asserted default decisions before asserting the new user choice. The default decisions are then reasserted. | 02-11-2010 |

20100037159 | INTERACTIVE PRODUCT CONFIGURATOR - A product configurator is based on a constraint network having a plurality of nodes. The product configurator, when it receives a user choice, determines which nodes in the constraint network are affected by the user choice. For each affected node, the product configurator stores the prior domain state of the node and associates the stored prior domain state with the user choice. Therefore, the nodes can be restored to their prior state if the user choice is later removed for any reason. | 02-11-2010 |

20100037162 | INTERACTIVE PRODUCT CONFIGURATOR WITH PERSISTENT COMPONENT ASSOCIATION - A constraint based product configurator determines a structure that is adapted to be associated with one or more components and determines if an arbitrary association is possible for the structure. If an arbitrary association is possible, the configurator associates a component with the structure and generates a component association choice for the association. The component association choice is an identity of the structure and the corresponding first component. | 02-11-2010 |

20100106670 | CONSTRAINT BASED SYSTEM WITH DYNAMIC CONSISTENCY CHECKING - A constraint based system solves a network that includes a first variable node having a first integer domain, a second variable node having a second integer domain, and a constraint for the first variable node and the second variable node. The system retrieves a first integer domain representation of the first integer domain and a second integer domain representation of the second integer domain and determines from the first and second integer domain representations if the first integer domain or second integer domain has at least one excluded value. The system then determines a type of constraint consistency checking based on whether the integer domains have at least one excluded value. | 04-29-2010 |

20100121795 | DYNAMIC CONSTRAINT SATISFACTION PROBLEM SOLVER - A system for solving a dynamic constraint satisfaction problem comprises a constraint network of variables and constraints. The system creates a first sub-problem model that includes a first model type, one or more first variables and zero or more first constraints. The system propagates the first constraints through the constraint network and determines if a first conflict is detected from propagating the first constraints. If the first conflict is detected, the system restores the constraint network variables to a first previous state before the first constraints were propagated. The system creates a first sub-problem set that includes a second model type and one or more sub-problem models. The system connects the first sub-problem model to the first sub-problem set via a second constraint and propagates the second constraint through the constraint network. | 05-13-2010 |

20100131872 | INTERACTIVE PRODUCT CONFIGURATOR WITH AUTOMATIC SELECTIONS - A product configurator comprises a constraint network having a plurality of nodes. The configurator allows a modeler to designate that one of more nodes of a configuration are input-required nodes. During an interactive session, the configurator may receive a request for an auto-completion of the configuration. The configurator will determine if an input has been received for the input-required nodes, and prohibit the auto-completion if the input has not been received. | 05-27-2010 |

20100191687 | DYNAMIC CONSTRAINT SOLVER WITH CROSS PROBLEM CONSTRAINTS - A dynamic constraint solver solves a constraint satisfaction problem that includes a problem having zero or more ports, and zero or more sub-problems coupled to the zero or more ports. The solver stores a cross problem constraint template for cross problem constraints. The solver receives a request to connect a first sub-problem to a first port of a first problem. The solver then determines if the first sub-problem forms a participating problem combination for the cross problem constraint template. The participating problem combination includes all participating problems of the cross problem constraint. The solver then generates the cross problem constraint for the participating problem combination if the first sub-problem forms the participating problem combination. | 07-29-2010 |

20100191688 | DYNAMIC CONSTRAINT SOLVER WITH RESOURCE SUM CONSTRAINTS - A solver for solving a dynamic constant satisfaction problem that includes a resource sum constraint and a port for coupling zero or more sub-problems to the problem. The solver couples a new sub-problem to the port. The solver then, based at least on the coupling, determines a revised resource sum domain for the problem, the revised resource sum domain including a contribution from existing participants and a contribution from potential participants. | 07-29-2010 |

20100198901 | Managing Floating Point Variables in Constraint Satisfaction Problems - Systems and methods for managing floating point variables are described in the present disclosure. According to one example, an embodiment of a method includes analyzing a constraint on a floating point variable in a system that supports both floating point variables and integer variables. The constraint is designed to have the ability to numerically limit the domain of the floating point variable. The method also includes determining whether or not the floating point variable can be handled as an integer variable and converting the floating point variable to a pseudo integer variable when it is determined that the floating point variable can be handled as an integer variable. This conversion of the floating point variable to a pseudo integer variable allows the domain of the floating point variable to be processed as an integer domain. | 08-05-2010 |

20100268678 | Dynamic Constraint Satisfaction Problem Solver with Hierarchical Union Constraints - A dynamic constraint solver system for solving a constraint satisfaction problem model includes a plurality of ports. The system defines a hierarchical union that includes all problems in a lower port that is in a problem under another port in the model. The system generates a constraint that computes a cardinality of the hierarchical union and determines an included set and an excluded set for the hierarchical union. The system then propagates the included set and excluded set to participating ports of the hierarchical union. | 10-21-2010 |

20100274747 | Constraint Processing with Zero Value Handling - Systems and methods for managing floating point variables are described in the present disclosure. According to one example, an embodiment of a method is described. The method comprises providing a floating point variable having a domain that includes a flag representing whether a specific value is included in or excluded from the domain of the floating point variable. The method also includes analyzing a constraint on the floating point variable to determine if the constraint excludes the specific value from the domain of the floating point variable. A value of the flag is manipulated to indicate that the specific value is excluded from the domain of the floating point variable if it is determined that the constraint excludes the specific value. In some cases, the specific value can be the value zero, for example. | 10-28-2010 |

20100274748 | Dynamic Constraint Satisfaction Problem Solver With Part-Whole Hierarchy Constraints - A constraint solver for solving a constraint satisfaction problem model which includes at least one part-whole hierarchy assigns variables to each part of the part-whole hierarchy. The variables include at least one of selected, quantity, and relative quantity, wherein each part has a parent. The solver automatically applies at least one part-whole hierarchy constraint to the part and solves the model and generates a solution. | 10-28-2010 |

20100274749 | Constraint Based System With Domain Splitting - A solver for a constraint satisfaction problem includes a plurality of variables and a plurality of constraints. A floating point variable has a domain and is assigned a value by first determining if a predetermined value can be assigned to the floating point variable if the predetermined value is in the domain. If not, the solver determines if a bound of the domain can be assigned to the floating point variable. If the predetermined value can not be assigned to the floating point variable and the bound of the domain can not be assigned to the floating point variable, the solver assigns a value to the floating point variable using domain splitting. | 10-28-2010 |

20100318483 | CONSTRAINT SATISFACTION PROBLEM SOLVER WITH INTERACTIVE CONFLICT RESOLUTION - A solver solves constraint satisfaction problems. The solver receives a user decision and propagates the user decision over a constraint satisfaction problem network. The solver then determines if there is a conflict on the network based on the propagation. If there is a conflict, the solver allows a user to resolve the conflict interactively by either canceling the user decision or dropping one or more previously made user decisions. | 12-16-2010 |

20100332435 | CONSTRAINT BASED SYSTEM THAT IDENTIFIES TOP CONSTRAINT EXPRESSIONS - A constraint solver solves a constraint satisfaction problem (“CSP”) that includes a network of variables and constraints. The solver receives a sub-expression and determines if the sub-expression is an internal constraint of the CSP. The internal constraint has a supporting operator expression. If the sub-expression is an internal constraint, the solver determines any or all top constraint expressions associated with the supporting operator expression. | 12-30-2010 |

20110022557 | DYNAMIC CONSTRAINT SATISFACTION PROBLEM SOLVER WITH INFERRED PROBLEM ASSOCIATION REMOVAL - A constraint solver for solving a constraint satisfaction problem network that comprises a plurality of nodes and a plurality of constraints. The solver receives a request to remove an inferred problem association and determines one or more user decisions that triggered the inferred problem association. | 01-27-2011 |

20110093421 | DYNAMIC CONSTRAINT SATISFACTION PROBLEM SOLVER WITH SUB-PROBLEM PLACEHOLDER - A dynamic constraint solver for solving a constraint satisfaction problem network that includes a plurality of nodes and a plurality of constraints determines a cardinality for a set of sub-problems. The cardinality is a numeric domain that represents the minimum number of instances in a port. The solver determines if a number of identifiable instances of sub-problems is less than the minimum number of instances. The solver then causes a user interface to display the identifiable instances and a placeholder for each instance that is below the minimum number of instances and is not identifiable. | 04-21-2011 |