Local search for unsatisfiability

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

Volumn 4121 LNCS, Issue , 2006, Pages 283-296

  Prestwich, Steven ^a   Lynce, Inês ^b  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b INESC ID   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTION EVALUATION; NUMERICAL METHODS; RANDOM PROCESSES; THEOREM PROVING;

BOUNDED MEMORY; LOCAL SEARCH; RANDOMISED RESOLUTION ALGORITHMS; UNSATISFIABILITY;

PROBLEM SOLVING;

EID: 33749557937     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814948_28     Document Type: Conference Paper

References (27)

1. M. Alekhnovich, A. Razborov. Resolution is Not Automizable Unless W[P] is Tractable. Forty-Second IEEE Symposium on FOCS, 2001, pp. 210-219.
2. L. Baptista, J. P. Marques-Silva. Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability. Sixth International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science vol. 1894, Springer 2000, pp. 489-494.
3. E. Ben-Sasson, A. Wigderson. Short Proofs are Narrow -Resolution Made Simple. Journal of the ACM vol. 48 no. 2, 2001, pp. 149-169.
4. E. Ben-Sasson, R. Impagliazzo, A. Wigderson. Near-Optimal Separation of Treelike and General Resolution. Combinatorica vol. 24 no. 4, 2004, pp. 585-603.
5. F. Boussemart, F. Hemery, C. Lecoutre, L. Saïs. Boosting Systematic Search by Weighting Constraints. Sixteenth European Conference on Artificial Intelligence, IOS Press, 2004, pp. 146-150.
6. M. Davis, H. Putnam. A Computing Procedure for Quantification Theory. Journal of the Association of Computing Machinery vol. 7 no. 3, 1960.
7. M. Davis, G. Logemann, D. Loveland. A Machine Program for Theorem Proving. Communications of the ACM vol. 5, 1962, pp. 394-397.
8. J. L. Esteban, J. Torán. Space Bounds for Resolution. Information and Computation vol. 171 no. 1, 2001, pp. 84-97.
9. H. Fang, W. Ruml. Complete Local Search for Prepositional Satisfiability. Nineteenth National Conference on Artificial Intelligence, AAAI Press, 2004, pp. 161-166.
10. I. P. Gent, H. H. Hoos, A. G. D. Rowley, K. Smyth. Using Stochastic Local Search to Solve Quantified Boolean Formulae. Ninth International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science vol. 2833, Springer, 2003, pp. 348-362.
11. I. P. Gent, P. Prosser. SAT Encodings of the Stable Marriage Problem With Ties and Incomplete Lists. Fifth International Symposium on Theory and Applications of Satisfiability Testing, 2002.
12. M. L. Ginsberg, D. McAllester. GSAT and Dynamic Backtracking. International Conference on Principles of Knowledge and Reasoning, 1994, pp. 226-237.
13. C. P. Gomes, B. Selman, H. Kautz. Boosting Combinatorial Search Through Randomization. Fifteenth National Conference on Artificial Intelligence, AAAI Press, 1998, pp. 431-437.
14. J. Gu. Efficient Local Search for Very Large-Scale Satisfiability Problems. Sigart Bulletin vol. 3, no. 1, 1992, pp. 8-12.
15. H. H. Hoos. On the Run-Time Behaviour of Stochastic Local Search Algorithms. Sixteenth National Conference on Artificial Intelligence, AAAI Press, 1999, pp. 661-666.
16. F. Hutter, D. A. D. Tompkins, H. H. Hoos. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT. Eighth International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science vol. 2470, Springer, 2002, pp. 233-248.
17. Y. Interian, G. Corvera, B. Selman, R. Williams. Finding Small Unsatisfiable Cores to Prove Unsatisfiability of QBFs. Ninth International Symposium on AI and Mathematics, 2006.
18. H. A. Kautz, B. Selman. Ten Challenges Redux: Recent Progress in Prepositional Reasoning and Search. Ninth International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science vol. 2833, Springer, 2003, pp. 1-18.
19. C. M. Li, Anbulagan. Look-Ahead Versus Look-Back for Satisfiability Problems. Principles and Practice of Constraint Programming, Proceedings of the Third International Conference, Lecture Notes in Computer Science vol. 1330, Springer-Verlag 1997, pp. 341-355.
20. I. Lynce, J. P. Marques-Silva. Random Backtracking in Backtrack Search Algorithms for Satisfiability. Discrete Applied Mathematics, 2006 (in press).
21. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik. Chaff: Engineering an Efficient SAT Solver. Thirty Eighth Design Automation Conference, Las Vegas, 2001, pp. 530-535.
22. E. T. Richards, B. Richards. Non-Systematic Search and No-Good Learning. Journal of Automated Reasoning vol. 24 no. 4, 2000, pp. 483-533.
23. I. Rish, R. Dechter. Resolution Versus Search: Two Strategies for SAT. Journal of Automated Reasoning vol. 24 nos. 1-2, 2000, pp. 225-275.
24. J. A. Robinson. A Machine-Oriented Logic Based on the Resolution Principle. Journal of the Association for Computing Machinery vol. 12 no. 1, 1965, pp. 2341.
25. B. Selman, H. A. Kautz, D. A. McAllester. Ten Challenges in Prepositional Reasoning and Search. Fifteenth International Joint Conference on Artificial Intelligence, Morgan Kaufmann, 1997, pp. 50-54.
26. B. Selman, H. Levesque, D. Mitchell. A New Method for Solving Hard Satisfiability Problems. Tenth National Conference on Artificial Intelligence, MIT Press, 1992, pp. 440-446.
27. C. Sinz, A. Kaiser, W. Küchlin. Formal Methods for the Validation of Automotive Product Configuration Data. Artificial Intelligence for Engineering Design, Analysis and Manufacturing, vol. 17 no. 2, special issue on configuration, 2003.