ArticlesExtending the Reach of SAT with Many-Valued Logics
References (20)
- et al.
Generating satisfiable problem instances
Proc. of AAAI-2000
(2000) - et al.
Using CSP look-back techniques to solve real-world SAT instances
Proc. of AAAI'97
(1997) Systematic and Local Search Algorithms for Regular-SAT. PhD thesis, Universitat Autonoma de Barcelona
(2000)- et al.
Phase transitions in the regular random 3-SAT problem
Proc. of ISMIS'99
(1999) - et al.
Exploring the k-colorable landscape with iterated greedy
Cliques, Coloring and Satisfiability, volume 26 of DIM ACS Series in Discrete Mathematics and Theoretical Computer Science.
(1996) - et al.
A machine program for theorem-proving
Communications of the ACM
(1962) - et al.
QWH - A structured benchmark domain for local search
Technical Report, Intelligent Information Systems Institute (IISI), Cornell University
(2001) - et al.
- et al.
Problem structure in the presence of perturbations
Proc. of AAAI'97
(1997)
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2004 Elsevier Ltd. All rights reserved.