58 citations · 327 across the 60 of their papers we have counts for
3 papers · 2 filters
A Complete Parameterized Complexity Analysis of Bounded Planning
Christer Baeckstroem, Peter Jonsson, Sebastian Ordyniak +1
The propositional planning problem is a notoriously difficult computational problem, which remains hard even under strong syntactical and structural restrictions. Given its difficu…
Parameterized Complexity Results for Plan Reuse
Ronald de Haan, Anna Roubíčková, Stefan Szeider
Planning is a notoriously difficult computational problem of high worst-case complexity. Researchers have been investing significant efforts to develop heuristics or restrictions t…
Backdoors to Abduction
Andreas Pfandler, Stefan Rümmele, Stefan Szeider
Abductive reasoning (or Abduction, for short) is among the most fundamental AI reasoning methods, with a broad range of applications, including fault diagnosis, belief revision, an…