| Publication | Date of Publication | Type |
|---|
| The computational complexity of multi-agent pathfinding on directed graphs | 2024-04-30 | Paper |
| Epistemic planning: perspectives on the special issue | 2023-06-19 | Paper |
| Epistemic Multi-agent Planning Using Monte-Carlo Tree Search | 2023-03-24 | Paper |
| Interval Based Relaxation Heuristics for Numeric Planning with Action Costs | 2022-11-02 | Paper |
| Game description language and dynamic epistemic logic compared | 2021-11-02 | Paper |
| Evaluation of the moral permissibility of action plans | 2020-11-16 | Paper |
| Some thoughts on forward induction in multi-agent-path finding under destination uncertainty | 2020-06-04 | Paper |
| The dynamic logic of policies and contingent planning | 2020-02-18 | Paper |
| Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity | 2019-03-04 | Paper |
| On qualitative route descriptions. Representation, agent models, and computational complexity | 2015-04-23 | Paper |
| In defense of PDDL axioms | 2007-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046939 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046967 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3047051 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448731 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4406782 | 2003-06-26 | Paper |
| On the computational complexity of assumption-based argumentation for default reasoning. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4540952 | 2002-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4533361 | 2002-06-10 | Paper |
| On the expressive power of planning formalisms. Conditional effects and Boolean preconditions in the STRIPS formalisms | 2002-01-02 | Paper |
| The FF planning system: Fast plan generation through heuristic search | 2001-06-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4514014 | 2000-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4488091 | 2000-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4236365 | 1999-09-14 | Paper |
| On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus | 1999-04-28 | Paper |
| Reasoning about temporal relations | 1998-02-02 | Paper |
| Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class | 1997-04-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5688793 | 1997-03-16 | Paper |
| An empirical analysis of terminological representation systems | 1995-05-14 | Paper |
| Acquisition and validation of complex object database schemata supporting multiple inheritance | 1995-03-20 | Paper |
| On the computational complexity of temporal projection, planning, and plan validation | 1995-01-02 | Paper |
| On the expressivity of feature logics with negation, functional uncertainty, and sort equations | 1994-03-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028815 | 1993-03-28 | Paper |
| Reasoning and revision in hybrid representation systems | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4013976 | 1992-09-27 | Paper |
| Terminological reasoning is inherently intractable | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3493313 | 1989-01-01 | Paper |
| Computational complexity of terminological reasoning in BACK | 1988-01-01 | Paper |
