A competitive and cooperative approach to propositional satisfiability

Discrete Applied Mathematics

Volumn 154, Issue 16, 2006, Pages 2291-2306

  Inoue, Katsumi ^a   Soh, Takehide ^b   Ueda, Seiji ^b   Sasaura, Yoshito ^b   Banbara, Mutsunori ^b   Tamura, Naoyuki ^b  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

^b KOBE UNIVERSITY   (Japan)

Author keywords

Job shop scheduling; Parallel execution; Planning; SAT; SAT solver

Indexed keywords

ARTIFICIAL INTELLIGENCE; BENCHMARKING; PARALLEL ALGORITHMS; PROBLEM SOLVING; STOCHASTIC CONTROL SYSTEMS; STRATEGIC PLANNING;

JOB-SHOP SCHEDULING; PARALLEL EXECUTION; SAT; SAT SOLVER;

COMPUTER SCIENCE;

EID: 33747815373     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.04.015     Document Type: Article

References (40)

1. Y. Asahiro, K. Iwama, E. Miyano, Random generation of test instances with controlled attributes, in: D.S. Johnson, M.A. Trick (Eds.), Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, American Mathematical Society, Providence, RI, 1996, pp. 377-393.
2. Banbara M., Tamura N., and Inoue K. Prolog Cafe. a Prolog to Java translator system. Proceedings of the 16th International Conference on Applications of Declarative Programming and Knowledge Management (2005) 45-54
3. M. Banbara, N. Tamura, K. Inoue, T. Kawamura, H. Tamaki, HECS: a heterogeneous constraint solver, 〈http://kaminari.istc.kobe-u.ac.jp/hecs/〉.
4. Biere A., Cimatti A., Clarke E., and Zhu Y. Symbolic model checking without BDDs. Proceedings of the Fifth International Conference on Tools and Algorithms for Construction and Analysis of Systems. ACM (1999) 193-207
5. Blum A.L., and Furst M.L. Fast planning through planning graph analysis. Artificial Intelligence 90 (1997) 279-298
6. Boehm M., and Speckenmeyer E. A fast parallel SAT-solver-efficient workload balancing. Ann. Math. Artificial Intelligence 17 (1996) 381-400
7. W. Chrabakh, R. Wolski, GridSAT: a Chaff-based distributed SAT solver for the grid, in: Proceedings of the ACM/IEEE SuperComputing 2003 Conference, paper 37, 2003.
8. Cook S.A. The complexity of theorem proving procedures. Proceedings of the Third Annual ACM Symposium on the Theory of Computing (1971) 151-158
9. Crawford J.M., and Baker A.B. Experimental results on the application of satisfiability algorithms to scheduling problems. Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94) (1994), AAAI Press 1092-1097
10. Davis M., Logemann G., and Loveland D. A machine program for theorem proving. Comm. ACM 5 (1962) 394-397
11. DIMACS Challenge-Satisfiability: Suggested Format, 〈ftp://dimacs.rutgers.edu/pub/challenge/satisfiability/〉.
12. Eén N., and Sörensson N. An extensible SAT-solver. Proceedings of SAT-2003 (2003) 502-518
13. J. Erenrich, WalkSAT-MPI (v0.9), 〈http://www.jordanerenrich.com/walksat/〉.
14. Fisher H., and Thompson G.L. Probabilistic learning combinations of local job-shop scheduling rules. In: Muth J.F., and Thompson G.L. (Eds). Industrial Scheduling (1963), Prentice-Hall, Englewood Cliffs, NJ 225-251
15. Garey M.R., Johnson D.S., and Sethi R. The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1 (1976) 117-129
16. Gomes C.P., and Selman B. Algorithm portfolios. Artificial Intelligence 126 (2001) 43-62
17. Gu J. The Multi-SAT algorithm. Discrete Appl. Math. 96-97 (1999) 111-126
18. D. Habet, C.M. Li, L. Devendeville, M. Vasquez, A hybrid approach for SAT, in: Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 2470, Springer, Berlin, 2002, pp. 172-184.
19. J.K. Hao, F. Lardeux, F. Saubion, Evolutionary computing for the satisfiability problem, in: Proceedings of the Third European Workshop on Evolutionary Computation in Combinatorial Optimization, Lecture Notes in Computer Science, vol. 2611, Springer, Berlin, 2003, pp. 259-268.
20. Huberman B.A., Lukose R.M., and Hogg T. An economics approach to hard computational problems. Science 275 (1997) 51-54
21. B. Jurkowiak, C.M. Li, G. Utard, Parallelizing Satz using dynamic workload balancing, in: H. Kautz, B. Selman (Eds.), Proceedings of LICS 2001 Workshop on Theory and Applications of Satisfiability Testing, Electronic Notes in Discrete Mathematics, vol. 9, 2001.
22. Kautz H., McAllester D., and Selman B. Encoding plans in propositional logic. Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning, Morgan Kaufmann, Los Altos, CA (1996) 374-384
23. Kautz H., and Selman B. Pushing the envelope. planning, propositional logic and stochastic search. Proceedings of the 13th National Conference on Artificial Intelligence (AAAI 96) (1996), AAAI Press 1194-1201
24. Kautz H., and Selman B. Unifying SAT-based and graph-based planning. Proceedings of the 16th International Joint Conference on Artificial Intelligence, Morgan Kaufmann, Los Altos, CA (1999) 318-325
25. Li C.M., and Anbulagan. Heuristics based on unit propagation for satisfiability problems. Proceedings of the 15th International Joint Conference on Artificial Intelligence, Morgan Kaufmann, Los Altos, CA (1997) 366-371
26. Marques-Silva J.P., and Sakallah K.A. GRASP: a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48 (1999) 506-521
27. Moskewicz M., Madigan C., Zhao Y., Zhang L., and Malik S. Chaff. engineering an efficient SAT solver. Proceedings of the 38th Design Automation Conference, ACM (2001) 530-535
28. Nabeshima H., Inoue K., and Haneda H. Implementing an action language using a SAT solver. Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence (2000) 96-103
29. E. Nudelman, A. Devka, Y. Shoham, K. Leyton-Brown, H. Hoos, SATzilla: an algorithm portfolio for SAT, SAT Competition 2004-Solver Description, 2004, pp. 13-14.
30. N. Sadeh, Look-ahead technique for micro-opportunistic job-shop scheduling, Ph.D. Thesis, Carnegie Mellon University, 1991.
31. SAT Research Group at Princeton University, zChaff, 〈http://www.princeton.edu/∼chaff/zchaff.html〉.
32. SATLIB-The Satisfiability Library, 〈http://www.satlib.org/〉.
33. Selman B., Kautz H., and Cohen B. Local search strategies for satisfiability testing. In: Johnson D.S., and Trick M.A. (Eds). Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 26 (1996), American Mathematical Society, Providence, RI 521-531
34. Selman B., Levesque H., and Mitchell D. A new method for solving hard satisfiability problems. Proceedings of the 10th National Conference on Artificial Intelligence (AAAI-92) (1992), AAAI Press 440-446
35. Selman B., Mitchell D., and Levesque H. Generating hard satisfiability problems. Artificial Intelligence 81 (1996) 17-29
36. Sinz C., Blochinger W., and Kuchlin W. Parallel propositional satisfiability checking with distributed dynamic learning. Parallel Comput. 29 (2003) 969-994
37. Soh T., Inoue K., Banbara M., and Tamura N. Experimental results for solving job-shop scheduling problems with multiple SAT solvers. Proceedings of the First International Workshop on Distributed and Speculative Constraint Processing (2005) 25-38
38. Vaessens R.J.M., Aarts E.H.L., and Lenstra J.K. Job shop scheduling by local search. INFORMS J. Comput. 8 (1996) 302-317
39. Weld D.S. Recent advances in AI planning. AI Magazine 20 (1999) 93-123
40. Zhang H., Bonacina M.P., and Hsiang J. PSATO: a distributed propositional prover and its application to quasigroup problems. J. Symbolic Comput. 21 (1996) 543-560