Christer Bäckström (baeckstroem-c)

Contributions to Philosophie.ch

Bibliography

Bäckström, Christer. 1992. “Equivalence and Tractability Results for SAS\(+\) Planning.” in KR’92: Principles of Knowledge Representation and Reasoning, edited by Bernhard Nebel, Charles Rich, and William R. Swartout, pp. 126–137. San Francisco, California: Morgan Kaufmann Publishers.
Bäckström, Christer. 1995. “Expressive Equivalence of Planning Formalisms.” Artificial Intelligence 76(1–2): 17–34.
Bäckström, Christer and Sandewall, Erik, eds. 1994. Current Trends in AI Planning. Amsterdam: IOS Press.
Jonsson, Peter and Bäckström, Christer. 1998a. “State-Variable Planning under Structural Restrictions: Algorithms and Complexity.” Artificial Intelligence 100(1–2): 125–176.
Jonsson, Peter and Bäckström, Christer. 1998b. “A Unifying Approach to Temporal Constraint Reasoning.” Artificial Intelligence 102(1): 143–155.
Jonsson, Peter, Drakengren, Thomas and Bäckström, Christer. 1996. “Tractable Subclasses of the Point-Interval Algebra: A Complete Classification.” in KR’96: Principles of Knowledge Representation and Reasoning, edited by Luigia Carlucci Aiello, Jon Doyle, and Stuart C. Shapiro, pp. 352–363. San Francisco, California: Morgan Kaufmann Publishers.
Jonsson, Peter, Drakengren, Thomas and Bäckström, Christer. 1999. “Computational Complexity of Relating Time Points with Intervals.” Artificial Intelligence 109(1–2): 273–295.
Jonsson, Peter, Haslum, Patrik and Bäckström, Christer. 2000. “Towards Efficient Universal Planning: A Randomized Approach.” Artificial Intelligence 117(1): 1–29.
Nebel, Bernhard and Bäckström, Christer. 1994. “On the Computational Complexity of Temporal Projection, Planning, and Plan Validation.” Artificial Intelligence 66(1): 125–160.