Solving combinatorial problems with regular local search algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1705 LNAI, Issue , 1999, Pages 33-43

  Béjar, Ramón ^a   Manyà, Felip ^a  

^a UNIVERSITY OF LLEIDA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; ENCODING (SYMBOLS); GRAPH THEORY; LEARNING ALGORITHMS; SCHEDULING; SPORTS;

CLASSICAL LOGIC; COMBINATORIAL PROBLEM; GRAPH COLORINGS; LOCAL SEARCH ALGORITHM; SAT PROBLEMS; SATISFIABILITY PROBLEMS; SPORTS SCHEDULING; STATE-OF-THE-ART APPROACH;

LOCAL SEARCH (OPTIMIZATION);

EID: 84886234546     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48242-3_3     Document Type: Conference Paper

References (17)

1. B. Beckert, R. Hahnle, and F. Manya. Transformations between signed and classical clause logic. In Proc. International Symposium on Multiple-Valued Logics, ISMVL'99, Freiburg, Germany, pages 248-255. IEEE Press, Los Alamitos, 1999.
2. R. Bejai emd F. Manyei. A comparison of systematic emd loccJ search algorithms for regular CNF formulas. In Proceedings of the Fifth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU'99, London, England, pages 22-31. Springer LNAI 1638, 1999.
3. R. Bejar and F. Manyá. Phase transitions in the regular random 3-SAT problem. In Proceedings of the International Symposium on Methodologies for Intelligent Systems, ISMIS'99, Warsaw, Poland, pages 292-300. Springer LNAI 1609, 1999.
4. J. M. Crawford and A. B. Baker. Experimental results on the apphcation of satisfiability algorithms to scheduling problems. In Proceedings of the 12th National Conference on Artificial Intelligence, AAAI'Qi, Seattle, WA, USA, pages 1092- 1097, 1994.
5. G. Escalada-Imajz and F. Manya. The satisfiability problem for multiple-valued Horn formulae. In Proceedings of the International Symposium on Multiple- Valued Logics, ISMVL'94, Boston, MA, USA, pages 250-256. IEEE Press, Los Alamitos, 1994.
6. C. P. Gomes, B. Selman, K. McAloon, and C. Tretkoff. Randomization in backtrack search: Exploiting heavy-teiiled profiles for solving hcird scheduling problems. In Proceedings AIPS'98, Pittsburg, PA, USA, 1998.
7. R. Hahnle. Short conjunctive normal forms in finitely-valued logics. Journal of Logic and Computation, 4(6):905-927, 1994.
8. R. Hahnle. Exploiting data dependencies in mciny-veJued logics. ournal of Applied Non-Classical Logics, 6:49-69, 1996.
9. R. Hahnle and G. Escalada-Imaz. Deduction in many-valued logics: A survey. Mathware and Soft Computing, 4(2):69-97, 1997.
10. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon. Optimization by simulated annealing: An experimental evaluation; part II, graph coloring and number peirtitioning. Operations Research, 39(3):378-406, 1991.
11. H. A. Kautz and B. Selman. Pushing the envelope: Pljinning, propositional logic, and stochsistic search. In Proceedings of the 14th National Conference on Artificial Intelligence, AAAI'96, PoHland, OR, USA, pages 1194-1201, 1996.
12. F. Manya. The 2-SAT problem in signed CNF formulas. Multiple-Valued Logic, An International Journal, 1999. In press.
13. F. Manya, R. Bejzur, and G. Escalada-Imaz. The satisfiability problem in regular CNF-formulas. Soft Computing: A Fusion of Foundations, Methodologies and Applications, 2(3):116-123, 1998.
14. D. McAUester, B. Selman, and H. Kautz. Evidence for invariants in local search. In Proceedings of the 14th National Conference on Artificial Intelligence, AAAr97, Providence, RI, USA, pages 321-326, 1997.
15. B. Selman and H. A. Kautz. Domain-independent extensions of GSAT: Solving Icirge structured satisfiability problems. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI'OS, Chambery, FVance, pages 290-295, 1993.
16. B. Selman, H. A. Kautz, and B. Cohen. Noise strategies for improving local search. In Proceedings of the 12th National Conference on Artificial Intelligence, AAAr94, Seattle, WA, USA, pages 337-343, 1994.
17. B. Selman, H. Levesque, and D. Mitchell. A new method for solving heurd satisfiability problems. In Proceedings of the 10th National Conference on Artificial Intelligence, AAAr92, San Jose, CA, USA, pages 440-446, 1992.