Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The action programming language GOLOG has been found useful for the control of autonomous agents such as mobile robots. In scenarios like these, tasks are often open-ended so that the respective control programs are non-terminating. Before deploying such programs on a robot, it is often desirable to verify that they meet certain requirements. For this purpose, Clasen and Lake-meyer recently introduced algorithms for the verification of temporal properties of GOLOG programs. Hover, given the expressiveness of GOLOG, their verification procedures are not guaranteed to terminate. ,  show how decidability can be obtained by suitably restricting the underlying base logic, the effect axioms for primitive actions, and the use of actions within GOLOG programs. Moreover,  show that dropping any of these restrictions immediately leads to undecidability of the verification problem.
['Jens Claßen', 'Martin Liebenberg', 'Gerhard Lakemeyer', 'Benjamin Zarrieß']
I am writing a research paper on a idea Exploring the boundaries of decidable verification of non-terminating Golog programs
[{"from": "human", "value": "I am writing a research paper on a idea Exploring the boundaries of decidable verification of non-terminating Golog programs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: The action programming language GOLOG has been found useful for the control of autonomous agents such as mobile robots. In scenarios like these, tasks are often open-ended so that the respective control programs are non-terminating. Before deploying such programs on a robot, it is often desirable to verify that they meet certain requirements. For this purpose, Clasen and Lake-meyer recently introduced algorithms for the verification of temporal properties of GOLOG programs. Hover, given the expressiveness of GOLOG, their verification procedures are not guaranteed to terminate. ,  show how decidability can be obtained by suitably restricting the underlying base logic, the effect axioms for primitive actions, and the use of actions within GOLOG programs. Moreover,  show that dropping any of these restrictions immediately leads to undecidability of the verification problem."}]