This work examines the computational complexity of existing abstraction techniques based on clustering (faithful and uniform abstractions) and proposes a novel syntactic operator to achieve uniform abstractions, when possible, and explores properties needed to reach abstractions from syntactic symmetry.
Z. G. Saribatur, Markus Hecher, J. Fichte· Proceedings of the Thirty-Fi...· 1 citation
The Simple Temporal Problem (STP) is a core framework for quantitative temporal constraints. As STP data can be inconsistent, we study MaxSTP: compute a maximum-cardinality consistent subset of constraints. This extension is NP-hard, and we analyze its parameterized complexity under measures that capture practically re...
J. Fichte, Johanna Groven, Peter Jonsson et al.· Proceedings of the Thirty-Fi...· 0 citations
This work proposes to abstract the planning task for abstract solutions that are then repaired into concrete plans for the input task, and showcases domains in which drawing an abstract plan and repairing it is significantly faster than solving the original problem.
M. Kornherr, Daniel Gnad, Z. G. Saribatur et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
