Patents by Inventor Claire M. Bagley
Claire M. Bagley has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8229869Abstract: 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.Type: GrantFiled: April 22, 2009Date of Patent: July 24, 2012Inventors: Claire M. Bagley, Joyce Ng
-
Patent number: 8209276Abstract: 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.Type: GrantFiled: October 27, 2008Date of Patent: June 26, 2012Assignee: Oracle International CorporationInventors: Michael Colena, Joyce Ng, Claire M. Bagley
-
Patent number: 8170970Abstract: 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.Type: GrantFiled: June 24, 2009Date of Patent: May 1, 2012Assignee: Oracle International CorporationInventors: Claire M. Bagley, Joyce Ng, Michael Colena, Gao Chen
-
Patent number: 8165981Abstract: 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.Type: GrantFiled: April 27, 2009Date of Patent: April 24, 2012Assignee: Oracle International CorporationInventors: Michael Colena, Claire M. Bagley
-
Patent number: 8165980Abstract: 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.Type: GrantFiled: January 23, 2009Date of Patent: April 24, 2012Assignee: Oracle International CorporationInventors: Gao Chen, Claire M. Bagley
-
Patent number: 8126834Abstract: 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.Type: GrantFiled: April 21, 2009Date of Patent: February 28, 2012Assignee: Oracle International CorporationInventors: Gao Chen, Claire M. Bagley
-
Publication number: 20110093421Abstract: 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.Type: ApplicationFiled: October 15, 2009Publication date: April 21, 2011Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Steven A. HUBERMAN, Claire M. Bagley, Martin P. Plotkin, David J. Kulik
-
Publication number: 20110022557Abstract: 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.Type: ApplicationFiled: July 27, 2009Publication date: January 27, 2011Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Claire M. BAGLEY, Gao CHEN, Joyce NG
-
Publication number: 20100332435Abstract: 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.Type: ApplicationFiled: June 24, 2009Publication date: December 30, 2010Applicant: Oracle International CorporationInventors: Claire M. BAGLEY, Joyce NG, Michael COLENA, Gao CHEN
-
Publication number: 20100318483Abstract: 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.Type: ApplicationFiled: June 12, 2009Publication date: December 16, 2010Applicant: ORACLE INTERNATIONAL CORPORATIONInventors: Claire M. Bagley, Joyce Ng, Gao Chen
-
Publication number: 20100274747Abstract: 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.Type: ApplicationFiled: April 22, 2009Publication date: October 28, 2010Applicant: Oracle International CorporationInventors: Claire M. Bagley, Joyce Ng
-
Publication number: 20100274748Abstract: 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.Type: ApplicationFiled: April 28, 2009Publication date: October 28, 2010Applicant: Oracle International CorporationInventors: Gao CHEN, Claire M. Bagley, Martin P. Plotkin
-
Publication number: 20100274749Abstract: 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.Type: ApplicationFiled: April 28, 2009Publication date: October 28, 2010Applicant: Oracle International CorporationInventors: Claire M. Bagley, Joyce Ng, Gao Chen, Martin P. Plotkin
-
Publication number: 20100268678Abstract: 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.Type: ApplicationFiled: April 21, 2009Publication date: October 21, 2010Applicant: Oracle International CorporationInventors: Gao Chen, Claire M. Bagley
-
Publication number: 20100198901Abstract: 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.Type: ApplicationFiled: February 5, 2009Publication date: August 5, 2010Applicant: Oracle International CorporationInventors: Claire M. Bagley, Joyce Ng
-
Publication number: 20100191687Abstract: 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.Type: ApplicationFiled: January 23, 2009Publication date: July 29, 2010Applicant: Oracle International CorporationInventors: Gao Chen, Claire M. Bagley
-
Publication number: 20100191688Abstract: 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.Type: ApplicationFiled: January 29, 2009Publication date: July 29, 2010Applicant: Oracle International CorporationInventors: Gao Chen, Claire M. Bagley
-
Publication number: 20100131872Abstract: 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.Type: ApplicationFiled: November 24, 2008Publication date: May 27, 2010Applicant: Oracle International CorporationInventors: Claire M. Bagley, David J. Kulik, Joyce Ng, Martin P. Plotkin, Gao Chen, Michael Colena
-
Publication number: 20100121795Abstract: 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.Type: ApplicationFiled: November 13, 2008Publication date: May 13, 2010Applicant: Oracle International CorporationInventors: Michael Colena, Claire M. Bagley, Gao Chen
-
Publication number: 20100106670Abstract: 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.Type: ApplicationFiled: October 27, 2008Publication date: April 29, 2010Applicant: Oracle International CorporationInventors: Michael Colena, Joyce Ng, Claire M. Bagley