Jens Claßen
Titel
Zitiert von
Zitiert von
Jahr
A Logic for Non-Terminating Golog Programs.
J Claßen, G Lakemeyer
KR, 589-599, 2008
662008
Towards an Integration of Golog and Planning
J Claßen, P Eyerich, G Lakemeyer, B Nebel
Proc. IJCAI 2007 7, 1846-1851, 2007
502007
A situation-calculus semantics for an expressive fragment of PDDL
J Claßen, Y Hu, G Lakemeyer
AAAI 7, 956-961, 2007
262007
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
222012
Continual planning in Golog
T Hofmann, T Niemueller, J Claßen, G Lakemeyer
Thirtieth AAAI conference on artificial intelligence, 2016
202016
Foundations for knowledge-based programs using ES
J Claßen, G Lakemeyer
KR, 318-328, 2006
202006
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
182006
Verifying CTL* Properties of GOLOG Programs over Local-Effect Actions.
B Zarrieß, J Claßen
ECAI, 939-944, 2014
142014
Verification of Knowledge-Based Programs over Description Logic Actions.
B Zarrieß, J Claßen
IJCAI, 3278-3284, 2015
132015
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
112006
Planning and verification in the agent language Golog
J Claßen
RWTH Aachen University, 2013
102013
Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs.
J Claßen, M Liebenberg, G Lakemeyer, B Zarrieß
AAAI, 1012-1019, 2014
92014
Integrating Golog and planning: An empirical evaluation
J Claßen, V Engelmann, G Lakemeyer, G Röger
Non-Monotonic Reasoning Workshop. Sydney, Australia, 2008
92008
Decidable Verification of Golog Programs over Non-Local Effect Actions.
B Zarrieß, J Claßen
AAAI, 1109-1115, 2016
72016
On the Verification of Very Expressive Temporal Properties of Non-terminating Golog Programs.
J Claßen, G Lakemeyer
ECAI, 887-892, 2010
72010
Tractable first-order Golog with disjunctive knowledge bases
J Claßen, G Lakemeyer
Proc. Commonsense, 27-33, 2009
62009
Symbolic Verification of Golog Programs with First-Order BDDs.
J Claßen
KR, 524-529, 2018
42018
On Decidable Verification of Non-terminating Golog Programs
J Claßen, M Liebenberg, G Lakemeyer
ECAI 2010, 2013
42013
On the Decidability of Verifying LTL Properties of Golog Programs.
B Zarrieß, J Claßen
AAAI Spring Symposia, 2014
32014
Decidable Verification of Knowledge-Based Programs over Description Logic Actions with Sensing⋆
B Zarrieß, J Claßen
endeavour 6, 15, 2015
22015
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20