Jonsson, Peter

31 publications

AAAI 2023 Structurally Restricted Fragments of Numeric Planning - A Complexity Analysis Alexander Shleyfman, Daniel Gnad, Peter Jonsson

JAIR 2022 Computational Short Cuts in Infinite Domain Constraint Satisfaction Peter Jonsson, Victor Lagerkvist, Sebastian Ordyniak

AAAI 2022 Resolving Inconsistencies in Simple Temporal Problems: A Parameterized Approach Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

JAIR 2021 Computational Complexity of Computing Symmetries in Finite-Domain Planning Alexander Shleyfman, Peter Jonsson

JAIR 2021 Cost-Optimal Planning, Delete Relaxation, Approximability, and Heuristics Christer Bäckström, Peter Jonsson, Sebastian Ordyniak

AAAI 2021 Disjunctive Temporal Problems Under Structural Restrictions Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

AAAI 2021 Solving Infinite-Domain CSPs Using the Patchwork Property Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov

IJCAI 2020 Lower Bounds and Faster Algorithms for Equality Constraints Peter Jonsson, Victor Lagerkvist

IJCAI 2019 A Refined Understanding of Cost-Optimal Planning with Polytree Causal Graphs Christer Bäckström, Peter Jonsson, Sebastian Ordyniak

IJCAI 2018 Classification Transfer for Qualitative Reasoning Problems Manuel Bodirsky, Peter Jonsson, Barnaby Martin, Antoine Mottet

IJCAI 2018 Novel Structural Parameters for Acyclic Planning Using Tree Embeddings Christer Bäckström, Peter Jonsson, Sebastian Ordyniak

JAIR 2017 A Model-Theoretic View on Qualitative Constraint Reasoning Manuel Bodirsky, Peter Jonsson

JAIR 2017 Time and Space Bounds for Planning Christer Bäckström, Peter Jonsson

AAAI 2015 Tractable Cost-Optimal Planning over Restricted Polytree Causal Graphs Meysam Aghighi, Peter Jonsson, Simon Ståhlberg

JAIR 2014 Automaton Plans Christer Bäckström, Anders Jonsson, Peter Jonsson

AAAI 2014 Oversubscription Planning: Complexity and Compilability Meysam Aghighi, Peter Jonsson

JAIR 2013 A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond Christer Bäckström, Peter Jonsson

IJCAI 2013 Bridging the Gap Between Refinement and Heuristics in Abstraction Christer Bäckström, Peter Jonsson

JAIR 2012 Algorithms and Limits for Compact Plan Representations Christer Bäckström, Peter Jonsson

AAAI 2012 The Complexity of Planning Revisited - A Parameterized Analysis Christer Bäckström, Yue Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider

IJCAI 2011 Discrete-Time Temporal Reasoning with Horn DLRs Peter Jonsson, Tomas Lööw

IJCAI 2001 A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation Andrei A. Krokhin, Peter Jeavons, Peter Jonsson

AAAI 2000 Disjunctive Temporal Reasoning in Partially Ordered Models of Time Mathias Broxvall, Peter Jonsson

JAIR 1997 A Complete Classification of Tractability in RCC-5 Peter Jonsson, Thomas Drakengren

JAIR 1997 Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time Thomas Drakengren, Peter Jonsson

IJCAI 1997 Towards a Complete Classification of Tractability in Allen's Algebra Thomas Drakengren, Peter Jonsson

AAAI 1996 A Linear-Programming Approach to Temporal Reasoning Peter Jonsson, Christer Bäckström

AAAI 1996 Maximal Tractable Subclasses of Allen's Interval Algebra: Preliminary Report Thomas Drakengren, Peter Jonsson

AAAI 1996 On the Size of Reactive Plans Peter Jonsson, Christer Bäckström

IJCAI 1995 Planning with Abstraction Hierarchies Can Be Exponentially Less Efficient Christer Bäckström, Peter Jonsson

AAAI 1994 Tractable Planning with State Variables by Exploiting Structural Restrictions Peter Jonsson, Christer Bäckström