-
Mathias Broxvall and Peter Jonsson:
Towards a Complete Classification of Tractability in Point Algebras for
Nonlinear Time.
In Proceedings of the 5th International
Conference on Principles and Practice of Constraint
Programming (CP-99), pp. 129-143, Alexandria, VA, USA, Oct, 1999.
postscript
-
Marcus Bjäreland and Peter Jonsson:
Exploiting Bipartiteness to Identify Yet Another Tractable Subclass of CSP.
In Proceedings of the 5th International
Conference on Principles and Practice of Constraint Programming (CP-99), pp. 118-128, Alexandria, VA, USA, Oct, 1999.
postscript
-
Patrik Haslum and Peter Jonsson:
Some Results on the Complexity of Planning with Incomplete Information.
In Proceedings of the 5th European
Conference on Planning (ECP-99), Durham, UK, Sep, 1999.
postscript
1997
-
Thomas Drakengren and Peter Jonsson:
Towards a Complete Classification of Tractability in Allen's Algebra.
In Proceedings of the 15th International Joint
Conference on Artificial Intelligence (IJCAI-97), pp. 1466-1471, Nagoya, Japan, Aug, 1997.
postscript
1996
-
Inger Klein, Peter Jonsson, and Christer Bäckström:
Automatic Synthesis of Control Programs in
Polynomial Time for an Assembly Line.
In Proceedings of the IEEE Conference on Decision
and Control (CDC-96), Kobe, Japan, Dec, 1996.
postscript
-
Peter Jonsson, Thomas Drakengren, and Christer Bäckström:
Tractable Subclasses of the Point-Interval Algebra:
A Complete Classification.
In Proceedings of the 5th International Conference on
Principles on Knowledge Representation and Reasoning (KR-96), pp. 352-363, Cambridge, MA, USA, Oct, 1996.
note
-
Thomas Drakengren and Peter Jonsson:
Tractable Subclasses of Allen's Interval Algebra: Preliminary Report.
In Proceedings of the 13th (US) National Conference on
Artificial Intelligence (AAAI-96), pp. 389-394, Portland, OR, USA, Aug, 1996. postscript
-
Peter Jonsson and Christer Bäckström:
A Linear-Programming Approach to Temporal Reasoning.
In Proceedings of the 13th (US) National Conference on
Artificial Intelligence (AAAI-96), pp. 1235-1240, Portland, OR, USA, Aug, 1996.
postscript
-
Peter Jonsson and Christer Bäckström:
On the Size of Reactive Plans.
In Proceedings of the 13th (US) National Conference on
Artificial Intelligence (AAAI-96), pp. 1182-1187, Portland, OR, USA, Aug, 1996.
postscript
-
Peter Jonsson and Christer Bäckström:
Tractable Plan Existence Does Not Imply Tractable
Plan Generation.
In 4th International Symposium of AI and Mathematics, Ft. Lauderdale, FL, USA, Jan., 1996.
postscript
1995
-
Peter Jonsson and Christer Bäckström:
Incremental Planning.
In New Directions in AI Planning: EWSP'95-3rd
European Workshop on Planning, pp. 79-90, Assisi, Italy, Sep, 1995.
postscript
-
Inger Klein, Peter Jonsson, and Christer Bäckström:
Tractable Planning for an Assembly Line.
In New Directions in AI Planning: EWSP'95-3rd
European Workshop on Planning, pp. 313-324, Assisi, Italy, Sep, 1995.
postscript
-
Christer Bäckström and Peter Jonsson:
Planning with Abstraction Hierarchies can be
Exponentially Less Efficient.
In Proceedings of the 14th International Joint
Conference on Artificial Intelligence (IJCAI-95), Montreal, PQ, Canada, Aug, 1995.
postscript
1994
-
Peter Jonsson and Christer Bäckström:
Complexity Results for State-Variable Planning under Mixed
Syntactical and Structural Restrictions.
In Proceedings of the 6th International Conference on
Artificial Intelligence: Methodology, Systems,
Applications (AIMSA-94), Sofia, Bulgaria, Sep, 1994.
postscript
-
Peter Jonsson and Christer Bäckström:
Tractable Planning with State Variables by Exploiting
Structural Restrictions.
In Proceedings of the 12th (US) National Conference on
Artificial Intelligence (AAAI-94), pp. 998-1003, Seattle, WA, USA, Jul-Aug, 1994.
postscript