A production rules engine comprises: a class loader for loading a production rule ontology into a rule engine; a class loader for loading production rules into the rule engine, wherein a production rule comprises a rule and an action defined in the production rule ontology; instance creation logic for creating instances of production rules; a reasoner for executing the production rules and for locating an instance of a production rule having an inconsistency between an action to change the ontology and the existing ontology and for executing the production rules after inconsistencies have been fixed; a constraint engine for locating a solution to an inconsistent ontology; and a fixer for updating the inconsistent ontology with the located solution.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A production rules engine comprising: a class loader for loading a production rule ontology into a rules engine; a class loader for loading production rules into the rules engine, wherein a production rule comprises a rule and an action defined in the production rule ontology; a production instance creator for creating instances of the production rules; a reasoner for: executing the production rules, locating an instance of a production rule having an inconsistency between an action to change the production rule ontology and an existing ontology, and executing the production rules after production rule inconsistencies have been fixed; a constraint engine for locating a solution to an inconsistent ontology; and a fixer for updating the inconsistent ontology with a located solution. 2. The production rules engine according to claim 1, wherein the constraint engine generates more than one logical solution to the inconsistent ontology, and wherein the constraint engine chooses a logical solution to use when generating said more than one logical solution to the inconstant ontology. 3. The production rules engine according to claim 1, wherein ontologies and assertions are loaded into a data structure comprising a logical network of nodes. 4. The production rules engine according to claim 3, wherein the logical network of nodes is a RETE network that utilizes a RETE algorithm. 5. The production rules engine according to claim 4, wherein at runtime, logical nodes, within the logical network of nodes, are associated with local memory made up of tuples, wherein each tuple represents arguments of a fact asserted in the RETE algorithm. 6. The production rules engine according to claim 1, wherein production rules assertions are executed in order of priority, and wherein logical inconsistencies to ontologies are located in a rule by rule basis. 7. A method for operating a production rule engine, the method comprising: loading a production rule ontology into a production rule engine; loading production rules into the production rule engine, wherein a production rule comprises a rule and an action defined by use of the production rule ontology; executing, by one or more processors, the production rules; locating a logical inconsistency between an ontology changed by a respective action defined by use of the production rule ontology and an existing ontology; locating a logical solution to an inconsistent ontology; and updating the inconsistent ontology with the located logical solution. 8. The method according to claim 7, further comprising: generating more than one logical solution to the inconsistent ontology; and choosing a logical solution to use when generating said more than one logical solution to the inconsistent ontology. 9. The method according to claim 7, wherein ontologies and assertions are loaded into a data structure comprising a logical network of nodes. 10. The method according to claim 9, wherein the logical network of nodes is a RETE network that utilizes a RETE algorithm. 11. The method according to claim 10, wherein at runtime, logical nodes are associated with a local memory made of tuples, wherein each tuple represents arguments of a fact in the RETE algorithm. 12. The method according to claim 7, wherein production rules assertions are executed in order of priority, and wherein logical inconsistencies to the ontology are located in a rule by rule basis. 13. A computer program product for operating a production rule engine, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code readable and executable by a processor to perform a method comprising: loading a production rule ontology into a production rule engine; loading production rules into the production rule engine, wherein a production rule comprises a rule and an action defined by use of the production rule ontology; executing, by one or more processors, the production rules; locating a logical inconsistency between an ontology changed by a respective action defined by use of the production rule ontology and an existing ontology; locating a logical solution to an inconsistent ontology; and updating the inconsistent ontology with the located logical solution. 14. The computer program product of claim 13, wherein the method further comprises: generating more than one logical solution to the inconsistent ontology; and choosing a logical solution to use when generating said more than one logical solution to the inconsistent ontology. 15. The computer program product of claim 13, wherein ontologies and assertions are loaded into a data structure comprising a logical network of nodes. 16. The computer program product of claim 15, wherein the logical network of nodes is a RETE network that utilizes a RETE algorithm. 17. The computer program product of claim 16, wherein at runtime, logical nodes are associated with a local memory made of tuples, wherein each tuple represents arguments of a fact in the RETE algorithm. 18. The computer program product of claim 13, wherein production rules assertions are executed in order of priority, and wherein logical inconsistencies to the ontology are located in a rule by rule basis.