Patents by Inventor Martin P. Plotkin

Martin P. Plotkin 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: 9443210
    Abstract: 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: Grant
    Filed: November 24, 2008
    Date of Patent: September 13, 2016
    Assignee: Oracle International Corporation
    Inventors: Claire M. Bagley, David J. Kulik, Joyce Ng, Martin P. Plotkin, Gao Chen, Michael Colena
  • Patent number: 8694893
    Abstract: 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.
    Type: Grant
    Filed: October 27, 2008
    Date of Patent: April 8, 2014
    Assignee: Oracle International Corporation
    Inventors: Claire M. Bagley, Gao Chen, Martin P. Plotkin
  • Patent number: 8645302
    Abstract: 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: Grant
    Filed: April 28, 2009
    Date of Patent: February 4, 2014
    Assignee: Oracle International Corporation
    Inventors: Gao Chen, Claire M. Bagley, Martin P. Plotkin
  • Patent number: 8464156
    Abstract: 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.
    Type: Grant
    Filed: August 8, 2008
    Date of Patent: June 11, 2013
    Assignee: Oracle International Corporation
    Inventors: Claire M. Bagley, Martin P. Plotkin, Michael Colena
  • Patent number: 8458050
    Abstract: 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.
    Type: Grant
    Filed: November 13, 2008
    Date of Patent: June 4, 2013
    Assignee: Oracle International Corporation
    Inventors: Claire M. Bagley, Martin P. Plotkin, David J. Kulik, Michael Colena, Gao Chen, Joyce Ng
  • Patent number: 8335987
    Abstract: 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.
    Type: Grant
    Filed: August 7, 2008
    Date of Patent: December 18, 2012
    Assignee: Oracle International Corporation
    Inventors: Claire M. Bagley, Martin P. Plotkin, Michael Colena
  • Patent number: 8301582
    Abstract: 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: Grant
    Filed: October 15, 2009
    Date of Patent: October 30, 2012
    Assignee: Oracle International Corporation
    Inventors: Steven A. Huberman, Claire M. Bagley, Martin P. Plotkin, David J. Kulik
  • Patent number: 8229870
    Abstract: 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: Grant
    Filed: April 28, 2009
    Date of Patent: July 24, 2012
    Assignee: Oracle International Corporation
    Inventors: Claire M. Bagley, Joyce Ng, Gao Chen, Martin P. Plotkin
  • Publication number: 20110093421
    Abstract: 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: Application
    Filed: October 15, 2009
    Publication date: April 21, 2011
    Applicant: ORACLE INTERNATIONAL CORPORATION
    Inventors: Steven A. HUBERMAN, Claire M. Bagley, Martin P. Plotkin, David J. Kulik
  • Publication number: 20100274748
    Abstract: 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: Application
    Filed: April 28, 2009
    Publication date: October 28, 2010
    Applicant: Oracle International Corporation
    Inventors: Gao CHEN, Claire M. Bagley, Martin P. Plotkin
  • Publication number: 20100274749
    Abstract: 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: Application
    Filed: April 28, 2009
    Publication date: October 28, 2010
    Applicant: Oracle International Corporation
    Inventors: Claire M. Bagley, Joyce Ng, Gao Chen, Martin P. Plotkin
  • Publication number: 20100131872
    Abstract: 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: Application
    Filed: November 24, 2008
    Publication date: May 27, 2010
    Applicant: Oracle International Corporation
    Inventors: Claire M. Bagley, David J. Kulik, Joyce Ng, Martin P. Plotkin, Gao Chen, Michael Colena
  • Publication number: 20100037159
    Abstract: 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.
    Type: Application
    Filed: August 7, 2008
    Publication date: February 11, 2010
    Applicant: Oracle International Corporation
    Inventors: Claire M. Bagley, Martin P. Plotkin, Michael Colena
  • Publication number: 20100037162
    Abstract: 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.
    Type: Application
    Filed: October 27, 2008
    Publication date: February 11, 2010
    Applicant: Oracle International Corporation
    Inventors: Claire M. Bagley, Gao Chen, Martin P. Plotkin
  • Publication number: 20100036747
    Abstract: 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.
    Type: Application
    Filed: November 13, 2008
    Publication date: February 11, 2010
    Applicant: Oracle International Corporation
    Inventors: Claire M. Bagley, Martin P. Plotkin, David J. Kulik, Michael Colena, Gao Chen, Joyce Ng
  • Publication number: 20100037142
    Abstract: 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.
    Type: Application
    Filed: August 8, 2008
    Publication date: February 11, 2010
    Applicant: Oracle International Corporation
    Inventors: Claire M. Bagley, Martin P. Plotkin, Michael Colena
  • Patent number: 7302370
    Abstract: Systems and methods are presented for managing browser sessions in single and multi-server workflow environments. Aspects involve maintaining session state for browser sessions at a first application server process, while communicating with a second application server process. Other aspects involve monitoring user activity and server state from a browser that can initiate responsive actions in response to error conditions.
    Type: Grant
    Filed: November 17, 2003
    Date of Patent: November 27, 2007
    Assignee: Oracle International Corporation
    Inventors: Thomas W. Nickerson, Martin P. Plotkin