Phase Transitions in Classical Planning: An Experimental Study

@inproceedings{Rintanen2004PhaseTI,
  title={Phase Transitions in Classical Planning: An Experimental Study},
  author={Jussi Rintanen},
  booktitle={KR},
  year={2004}
}
Phase transitions in the solubility of problem instances are known in many types of computational problems relevant for artificial intelligence, most notably for the satisfiability problem of the classical propositional logic. However, phase transitions in classical planning have received far less attention. Bylander has investigated phase transitions theoretically as well as experimentally by using simplified planning algorithms, and shown that most of the soluble problems can be solved by a n… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

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

Efficient algorithms for clause-learning SAT solvers

  • L. Ryan
  • Masters thesis, Simon Fraser University.
  • 2003
2 Excerpts

The third international planning competition: results and analysis

  • D. Long
  • Journal of Artificial Intelligence Research
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…