Share This Author
The complexity of counting homomorphisms seen from the other side
Some Results on the Complexity of Planning with Incomplete Information
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.
State-Variable Planning Under Structural Restrictions: Algorithms and Complexity
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
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.
A Complete Classification of Tractability in RCC-5
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.
Planning with Reduced Operator Sets
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.
Point algebras for temporal reasoning: Algorithms and complexity
An algorithm for counting maximum weighted independent sets and its applications
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:…
Tractable plan existence does not imply tractable plan generation
- P. Jonsson, Christer Bäckström
- Computer Science, EconomicsAnnals of Mathematics and Artificial Intelligence
- 11 January 1998
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.
Parsing to Noncrossing Dependency Graphs
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.