1. A method for optimal representation of a plan state while generating a plan to complete a task in a computing environment, wherein the optimal representation of the plan state improves efficiency of the computing environment through improved utilization of memory and reduction of overhead from data retrieval, the method comprising: providing a processor and a non-transitory memory coupled to said processor, wherein the non-transitory memory comprises programmed instructions; representing a plan state including one or more tasks, via the processor and the non-transitory memory, the plan state comprising a first dataset and a second dataset, wherein the second dataset is received from one or more heterogeneous data sources, and wherein the first dataset comprises logical atoms represented in a predicate-based schema, and the second dataset comprises database atoms represented in a non-predicate-based schema, wherein the logical atoms indicate dynamically-varying data to be accessed frequently, and wherein the database atoms indicate static data, and wherein a database atom of the second dataset is represented with a path, wherein the path facilitates selective access of the database atoms from the one or more heterogeneous data sources; iteratively selecting, via the processor, one or more task methods from a set of predefined task methods and one or more task operators from a set of predefined task operators, based on the one or more tasks to be completed, to define one or more selected task methods and one or more selected task operators; successively executing, via the processor, the selected task methods and the selected task operators in order to complete the task, wherein the execution of each of the selected task methods and each of the selected task operators includes: validating a first precondition associated with the selected task method and a second precondition associated with the selected task operator, by matching a first set of variables associated with the selected task method and a second set of variables associated with the selected task operator, with at least one of the logical atoms and the database atoms, and wherein matching of the database atoms is facilitated using the path, assigning: if the first precondition is valid, the first set of variables with a first set of values, and if the second precondition is valid, the second set of variables with a second set of values, wherein the first set of values and the second set of values are obtained from one or more logical atoms of the first dataset and one or more database atoms of the second dataset, so matched with the first set of variables and the second set of variables respectively, executing: the selected task method using the first set of values, and the selected task operator using the second set of values; and generating, via the processor, a plan based upon the execution of the selected task methods and the selected task operators; wherein at least one of a logical atom and a database atom is added to the logical atoms and the database atoms respectively, based on the execution of the selected task operator.