The main result of this paper is that the non-branching plan existence problem in unobservable domains with an expressive operator formalism is EXPSPACE-complete.Expand

This article provides the final step in the classification of complexity for satisfiability problems over constraints expressed in Allen's interval algebra, and shows that this algebra contains exactly eighteen maximal tractable subalgebras, and reasoning in any fragment not entirely contained in one of these subalagbras is NP-complete.Expand

This work investigates the computational properties of the spatial algebra RCC-5 which is a restricted version of the RCC framework for spatial reasoning and identifies all maximal tractable subalgebras which are four in total.Expand

It is demonstrated that some state-of-the-art planners run faster using reduced operator sets, a conjecture that the search for a plan would be more efficient if there were only a small number of paths from the initial state to the goal state.Expand

We present an O(1.3247n) algorithm for counting the number of independent sets with maximum weight in graphs. We show how this algorithm can be used solving a number of different counting problems:… Expand

A provably sound and complete incremental planner is proposed, i.e., a planner that can usually output an executable prefix of the final plan before it has generated the whole plan.Expand

A cubic-time exact inference algorithm is extended into a practical parser and evaluated its performance on four linguistic data sets used in semantic dependency parsing and shows that the resulting optimization problem is NP-hard for k ≥ 2.Expand