The following pages link to Bernhard Nebel (Q679418):
Displaying 24 items.
- Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class (Q679419) (← links)
- Computational complexity of terminological reasoning in BACK (Q1104128) (← links)
- Reasoning and revision in hybrid representation systems (Q1188644) (← links)
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus (Q1285670) (← links)
- On the expressivity of feature logics with negation, functional uncertainty, and sort equations (Q1314281) (← links)
- On the computational complexity of temporal projection, planning, and plan validation (Q1321058) (← links)
- Acquisition and validation of complex object database schemata supporting multiple inheritance (Q1330409) (← links)
- An empirical analysis of terminological representation systems (Q1332849) (← links)
- On the computational complexity of assumption-based argumentation for default reasoning. (Q1852857) (← links)
- Some thoughts on forward induction in multi-agent-path finding under destination uncertainty (Q2185483) (← links)
- Evaluation of the moral permissibility of action plans (Q2211868) (← links)
- Game description language and dynamic epistemic logic compared (Q2238672) (← links)
- The dynamic logic of policies and contingent planning (Q2296752) (← links)
- On qualitative route descriptions. Representation, agent models, and computational complexity (Q2341261) (← links)
- In defense of PDDL axioms (Q2457650) (← links)
- Terminological reasoning is inherently intractable (Q2638816) (← links)
- (Q2717791) (← links)
- (Q2734949) (← links)
- (Q3046939) (← links)
- (Q3046967) (← links)
- (Q3047051) (← links)
- Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity (Q3120432) (← links)
- Epistemic planning: perspectives on the special issue (Q6098843) (← links)
- The computational complexity of multi-agent pathfinding on directed graphs (Q6494349) (← links)
