| A Logic for Non-Terminating Golog Programs. J Claßen, G Lakemeyer KR, 589-599, 2008 | 75 | 2008 |
| Towards an Integration of Golog and Planning J Claßen, P Eyerich, G Lakemeyer, B Nebel Proc. IJCAI 2007 7, 1846-1851, 2007 | 53 | 2007 |
| A situation-calculus semantics for an expressive fragment of PDDL J Claßen, Y Hu, G Lakemeyer AAAI 7, 956-961, 2007 | 29 | 2007 |
| Continual planning in Golog T Hofmann, T Niemueller, J Claßen, G Lakemeyer Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016 | 28 | 2016 |
| 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 | 27 | 2012 |
| Verification of knowledge-based programs over description logic actions B Zarrieß, J Claßen Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015 | 20 | 2015 |
| 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 | 19 | 2006 |
| Foundations for knowledge-based programs using ES J Claßen, G Lakemeyer KR, 318-328, 2006 | 19 | 2006 |
| Planning and verification in the agent language Golog J Claßen RWTH Aachen University, 2013 | 17 | 2013 |
| 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 | 16 | 2006 |
| Decidable verification of Golog programs over non-local effect actions B Zarrieß, J Claßen Proceedings of the AAAI Conference on Artificial Intelligence 30 (1), 2016 | 15 | 2016 |
| Exploring the boundaries of decidable verification of non-terminating Golog programs J Claßen, M Liebenberg, G Lakemeyer, B Zarrieß Proceedings of the AAAI Conference on Artificial Intelligence 28 (1), 2014 | 15 | 2014 |
| Verifying CTL* properties of Golog programs over local-effect actions B Zarrieß, J Claßen ECAI 2014, 939-944, 2014 | 15 | 2014 |
| Integrating Golog and planning: An empirical evaluation J Claßen, V Engelmann, G Lakemeyer, G Röger Proc. NMR, 10-18, 2008 | 10 | 2008 |
| On the verification of very expressive temporal properties of non-terminating Golog programs J Claßen, G Lakemeyer ECAI 2010, 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 Sixteenth International Conference on Principles of Knowledge Representation …, 2018 | 5 | 2018 |
| On Decidable Verification of Non-terminating Golog Programs J Claßen, M Liebenberg, G Lakemeyer NRAC 2013, 2013 | 5 | 2013 |
| Decidable Verification of Decision-Theoretic Golog J Claßen, B Zarrieß International Symposium on Frontiers of Combining Systems, 227-243, 2017 | 3 | 2017 |
| On the decidability of verifying LTL properties of Golog programs B Zarrieß, J Claßen 2014 AAAI Spring Symposium Series, 2014 | 3 | 2014 |
Gerhard LakemeyerProfessor of Computer Science, RWTH Aachen UniversityVerified email at cs.rwth-aachen.de
