| A Logic for Non-Terminating Golog Programs. J Claßen, G Lakemeyer KR, 589-599, 2008 | 66 | 2008 |
| Towards an Integration of Golog and Planning J Claßen, P Eyerich, G Lakemeyer, B Nebel Proc. IJCAI 2007 7, 1846-1851, 2007 | 50 | 2007 |
| A situation-calculus semantics for an expressive fragment of PDDL J Claßen, Y Hu, G Lakemeyer AAAI 7, 956-961, 2007 | 26 | 2007 |
| Platas—Integrating Planning and the Action Language Golog J Claßen, G Röger, G Lakemeyer, B Nebel KI-Künstliche Intelligenz 26 (1), 61-67, 2012 | 22 | 2012 |
| Continual planning in Golog T Hofmann, T Niemueller, J Claßen, G Lakemeyer Thirtieth AAAI conference on artificial intelligence, 2016 | 20 | 2016 |
| Foundations for knowledge-based programs using ES J Claßen, G Lakemeyer KR, 318-328, 2006 | 20 | 2006 |
| GOLOG and PDDL: What is the Relative Expressiveness? P Eyerich, B Nebel, G Lakemeyer, J Claßen Proceedings of the 2006 international symposium on Practical cognitive …, 2006 | 18 | 2006 |
| Verifying CTL* Properties of GOLOG Programs over Local-Effect Actions. B Zarrieß, J Claßen ECAI, 939-944, 2014 | 14 | 2014 |
| Verification of Knowledge-Based Programs over Description Logic Actions. B Zarrieß, J Claßen IJCAI, 3278-3284, 2015 | 13 | 2015 |
| A Semantics for ADL as Progression in the Situation Calculus J Claßen, G Lakemeyer Proceedings of the 11th Workshop on Nonmonotonic Reasoning, 334, 2006 | 11 | 2006 |
| Planning and verification in the agent language Golog J Claßen RWTH Aachen University, 2013 | 10 | 2013 |
| Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs. J Claßen, M Liebenberg, G Lakemeyer, B Zarrieß AAAI, 1012-1019, 2014 | 9 | 2014 |
| Integrating Golog and planning: An empirical evaluation J Claßen, V Engelmann, G Lakemeyer, G Röger Non-Monotonic Reasoning Workshop. Sydney, Australia, 2008 | 9 | 2008 |
| Decidable Verification of Golog Programs over Non-Local Effect Actions. B Zarrieß, J Claßen AAAI, 1109-1115, 2016 | 7 | 2016 |
| On the Verification of Very Expressive Temporal Properties of Non-terminating Golog Programs. J Claßen, G Lakemeyer ECAI, 887-892, 2010 | 7 | 2010 |
| Tractable first-order Golog with disjunctive knowledge bases J Claßen, G Lakemeyer Proc. Commonsense, 27-33, 2009 | 6 | 2009 |
| Symbolic Verification of Golog Programs with First-Order BDDs. J Claßen KR, 524-529, 2018 | 4 | 2018 |
| On Decidable Verification of Non-terminating Golog Programs J Claßen, M Liebenberg, G Lakemeyer ECAI 2010, 2013 | 4 | 2013 |
| On the Decidability of Verifying LTL Properties of Golog Programs. B Zarrieß, J Claßen AAAI Spring Symposia, 2014 | 3 | 2014 |
| Decidable Verification of Knowledge-Based Programs over Description Logic Actions with Sensing⋆ B Zarrieß, J Claßen endeavour 6, 15, 2015 | 2 | 2015 |
Gerhard LakemeyerProfessor of Computer Science, RWTH Aachen UniversityBestätigte E-Mail-Adresse bei cs.rwth-aachen.de
