Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings
- 19 January 2006
- journal article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 35 (1-3) , 143-179
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Capturing Structure with Satisfiability2001
- Integer Optimization by Local Search1999
- A Comparison of Systematic and Local Search Algorithms for Regular CNF Formulas1999
- Applying GSATto Non-Clausal FormulasJournal of Artificial Intelligence Research, 1994
- Embedding partial steiner triple systems is NP-completeJournal of Combinatorial Theory, Series A, 1983
- A machine program for theorem-provingCommunications of the ACM, 1962