no code implementations • 17 Jul 2023 • Anubhav Singh, Miquel Ramirez, Nir Lipovetzky, Peter J. Stuckey
This paper studies the possibilities made open by the use of Lazy Clause Generation (LCG) based approaches to Constraint Programming (CP) for tackling sequential classical planning.
no code implementations • 17 May 2021 • Anubhav Singh, Nir Lipovetzky, Miquel Ramirez, Javier Segovia-Aguas
Width-based search algorithms seek plans by prioritizing states according to a suitably defined measure of novelty, that maps states into a set of novelty categories.