• Publications
  • Influence
The FF Planning System: Fast Plan Generation Through Heuristic Search
A novel search strategy is introduced that combines hill-climbing with systematic search, and it is shown how other powerful heuristic information can be extracted and used to prune the search space. Expand
This article provides a complete map over the complexity of SAS+ planning under all combinations of the previously considered restrictions and proves that the SAS+‐PUS problem is the maximal tractable problem under the restrictions. Expand
On the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of the Region Connection Calculus
It is proved that reasoning is NP-complete in general and identified a maximal tractable subset of the relations in RCC-8 that contains all base relations and shows that for this subset path-consistency is sufficient for deciding consistency. Expand
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Using an extensive machine-generated case analysis, it is shown that the ORD-Horn subclass is a maximal tractable subclass of the full algebra (assuming P <inline-equation> ≠</f> </inline-Equation> NP). Expand
Reasoning and Revision in Hybrid Representation Systems
  • B. Nebel
  • Computer Science, Mathematics
  • Lecture Notes in Computer Science
  • 20 April 1990
The universal term-forming formalism is a hybrid representation formalism that combines terminological cycles, representation and management of knowledge, and reasoning in the formalism. Expand
Qualitative Spatial Reasoning Using Constraint Calculi
Exploring artificial intelligence in the new millennium
The aim of this book is to contribute towards the development of a coherent model of human-computer interaction that can be applied to solve the challenge of integrating human and machine interaction in the rapidly changing environment. Expand
Terminological Reasoning is Inherently Intractable
  • B. Nebel
  • Computer Science
  • Artif. Intell.
  • 1 May 1990
Subsumption in terminologies turns out to be co-NP-complete for a minimal terminological representation language that is a subset of every useful terminological language. Expand
Extending Planning Graphs to an ADL Subset
An extension of Graphplan to a subset of ADL that allows conditional and universally quantified effects in operators is described and it is proved that Graphplan''s termination test remains complete under subset memoization. Expand
Multiagent Systems
Agent-based systems technology has generated lots of excitement in recent years because of its promise as a new paradigm for conceptualizing, designing, and implementing software systems. ThisExpand