A comparison of systematic and local search algorithms for regular CNF formulas

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

Volumn 1638, Issue , 1999, Pages 22-31

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

^a UNIVERSITY OF LLEIDA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

LOCAL SEARCH (OPTIMIZATION);

CNF FORMULAS; EXPERIMENTAL EVIDENCE; LOCAL SEARCH ALGORITHM; LOCAL SEARCH METHOD;

MANY VALUED LOGICS;

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

References (10)

1. 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, pages 292-300. Springer LNAI 1609, 1999.
2. R. Hähnle. Uniform notation of tableaux rules for multiple-valued logics. In Proceedings International Symposium on Multiple-Valued Logic, Victoria, pages 238-245. IEEE Press, 1991.
3. R. Hähnle. Short conjunctive normal forms in finitely-valued logics. Journal of Logic and Computation, 4(6):905-927, 1994.
4. R. Hähnle. Exploiting data dependencies in many-valued logics. Journal of Applied Non-Classical Logics, 6:49-69, 1996.
5. R. Hähnle. Personal communication, 1998.
6. J. N. Hooker and V. Vinay. Branching rules for satisfiability. Journal of Automated Reasoning, 15:359-383, 1995.
7. F. Manyà, R. Béjar, 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.
8. D. McAllester, B. Selman, and H. Kautz. Evidence for invariants in local search. In Proceedings of the lfth National Conference on Artificial Intelligence, AAAI’97, Providence/RI, USA, pages 321-326, 1997.
9. B. Selman, H. A. Kautz, and B. Cohen. Noise strategies for local search. In Proceedings of the 12th National Conference on Artificial Intelligence, AAAI’94, Seattle/WA, USA, pages 337-343, 1994.
10. B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard satisfiability problems. In Proceedings of the 10th, National Conference on Artificial Intelligence, AAAI’92, San Jose/CA, USA, pages 440-446, 1992.