The present disclosure relates to a computer-implemented method. The computer-implemented method includes applying a plurality of operations to an initialized state, creating a state graph, executing a plurality of business rules based on the adding of the plurality of nodes and the plurality of attributes to the top level state and updating the state graph. The state is a top level object. The state graph is created by adding a plurality of nodes and a plurality of attributes to a top level state. The state graph is updated to reflect a new state of the state graph. Further, the applying, the creating, the executing and the updating are performed through a plurality of phases.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A computer-implemented method comprising: applying, with a processor, a plurality of operations to an initialized state, wherein the state being a top level object; creating, with the processor, a state graph, wherein the state graph being created by adding a plurality of nodes and a plurality of attributes to a top level state; executing, with the processor, a plurality of business rules based on the adding of the plurality of nodes and the plurality of attributes to the top level state; and updating, with the processor, the state graph, wherein the state graph is updated to reflect a new state of the state graph, wherein the applying, the creating, the executing and the updating being performed through a plurality of phases. 2. The computer-implemented method as claimed in claim 1, further comprising adding, with the processor, an input link to the initialized state, wherein the input link being configured to allow a plurality of users to add one or more elements to a working memory. 3. The computer-implemented method as claimed in claim 1, further comprising adding, with the processor, an output link to the initialized state, wherein the output link being configured to allow plurality of business rules to add one or more elements to an output memory. 4. The computer-implemented method as claimed in claim 1, wherein the plurality of phases comprises an input phase, an elaboration phase, an operator proposal phase, an operator selection phase, an operator application phase and an output phase. 5. The computer-implemented method as claimed in claim 1, wherein one or more variables being bound to one or more symbols in corresponding one or more elements of a working memory to obtain a production. 6. The computer-implemented method as claimed in claim 5, wherein an action of the production creates a plurality of preferences for selecting one or more operators, wherein each of the plurality of preferences comprises a corresponding semantic of a plurality of semantics, and wherein the plurality of preferences comprises at least one of an acceptable preference, a reject preference, a better/worse preference, a best preference, a worst preference, an indifferent preference, a numeric-indifferent preference, a require preference and a prohibit preference. 7. The computer-implemented method as claimed in claim 6, wherein a plurality of impasses arises from the plurality of preferences, wherein the plurality of impasses comprises a tie impasse, a conflict impasse, a constraint-failure impasse and a no-change impasse, wherein the no-change impasse further comprises a state no-change impasse and an operator no-change impasse. 8. The computer-implemented method as claimed in claim 5, wherein an action of the production adds one or more elements in a working memory, and wherein the one or more elements being added from at least one of a plurality of sources. 9. The computer-implemented method as claimed in claim 5, wherein an action of the production removes one or more elements from a working memory, and wherein the one or more elements being removed by at least one of a plurality of removal ways. 10. A computer program product comprising a non-transitory computer readable medium storing a computer readable program, wherein the computer readable program when executed on a computer causes the computer to perform steps comprising: applying a plurality of operations to an initialized state, wherein the state being a top level object; creating a state graph, wherein the state graph being created by adding a plurality of nodes and a plurality of attributes to a top level state; executing a plurality of business rules based on the adding of the plurality of nodes and the plurality of attributes to the top level state; and updating the state graph, wherein the state graph is updated to reflect a new state of the state graph, wherein the applying, the creating, the executing and the updating being performed through a plurality of phases. 11. The computer program product as claimed in claim 10, wherein the computer readable program when executed on the computer causes the computer to perform a further step of adding an input link to the initialized state, wherein the input link being configured to allow a plurality of users to add one or more elements to a working memory. 12. The computer program product as claimed in claim 10, wherein the computer readable program when executed on the computer causes the computer to perform a further step of adding an output link to the initialized state, wherein the output link being configured to allow a plurality of business rules to add one or more elements to an output memory. 13. A cognitive agent business rules system comprising: an application module, in a processor, wherein the application module being configured to apply a plurality of operations to an initialized state, wherein the state being a top level object; a generation module, in the processor, wherein the generation module being configured to create a state graph, wherein the state graph being created by adding a plurality of nodes and a plurality of attributes to a top level state; an execution module, in the processor, wherein the execution module being configured to execute a plurality of business rules based on the adding of the plurality of nodes and the plurality of attributes to the top level state; and an updation module, in the processor, wherein the updation module being configured to update the state graph, wherein the state graph is updated to reflect a new state of the state graph. 14. The cognitive agent business rules system as claimed in claim 13, wherein the generation module, in the processor, being further configured to add an input link to the initialized state, wherein the input link being configured to allow a plurality of users to add one or more elements to a working memory. 15. The cognitive agent business rules system as claimed in claim 13, wherein the generation module, in the processor, being further configured to add an output link to the initialized state, wherein the output link being configured to allow a plurality of business rules to add one or more elements to an output memory. 16. The cognitive agent business rules system as claimed in claim 13, wherein the cognitive agent business rules system comprises a Soar component. 17. The cognitive agent business rules system as claimed in claim 16, wherein the Soar component comprises one or more views, wherein the one or more views comprises at least one of a trace view, a production view and a goal stack view. 18. The cognitive agent business rules system as claimed in claim 16, wherein the Soar component handles one or more events by utilizing SoarEventManager and SoarEventListener interfaces. 19. The cognitive agent business rules system as claimed in claim 13, wherein one or more variables being bound to one or more symbols in corresponding one or more elements of a working memory to obtain a production. 20. The cognitive agent business rules system as claimed in claim 19, wherein an action of the production creates a plurality of preferences for selecting one or more operators, wherein each of the plurality of preferences comprises a corresponding semantic of a plurality of semantics, and wherein the plurality of preferences comprises at least one of an acceptable preference, a reject preference, a better preference, a best preference, a worst preference, an indifferent preference, a numeric-indifferent preference, a require preference and a prohibit preference.