Capturing structure with satisfiability

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

Volumn 2239, Issue , 2001, Pages 137-152

  Béjar, Ramón ^a   Cabiscol, Alba ^b   Fernàndez, Cèsar ^b   Manyà, Felip ^b   Gomes, Carla ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

^b UNIVERSITY OF LLEIDA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER PROGRAMMING; CONSTRAINT THEORY; FORMAL LOGIC;

BENCHMARK DOMAINS; BOOLEAN SATISFIABILITY; CNF FORMULAS; COMPUTATIONAL ADVANTAGES; PERFORMANCE ANALYSIS; PROBLEM STRUCTURE; SAT SOLVERS; SATISFIABILITY;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84947918069     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45578-7_10     Document Type: Conference Paper

References (23)

1. D. Achlioptas, C. P. Gomes, H. Kautz, and B. Selman. Generating satisfiable problem instances. In Proc. of AAAI-2000, pages 256–261, 2000.
2. R. J. Bayardo and R. C. Schrag. Using CSP look-back techniques to solve realworldSA T instances. In Proc. of AAAI’97, pages 203–208, 1997.
3. B. Beckert, R. Hahnle and F. Manya. The SAT problem of signedCNF formulas. In Labelled Deduction, pages 61–82, Kluwer, 2000.
4. R. Bejar. Systematic and Local Search Algorithms for Regular-SAT. PhD thesis, Universitat Aut`onoma de Barcelona, 2000.
5. R. Bejar and F. Manya. Phase transitions in the regular random 3-SAT problem. In Proc. of ISMIS’99, pages 292–300. LNAI 1609, 1999.
6. R. Bejar and F. Manya. A comparison of systematic andlo cal search algorithms for regular CNF formulas. In Proc. of ECSQARU’99, pages 22–31. LNAI 1638, 1999.
7. R. Bejar and F. Manya. Solving combinatorial problems with regular local search algorithms. In Proc. of LPAR’99, pages 33–43. LNAI 1705, 1999.
8. J. C. Culberson and F. Luo. Exploring the k-colorable landscape with iterated greedy. In Cliques, Coloring and Satisfiability, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 1996.
9. M. Davis, G. Logemann, and D. Loveland. A machine program for theoremproving. Communications of the ACM, 5:394–397, 1962.
10. A.M. Frisch and T.J. Peugniez. Solving non-Boolean satisfiability problems with stochastic local search. In Proc. of IJCAI’01, pages 282–288, 2001.
11. C. Gomes, H. Kautz, and Y. Ruan. QWH - A structuredb enchmark domain for local search. Technical Report, Intelligent Information Systems Institute (IISI), Cornell University, 2001.
12. C. Gomes, B. Selman, and N. Crato. Heavy-tailedd istributions in combinatorial search. In Proc. of CP’97, pages 121–135. Springer LNCS 1330, 1997.
13. C. P. Gomes and B. Selman. Problem structure in the presence of perturbations. In Proc. of AAAI’97, pages 221–226, 1997.
14. R. Hahnle. Short conjunctive normal forms in finitely-valuedlogics. Journal of Logic and Computation, 4(6):905–927, 1994.
15. R. Hahnle. Exploiting data dependencies in many-valued logics. Journal of Applied Non-Classical Logics, 6:49–69, 1996.
16. H. Hoos and T. Stutzle. Local search algorithms for SAT: An empirical evaluation. Journal of Automated Reasoning, 24(4):421–481, 2000.
17. C. M. Li and An bulagan. Look-aheadv ersus look-back for satisfiability problems. In Proc. of CP’97, pages 341–355. LNCS 1330, 1997.
18. F. Manya. The 2-SAT problem in signedCNF formulas. Multiple-Valued Logic. An International Journal, 5(4):307–325, 2000.
19. K. McAloon, C. Tretkoff, and G. Wetzel. Sports league scheduling. In Proc. of ILOG International Users Meeting, 1997.
20. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Determining computational complexity from characteristic’phase transitions’. Nature, 400(8), 1999.
21. J.-C. Regin. A filtering algorithm for constraints of difference in CSPs. In Proc. of AAAI’94, pages 362–367, 1994.
22. B. Selman, H. A. Kautz, and B. Cohen. Noise strategies for improving local search. In Proc. of AAAI’94, pages 337–343, 1994.
23. K. Stergiou and T. Walsh. The difference all-difference makes. In Proc. of IJCAI’ 99, 1999.