On the Verification of Very Expressive Temporal Properties of Non-terminating Golog Programs. Claßen, J. & Lakemeyer, G. In Coelho, H., Studer, R., & Wooldridge, M., editors, Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010), pages 887–892, 2010. IOS Press. Paper doi abstract bibtex The agent programming language Golog and the underlying Situation Calculus have become popular means for the modelling and control of autonomous agents such as mobile robots. Although such agents\textquoteright tasks are typically open-ended, little attention has been paid so far to the analysis of non-terminating Golog control programs. Recently we therefore introduced a logic that allows to express properties of Golog programs using operators from temporal logics while retaining the full first-order expressiveness of the Situation Calculus. Combining ideas from classical symbolic model checking with first-order theorem proving we presented a verification method for a restricted subclass of temporal properties. In this paper, we extend this work by considering arbitrary temporal formulas. Our algorithm is inspired by classical CTL* model checking, but introduces techniques to cope with arbitrary first-order quantification.
@INPROCEEDINGS{ClaLak:ECAI2010,
title = {On the Verification of Very Expressive Temporal
Properties of Non-terminating {G}olog Programs},
author = {Jens Cla{\ss}en and Gerhard Lakemeyer},
booktitle = {Proceedings of the 19th European Conference on
Artificial Intelligence (ECAI 2010)},
year = {2010},
editor = {Helder Coelho and Rudi Studer and Michael Wooldridge},
pages = {887--892},
publisher = {IOS Press},
doi = {10.3233/978-1-60750-606-5-887},
abstract = {The agent programming language Golog and the underlying
Situation Calculus have become popular means for the
modelling and control of autonomous agents such as
mobile robots. Although such agents{\textquoteright}
tasks are typically open-ended, little attention has
been paid so far to the analysis of non-terminating
Golog control programs. Recently we therefore
introduced a logic that allows to express properties
of Golog programs using operators from temporal
logics while retaining the full first-order
expressiveness of the Situation Calculus. Combining
ideas from classical symbolic model checking with
first-order theorem proving we presented a
verification method for a restricted subclass of
temporal properties. In this paper, we extend this
work by considering arbitrary temporal formulas. Our
algorithm is inspired by classical CTL* model
checking, but introduces techniques to cope with
arbitrary first-order quantification.},
url = {http://www.kbsg.rwth-aachen.de/~classen/pub/ClassenLakemeyer2009.pdf}
}
Downloads: 0
{"_id":"jt3SortajvqNZMbrM","bibbaseid":"claen-lakemeyer-ontheverificationofveryexpressivetemporalpropertiesofnonterminatinggologprograms-2010","author_short":["Claßen, J.","Lakemeyer, G."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"On the Verification of Very Expressive Temporal Properties of Non-terminating Golog Programs","author":[{"firstnames":["Jens"],"propositions":[],"lastnames":["Claßen"],"suffixes":[]},{"firstnames":["Gerhard"],"propositions":[],"lastnames":["Lakemeyer"],"suffixes":[]}],"booktitle":"Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010)","year":"2010","editor":[{"firstnames":["Helder"],"propositions":[],"lastnames":["Coelho"],"suffixes":[]},{"firstnames":["Rudi"],"propositions":[],"lastnames":["Studer"],"suffixes":[]},{"firstnames":["Michael"],"propositions":[],"lastnames":["Wooldridge"],"suffixes":[]}],"pages":"887–892","publisher":"IOS Press","doi":"10.3233/978-1-60750-606-5-887","abstract":"The agent programming language Golog and the underlying Situation Calculus have become popular means for the modelling and control of autonomous agents such as mobile robots. Although such agents\\textquoteright tasks are typically open-ended, little attention has been paid so far to the analysis of non-terminating Golog control programs. Recently we therefore introduced a logic that allows to express properties of Golog programs using operators from temporal logics while retaining the full first-order expressiveness of the Situation Calculus. Combining ideas from classical symbolic model checking with first-order theorem proving we presented a verification method for a restricted subclass of temporal properties. In this paper, we extend this work by considering arbitrary temporal formulas. Our algorithm is inspired by classical CTL* model checking, but introduces techniques to cope with arbitrary first-order quantification.","url":"http://www.kbsg.rwth-aachen.de/~classen/pub/ClassenLakemeyer2009.pdf","bibtex":"@INPROCEEDINGS{ClaLak:ECAI2010,\n title = {On the Verification of Very Expressive Temporal\n Properties of Non-terminating {G}olog Programs},\n author = {Jens Cla{\\ss}en and Gerhard Lakemeyer},\n booktitle = {Proceedings of the 19th European Conference on\n Artificial Intelligence (ECAI 2010)},\n year = {2010},\n editor = {Helder Coelho and Rudi Studer and Michael Wooldridge},\n pages = {887--892},\n publisher = {IOS Press},\n doi = {10.3233/978-1-60750-606-5-887},\n abstract = {The agent programming language Golog and the underlying\n Situation Calculus have become popular means for the\n modelling and control of autonomous agents such as\n mobile robots. Although such agents{\\textquoteright}\n tasks are typically open-ended, little attention has\n been paid so far to the analysis of non-terminating\n Golog control programs. Recently we therefore\n introduced a logic that allows to express properties\n of Golog programs using operators from temporal\n logics while retaining the full first-order\n expressiveness of the Situation Calculus. Combining\n ideas from classical symbolic model checking with\n first-order theorem proving we presented a\n verification method for a restricted subclass of\n temporal properties. In this paper, we extend this\n work by considering arbitrary temporal formulas. Our\n algorithm is inspired by classical CTL* model\n checking, but introduces techniques to cope with\n arbitrary first-order quantification.},\n url = {http://www.kbsg.rwth-aachen.de/~classen/pub/ClassenLakemeyer2009.pdf}\n}\n\n","author_short":["Claßen, J.","Lakemeyer, G."],"editor_short":["Coelho, H.","Studer, R.","Wooldridge, M."],"key":"ClaLak:ECAI2010","id":"ClaLak:ECAI2010","bibbaseid":"claen-lakemeyer-ontheverificationofveryexpressivetemporalpropertiesofnonterminatinggologprograms-2010","role":"author","urls":{"Paper":"http://www.kbsg.rwth-aachen.de/~classen/pub/ClassenLakemeyer2009.pdf"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://kbsg.rwth-aachen.de/files/kbsgweb.bib","dataSources":["dqRQPSg6Hy3ZXQg7z"],"keywords":[],"search_terms":["verification","very","expressive","temporal","properties","non","terminating","golog","programs","claßen","lakemeyer"],"title":"On the Verification of Very Expressive Temporal Properties of Non-terminating Golog Programs","year":2010}