On Logical Analysis of Transition Structure of Agents

This paper investigates a simple case of the state-agent-environment model of artificial intelligence theory. The general framework of AI in this part provides search and planning and is based on the development of modelling mathematical formalisms with a consequent validation-check, and pathfinding stages. The application problem and the use case considered in this paper belongs to the domain of personalized medicine. The problem is known as the dynamic treatment regime (DTR), and we demonstrate that in addition to traditional AI techniques for such problems, a simpler graph theoretical development can be incorporated that solves the validation and pathfinding problems with less efforts and complexities. The results obtained are achieved by using graph connectivity checking algorithms, algorithms of pathfinding in rooted trees, and checking additional graph components to be a one dicycle cactus graph; and provide a means of consecutive restructuring the whole graph for the connectivity property that preserves the validated DTR policy.