Get started
Author

Christer Bäckström

Observed names: Bäckström, Christer, C. Backstrom, C. Bäckström, CHRISTER BÄCKSTRÖM, Christer Backstrom
ORCID: 0000-0002-0866-8780
Observed ORCID: 0000-0002-0866-8780
OpenAlex ID: A5088263183
Complexity Results for Sas+ Planning
1995 · Christer Bäckström, Bernhard Nebel · Computational Intelligence · 399
Complexity Results for SAS+ Planning.
1993 · Christer Bäckström, Bernhard Nebel · 229
Computational Aspects of Reordering Plans
1998 · C. Backstrom · Journal of Artificial Intelligence Research · 102
PDF
State-variable planning under structural restrictions: algorithms and complexity
1998 · Peter Jonsson, Christer Bäckström · Artificial Intelligence · 94
A unifying approach to temporal constraint reasoning
1998 · Peter Jonsson, Christer Bäckström · Artificial Intelligence · 86
PDF
Planning in polynomial time: the SAS‐PUBS class
1991 · CHRISTER BÄCKSTRÖM, INGER KLEIN · Computational Intelligence · 63
On the computational complexity of temporal projection, planning, and plan validation
1994 · Bernhard Nebel, Christer Bäckström · Artificial Intelligence · 47
Expressive equivalence of planning formalisms
1995 · Christer Bäckström · Artificial Intelligence · 44
Tractable plan existence does not imply tractable plan generation
1998 · Peter Jonsson, Christer Bäckström · Annals of Mathematics and Artificial Intelligence · 35
Incremental planning
1996 · Peter Jönsson, Christer Bäckström · 34
Fast Detection of Unsolvable Planning Instances Using Local Consistency
2021 · Christer Bäckström, Peter Jonsson, et al. · Proceedings of the International Symposium on Combinatorial Search · 32
PDF
Equivalence and Tractability Results for SAS+ Planning.
1992 · Christer Bäckström · 32
A linear-programming approach to temporal reasoning
1996 · Peter Jönsson, Christer Bäckström · 29
Planning with abstraction hierarchies can be exponentially less efficient
1995 · Christer Bäckström, Peter Jönsson · 28
Parallel non-binary planning in polynomial time
1991 · Christer Bäckström, Inger Klein · 27
Computational complexity of relating time points with intervals
1999 · Peter Jonsson, Thomas Drakengren, et al. · Artificial Intelligence · 25
The Complexity of Planning Revisited — A Parameterized Analysis
2021 · Christer Bäckström, Yue Chen, et al. · Proceedings of the AAAI Conference on Artificial Intelligence · 22
All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others
2021 · Christer Backstrom, Peter Jonsson · Proceedings of the International Symposium on Combinatorial Search · 21
PDF
Efficient planning for a miniature assembly line
1999 · Inger Klein, Peter Jonsson, et al. · Artificial Intelligence in Engineering · 21
Reasoning about interdependent actions
1988 · Christer Bäckström · 21
The Complexity of Planning Revisited — A Parameterized Analysis
2021 · Bäckström, Christer, Chen, Yue, et al. · AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) · 20
PDF
Algorithms and Limits for Compact Plan Representations
2012 · C. Bäckström, P. Jonsson · Journal of Artificial Intelligence Research · 17
PDF
Tractable planning with state variables by exploiting structural restrictions
1994 · Peter Jönsson, Christer Bäckström · 16
Bridging the gap between refinement and heuristics in abstraction
2013 · Christer Bäckström, Peter Jönsson · International Joint Conference on Artificial Intelligence · 15
Towards efficient universal planning: A randomized approach
2000 · Peter Jonsson, Patrik Haslum, et al. · Artificial Intelligence · 14
PDF
Works count: 77
Citation count: 1,636
H-index: 20
I10-index: 26
Year
Topic
Type