Add to ORKGRelaxed reachability analysis is relevant to efficient grounding, invariant synthesis as well as the computation of relaxation-based heuristics. Planning domains are typically specified in a lifted representation, where the size of the tasks grows exponentially with the number of objects in the world. This growth also affects the analysis of relaxed reachability. We present a task reduction based on symmetries of the lifted representation that allows to perform the same analysis on smaller tasks
Simplifying classical planning tasks by removing operators while preserving at least one optimal sol...
The exploitation of symmetry in combinatorial search has typically focused on using information abou...
AbstractSymmetry often appears in real-world constraint satisfaction problems, but strategies for ex...
Relaxed reachability analysis is relevant to efficient grounding, invariant synthesis as well as the...
Classical planning tasks are modelled in PDDL which is a schematic language based on first-order log...
Abstraction techniques are important for solving constraint satisfaction problems with global constr...
Abstraction techniques are important for solving constraint satisfaction problems with global constr...
We present three methods for the integration of symmetries into reachability analysis. Two of them l...
AbstractAn on-the-fly symmetry reduction technique that exploits the lexicographic order on metarepr...
Searching for computational tools that can further push the boundary of satisficing planning, we sho...
Symmetry-based state space pruning techniques have proved to greatly improve heuristic search based ...
Abstract Lazy Clause Generation is a powerful approach for reducing search in Constraint Programming...
Previous research in Artificial Intelligence has identified the possibility of simplifying planning ...
Many planning problems contain collections of symmetric objects, actions and structures which render...
Recent research in classical planning has shown the importance of search techniques that operate dir...
Simplifying classical planning tasks by removing operators while preserving at least one optimal sol...
The exploitation of symmetry in combinatorial search has typically focused on using information abou...
AbstractSymmetry often appears in real-world constraint satisfaction problems, but strategies for ex...
Relaxed reachability analysis is relevant to efficient grounding, invariant synthesis as well as the...
Classical planning tasks are modelled in PDDL which is a schematic language based on first-order log...
Abstraction techniques are important for solving constraint satisfaction problems with global constr...
Abstraction techniques are important for solving constraint satisfaction problems with global constr...
We present three methods for the integration of symmetries into reachability analysis. Two of them l...
AbstractAn on-the-fly symmetry reduction technique that exploits the lexicographic order on metarepr...
Searching for computational tools that can further push the boundary of satisficing planning, we sho...
Symmetry-based state space pruning techniques have proved to greatly improve heuristic search based ...
Abstract Lazy Clause Generation is a powerful approach for reducing search in Constraint Programming...
Previous research in Artificial Intelligence has identified the possibility of simplifying planning ...
Many planning problems contain collections of symmetric objects, actions and structures which render...
Recent research in classical planning has shown the importance of search techniques that operate dir...
Simplifying classical planning tasks by removing operators while preserving at least one optimal sol...
The exploitation of symmetry in combinatorial search has typically focused on using information abou...
AbstractSymmetry often appears in real-world constraint satisfaction problems, but strategies for ex...