Exploiting Problem Symmetries in State-Based Planners
暂无分享,去创建一个
[1] Bernhard Nebel,et al. COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..
[2] Jean-François Puget,et al. On the Satisfiability of Symmetrical Constrained Satisfaction Problems , 1993, ISMIS.
[3] Eugene M. Luks,et al. Permutation Groups and Polynomial-Time Computation , 1996, Groups And Computation.
[4] Maria Fox,et al. Extending the Exploitation of Symmetries in Planning , 2002, AIPS.
[5] Peter Jeavons,et al. Symmetry Definitions for Constraint Satisfaction Problems , 2005, Constraints.
[6] Carmel Domshlak,et al. Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? , 2009, ICAPS.
[7] Maria Fox,et al. The identification and exploitation of almost symmetry in planning problems , 2004 .
[8] Patrik Haslum,et al. Flexible Abstraction Heuristics for Optimal Sequential Planning , 2007, ICAPS.
[9] Malte Helmert,et al. How Good is Almost Perfect? , 2008, AAAI.
[10] Toby Walsh. Breaking Value Symmetry , 2007, CP.
[11] Maria Fox,et al. The Detection and Exploitation of Symmetry in Planning Problems , 1999, IJCAI.
[12] Malte Helmert,et al. The Fast Downward Planning System , 2006, J. Artif. Intell. Res..
[13] Petteri Kaski,et al. Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs , 2007, ALENEX.
[14] Jussi Rintanen,et al. Symmetry Reduction for SAT Representations of Transition Systems , 2003, ICAPS.
[15] A. Prasad Sistla,et al. Symmetry and model checking , 1993, Formal Methods Syst. Des..