58 search results - page 1 / 12 » Redundancy in Random SAT Formulas |
AAAI
2000
13 years 6 months ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...
ISAAC
2004
Springer
13 years 10 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
SAT
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We study simple classes of mixed Horn formulas, in which the structure of the Horn part is drastically constrained. We show that the SAT problem for formulas in these cla...
ICTAI
2008
IEEE
13 years 11 months ago
2008
IEEE
Handling redundancy in propositional reasoning and search is an active path of theoretical research. For instance, the complexity of some redundancy-related problems for CNF formu...
IJCAI
2001
13 years 6 months ago
2001
Of late, new insight into the study of random -SAT