Lemma reusing for SAT based planning and scheduling *

ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling

Volumn 2006, Issue , 2006, Pages 103-112

  Nabeshima, Hidetomo ^a   Soh, Takehide ^b   Inoue, Katsumi ^c   Iwanuma, Koji ^a  

^a UNIVERSITY OF YAMANASHI   (Japan)

^b KOBE UNIVERSITY   (Japan)

^c NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC COMMERCE; ENCODING (SYMBOLS); ONLINE SEARCHING; PROBLEM SOLVING; SCHEDULING; THEOREM PROVING;

LEMMA; LEMMA REUSING PLANNER (LRP); SAT PROBLEMS; SEARCH SPACES;

STRATEGIC PLANNING;

EID: 33746071162     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Beasley, J. E. 1990. OR-library: distributing test problems by electronic mail. Operational Research Society 41:1069-1072.
2. Blum, A. L., and Furst, M. L. 1997. Fast planning through planning graph analysis. Artificial Intelligence 90(1-2):279-298.
3. Cadoli, M., and Schaerf, A. 2005. Compiling problem specifications into sat. Artificial Intelligence 162:89-120.
4. Chrabakh, W., and Wolski, R. 2003. GridSAT: A chaffbased distributed sat solver for the grid. In Proceedings of the 2003 ACM/IEEE conference on Supercomputing, 37. IEEE Computer Society.
5. Crawford, J. M., and Baker, A. B. 1994. Experimental results on the application of satisfiability algorithms to scheduling problems. In Proceedings of AAAI-94, 1092-1097.
6. Eén, N., and Biere, A. 2005. Effective preprocessing in sat through variable and clause elimination. In Proceedings of SAT-2005, 61-75.
7. Eén, N., and Sörensson, N. 2003a. An extensible satsolver. In Proceedings of SAT-2003, 502-518.
8. Eén, N., and Sörensson, N. 2003b. Temporal induction by incremental SAT solving. Electronic Notes in Theoretical Computer Science 89(4).
9. Gershman, R. 2005. HAIFASAT: A new robust sat solver. http://www.cs.technion.ac.il/~gershman/.
10. Jin, H., and Somenzi, F. 2005. An incremental algorithm to check satisfiability for bounded model checking. Electronic Notes in Theoretical Computer Science 119(2):51-65.
11. Kautz, H., and Selman, B. 1998. BLACKBOX: A new approach to the application of theorem proving to problem solving. In AIPS98 Workshop on Planning as Combinatorial Search, 58-60.
12. Kautz, H.; McAllester, D.; and Selman, B. 1996. Encoding plans in prepositional logic. In Proceedings of KR-96, 374-384.
13. Kautz, H. 2004. SATPLAN04: Planning as satisfiability. Informal note of the International Planning Competition 2004.
14. Marques-Silva, J. P., and Sakallah, K. A. 1999. GRASP - A search algorithm for prepositional satisfiability. IEEE Transactions on Computers 48:506-521.
15. Moskewicz, M. W.; Madigan, C. F.; Zhao, Y.; Zhang, L.; and Malik, S. 2001. Chaff: Engineering an Efficient SAT Solver. In Proceedings of DAC-01, 530-535.
16. Nabeshima, H.; Nozawa, H.; and Iwanuma, K. 2005. Effective sat planning by lemma-reusing. In Proceedings of AIA-2005, 1-6.
17. Sadeh, N. 1991. Look-ahead Techniques for Microopportunistic Job Shop Scheduling. Ph.D. Dissertation, Carnegie Mellon University, Pittsburgh, PA 15213.
18. Shtrichman, O. 2001. Pruning techniques for the SAT-based bounded model checking problem. In Proceedings of CHARME-2001, volume 2144 of LNCS, 58-70. Springer.
19. Sinz, C.; Blochinger, W.; and Küchlin, W. 2001. PaSAT -parallel sat-checking with lemma exchange: Implementation and applications. In Proceedings of SAT-2001, 212-217.
20. Soh, T.; Inoue, K.; Banbara, M.; and Tamura, N. 2005. Experimental results for solving job-shop scheduling problems with multiple SAT solvers. In Proceedings of DSCP-2005, 25-38.
21. Vidai, V., and Geffner, H. 2006. Branching and pruning: An optimal temporal POCL planner based on constraint programming. Artificial Intelligence 170(3):298-335.
22. Whittemore, J.; Kim, J.; and Sakallah, K. A. 2001. SATIRE: A new incremental satisfiability engine. In Proceedings of DAC-2001, 542-545.
23. Zhang, L.; Madigan, C. F.; Moskewicz, M. W.; and Malik, S. 2001. Efficient conflict driven learning in boolean satisfiability solver. In Proceedings of ICCAD-01, 279-285.