Lemma Reusing for SAT based Planning and Scheduling

@inproceedings{Nabeshima2006LemmaRF,
  title={Lemma Reusing for SAT based Planning and Scheduling},
  author={Hidetomo Nabeshima and Takehide Soh and Katsumi Inoue and Koji Iwanuma},
  booktitle={ICAPS},
  year={2006}
}
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT problems which become larger and larger. A SAT solver needs to solve the problems until it encounters a satisfiable SAT problem. Many state-of-the-art SAT solvers learn lemmas called conflict clauses to prune redundant search space, but lemmas deduced from a certain SAT problem can not apply to solve other SAT problems… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 24 REFERENCES

SATPLAN 04 : Planning as satisfiability . Informal note of the International Planning Competition 2004

  • H. Kautz
  • 2004
Highly Influential
4 Excerpts

SATPLAN04: Planning as satisfiability

  • H. Kautz
  • Informal note of the International Planning…
  • 2004
Highly Influential
5 Excerpts

Experimental results for solving job-shop scheduling problems with multiple SAT solvers

  • T. Soh, K. Inoue, M. Banbara, N. Tamura
  • Proceedings of DSCP2005, 25–38.
  • 2005
2 Excerpts

Similar Papers

Loading similar papers…