Solving non-Boolean satisfiability problems with stochastic local search

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 282-288

  Frisch, Alan M ^a   Peugniez, Timothy J ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN REPRESENTATION; DOMAIN SIZE; EXPERIMENTAL EVIDENCE; LARGE DOMAIN; SATISFIABILITY PROBLEMS; SATISFYING ASSIGNMENTS; STOCHASTIC LOCAL SEARCHES;

ARTIFICIAL INTELLIGENCE;

STOCHASTIC SYSTEMS;

EID: 84880872693     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Ramon Béjar and Felip Manyà. Solving combinatorial problems with regular local search algorithms. In Harald Ganzinger and David McAllester, editors, Proc. 6th Int. Conference on Logic for Programming and Automated Reasoning, LPAR, Tbilisi, Georgia, volume 1705 of Lecture Notes in Artificial Intelligence, pages 33-43. Springer-Verlag, 1999.
2. Ramon Béjar, Reiner Hähnle, and Felip Manyá. A modular reduction of regular logic to classical logic. In Proc. 31st International Symposium on Multiple-Valued Logics, Warsaw, Poland. IEEE CS Press, Los Alamitos, May 2001.
3. Ronen I. Brafman and Holger H. Hoos. To encode or not to encode - I: Linear planning. In Proc. of the Sixteenth Int. Joint Conf. on Artificial Intelligence, pages 988-993. Morgan Kaufman, 1999.
4. Michael D. Ernst, Todd D. Millstein, and Daniel S. Weld. Automatic SAT-compilation of planning problems. In Proc. of the Fifteenth Int. Joint Conf. on Artificial Intelligence, pages 1169-1176, 1997.
5. Alan M. Frisch and Timothy J. Peugniez. Solving non-Boolean satisfiability problems with local search. In Fifth Workshop on Automated Reasoning: Bridging the Gap between Theory and Practice, St. Andrews, Scotland, April 1998.
6. Holger H. Hoos. Stochastic Local Search - Methods, Models, Applications. PhD thesis, Technical University of Darmstadt, 1998.
7. Holger H. Hoos. SAT-encodings, search space structure, and local search performance. In Proc. of the Sixteenth Int. Joint Conf. on Artificial Intelligence, pages 296-302. Morgan Kaufman, 1999.
8. Henry A. Kautz and Bart Selman. Planning as satisfiability. In Bernd Neumann, editor, Proc. of the Tenth European Conf. on Artificial Intelligence, pages 359-363, Vienna, Austria, August 1992. John Wiley & Sons.
9. Henry A. Kautz and Bart Selman. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proc. of the Thirteenth National Conf. on Artificial Intelligence, pages 1202-1207, Portland, Oregon, USA, 1996. AAAI Press / The MIT Press.
10. Henry A. Kautz, David McAllester, and Bart Selman. Encoding plans in propositional logic. In Luigia Carlucci Aiello, Jon Doyle, and Stuart Shapiro, editors, Principles of Knowledge Representation and Reasoning: Proc. of the Fifth Int. Conf., pages 374-385, San Francisco, 1996. Morgan Kaufmann.
11. Steven Minton, Mark D. Johnson, Andrew B. Philips, and Philip Laird. Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58(1-3):161-205, 1992.
12. David Mitchell, Bart Selman, and Hector J. Levesque. Hard and easy distributions of SAT problems. In Proc. of the Tenth National Conf. on Artificial Intelligence, pages 459-465, San Jose, CA, 1992. MIT Press.
13. Timothy J. Peugniez. Solving non-Boolean satisfiability problems with local search. BSc thesis, Department of Computer Science, University of York, March 1998.
14. Roberto Sebastiani. Applying GSAT to non-clausal formulas. Journal of Artificial Intelligence Research, 1:309-314, 1994.
15. Bart Selman, Hector J. Levesque, and David Mitchell. A new method for solving hard satisfiability problems. In Proc. of the Tenth National Conf. on Artificial Intelligence, pages 440-446. AAAI Press, 1992.
16. Bart Selman, Henry A. Kautz, and Bram Cohen. Noise strategies for improving local search. In Proc. of the Twelfth National Conf. on Artificial Intelligence, pages 337-343, Menlo Park, CA, USA, 1994. AAAI Press.
17. Joachim P. Walser. Solving linear pseudo-Boolean constraint problems with local search. In Proc. of the Fourteenth National Conf. on Artificial Intelligence, pages 269-274. AAAI Press, 1997.