Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs

Claßen, Jens; Zarrieß, Benjamin; Lakemeyer, Gerhard; Liebenberg, Martin Roland

doi:978-1-57735-678-3

Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs

Claßen, Jens (Corresponding author)^RWTH* ; Liebenberg, Martin Roland (Corresponding author)^RWTH* ; Lakemeyer, Gerhard (Corresponding author) ; Zarrieß, Benjamin (Corresponding author)

In
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence and the Twenty-Sixth Innovative Applications of Artificial Intelligence Conference : 27 - 31 July 2014, Québec City, Québec, Canada ; [including the Fifth Symposium on Educational Advances in Artificial Intelligence] / [sponsored by the Association for the Advancement of Artificial Intelligence]. - Vol. 2, Seiten/Artikel-Nr: 1012-1019

2014

Konferenz/Event:Twenty-Eighth AAAI Conference on Artificial Intelligence , Québec , Canada , AAAI'14 , 2014-07-27 - 2014-07-31

ImpressumPalo Alto, Calif. : AAAI Press

Umfang1012-1019

ISBN978-1-57735-678-3

Report-Nr.AAAI-WS-14-10

Online
URL: http://www.kbsg.rwth-aachen.de/~classen/pub/ClassenEtAl2014.pdf

Einrichtungen

Externer link:

Volltext