SAS+ Planning as Satisfiability

@article{Huang2012SASPA,
  title={SAS+ Planning as Satisfiability},
  author={Ruoyun Huang and Yixin Chen and Weixiong Zhang},
  journal={J. Artif. Intell. Res.},
  year={2012},
  volume={43},
  pages={293-328}
}
Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from STRIPS. We introduce a novel SAT encoding scheme (SASE) based on the SAS+ formalism. The new scheme exploits the structural information in SAS+, resulting in an encoding that is both more compact and efficient for planning. We prove the correctness of the new encoding by establishing an isomorphism between the… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS
Related Discussions
This paper has been referenced on Twitter 1 time. VIEW TWEETS

References

Publications referenced by this paper.
Showing 1-10 of 38 references

Biclique-based representations of binary constraints for making SAT planning applicable to larger problems

J. Rintanen
In Proceedings of European Conference on Artificial Intelligence • 2006
View 5 Excerpts
Highly Influenced

SatPlan: Planning as Satisfiability

H. Kautz, B. Selman, J. Hoffmann
In 5th International Planning Competition, International Conference on Automated Planning and Scheduling • 2006
View 7 Excerpts
Highly Influenced

Concise finite-domain representations for PDDL planning tasks

Artif. Intell. • 2009
View 7 Excerpts
Highly Influenced

The Fast Downward Planning System

J. Artif. Intell. Res. • 2006
View 8 Excerpts
Highly Influenced

Complexity Results for SAS+ Planning

View 3 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…