Complexity of Interval Relaxed Numeric Planning.

Johannes Aldinger Robert Mattmüller Moritz Göbelbecker

Published in: KI (2015)

Keyphrases

computational complexity
database
numeric data
heuristic search
decision problems
enforced hill climbing
blocks world
planning systems
mixed initiative
goal oriented
space complexity
temporal reasoning
planning problems
domain independent
sufficient conditions
np hard
website
social networks
machine learning