On reachability, relevance, and resolution in the planning as satisfiability approach, Journal of Artificial Intelligence Research, vol.14, pp.1-28, 2001. ,
BJOLP: The big joint optimal landmarks planner, 2011. ,
Directed Model Checking with Distance-Preserving Abstractions, Proceedings of the 13th International SPIN Workshop, pp.19-34, 2006. ,
DOI : 10.1109/26.35374
Admissible heuristics for optimal planning, Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling, pp.140-149, 2000. ,
Landmarks, critical paths and abstractions: What's the difference anyway, Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling, pp.162-169, 2009. ,
Flexible abstraction heuristics for optimal sequential planning, Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, pp.176-183, 2007. ,
RIFO revisited: Detecting relaxed irrelevance, Pre-proceedings of the Sixth European Conference on Planning, pp.325-336, 2001. ,
How to relax a bisimulation?, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00677299
Operational and algebraic semantics of concurrent processes Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics, pp.1201-1242, 1990. ,
Ignoring irrelevant facts and operators in plan generation, Recent Advances in AI Planning. 4th European Conference on Planning, pp.338-350, 1997. ,
DOI : 10.1007/3-540-63912-8_97
Computing perfect heuristics in polynomial time: On bisimulation and merge-and-shrink abstraction in optimal planning, Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI'11), pp.1983-1990 ,
URL : https://hal.archives-ouvertes.fr/inria-00592438
The Merge-and-Shrink planner: Bisimulation-based abstraction for optimal planning, 2011. ,