%0 Conference Paper %1 degiacomo2014verification %A De Giacomo, Giuseppe %A Lespérance, Yves %A Patrizi, Fabio %A Vassos, Stavros %B ECAI 2014 - 21st European Conference on Artificial Intelligence %D 2014 %K Bounded-Action-Theories Online-Executions Situation-Calculus Verification optique-project %P 369-374 %R 10.3233/978-1-61499-419-0-369 %T LTL Verification of Online Executions with Sensing in Bounded Situation Calculus %X We look at agents reasoning about actions from a first-person perspective. The agent has a representation of world as situation calculus action theory. It can perform sensing actions to acquire information. The agent acts “online”, i.e., it performs an action only if it is certain that the action can be executed, and collects sensing results from the actual world. When the agent reasons about its future actions, it indeed considers that it is acting online; however only possible sensing values are available. The kind of reasoning about actions we consider for the agent is verifying a first-order (FO) variant (without quantification across situations) of linear time temporal logic (LTL) . We mainly focus on bounded action theories, where the number of facts that are true in any situation is bounded. The main results of this paper are: (i) possible sensing values can be based on consistency if the initial situation description is FO; (ii) for bounded action theories, progression over histories that include sensing results is always FO; (iii) for bounded theories, verifying our FO LTL against online executions with sensing is decidable.

@inproceedings{degiacomo2014verification, abstract = {We look at agents reasoning about actions from a first-person perspective. The agent has a representation of world as situation calculus action theory. It can perform sensing actions to acquire information. The agent acts “online”, i.e., it performs an action only if it is certain that the action can be executed, and collects sensing results from the actual world. When the agent reasons about its future actions, it indeed considers that it is acting online; however only possible sensing values are available. The kind of reasoning about actions we consider for the agent is verifying a first-order (FO) variant (without quantification across situations) of linear time temporal logic (LTL) . We mainly focus on bounded action theories, where the number of facts that are true in any situation is bounded. The main results of this paper are: (i) possible sensing values can be based on consistency if the initial situation description is FO; (ii) for bounded action theories, progression over histories that include sensing results is always FO; (iii) for bounded theories, verifying our FO LTL against online executions with sensing is decidable.}, added-at = {2014-10-15T16:22:40.000+0200}, audience = {academic}, author = {De Giacomo, Giuseppe and Lespérance, Yves and Patrizi, Fabio and Vassos, Stavros}, biburl = {https://www.bibsonomy.org/bibtex/2cc6ef32f8bde6607e41c870bf4678ad7/savo.fabio}, booktitle = {ECAI 2014 - 21st European Conference on Artificial Intelligence}, doi = {10.3233/978-1-61499-419-0-369}, interhash = {b4e5580891cb93b9fe8833bbfddb993e}, intrahash = {cc6ef32f8bde6607e41c870bf4678ad7}, keywords = {Bounded-Action-Theories Online-Executions Situation-Calculus Verification optique-project}, openaccess = {Yes}, pages = {369-374}, partneroptique = {UNIROMA1}, timestamp = {2016-12-01T18:54:42.000+0100}, title = {LTL Verification of Online Executions with Sensing in Bounded Situation Calculus}, wpoptique = {WP4}, year = 2014, yearoptique = {Y2} }