Normalization property
Related papers: 15
Top Researchers
Top Cited Papers
A logic for non-terminating Golog programs
Jens Claßen, Gerhard Lakemeyer
Citations: 61 • 2008
Ring Exploration with Myopic Luminous Robots
Fukuhito Ooshita, Sébastien Tixeuil
Citations: 18 • 2018
Exploring the boundaries of decidable verification of non-terminating Golog programs
Jens Claßen, Martin Liebenberg, Gerhard Lakemeyer, Benjamin Zarrieß
Citations: 15 • 2014
Enabling Ring Exploration with Myopic Oblivious Robots
Ajoy K. Datta, Anissa Lamani, Lawrence L. Larmore, Franck Petit
Citations: 13 • 2015
Non-terminating processes in the situation calculus
Giuseppe De Giacomo, Eugenia Ternovska, Ray Reiter
Citations: 12 • 2019
Designing Weakly Terminating ROS Systems
Debjyoti Bera, K.M. van Hee, Jan Martijn E. M. van der Werf
Citations: 11 • 2012
Ring Exploration of Myopic Luminous Robots with Visibility More Than One
Shota Nagahama, Fukuhito Ooshita, Michiko Inoue
Citations: 8 • 2019
Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs
Jens Claßen, Martin Liebenberg, Gerhard Lakemeyer, Benjamin Zarrieß
Citations: 8 • 2014
Push-Pull Block Puzzles are Hard
Erik D. Demaine, Isaac Grosof, Jayson Lynch
Citations: 5 • 2017
A model checker for verifying ConGolog programs
Leila Kalantari, Eugenia Ternovska
Citations: 5 • 2002
Ring exploration of myopic luminous robots with visibility more than one
Shota Nagahama, Fukuhito Ooshita, Michiko Inoue
Citations: 3 • 2023
On the Verification of Very Expressive Temporal Properties of Non-terminating Golog Programs
Gerhard Lakemeyer
Citations: 3 • 2010
Terminating Grid Exploration with Myopic Luminous Robots
Shota Nagahama, Fukuhito Ooshita, Michiko Inoue
Citations: 3 • 2021
Terminating Grid Exploration with Myopic Luminous Robots
Shota Nagahama, Fukuhito Ooshita, Michiko Inoue
Citations: 2 • 2022
Push-Pull Block Puzzles are Hard
Erik D. Demaine, Isaac Grosof, Jayson Lynch
Citations: 2 • 2017