1667 search results - page 66 / 334 » Extended clause learning |
SAT
2009
Springer
14 years 3 months ago
2009
Springer
We propose a new incomplete algorithm for the Maximum Satisfiability (MaxSAT) problem on unweighted Boolean formulas, focused specifically on instances for which proving unsatis...
SAT
2009
Springer
14 years 3 months ago
2009
Springer
State-of-the-art solvers for Quantified Boolean Formulas (QBF) have employed many techniques from the field of Boolean Satisfiability (SAT) including the use of Conjunctive Norm...
ELPUB
2006
ACM
14 years 3 months ago
2006
ACM
This contribution presents the concept and analyses the path of diffusion of an innovative publishing idea that originated in one speciality in physics and is now about to spread ...
VMCAI
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. It is a hotly researching topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. K Ravi proposes a two-stages counterexample min...
CP
2004
Springer
14 years 2 months ago
2004
Springer
It is well known that the ratio of the number of clauses to the number of variables in a random k-SAT instance is highly correlated with the instance’s empirical hardness. We con...