Bayardo Jr., R. J.; Schrag, R. C. Using CSP look-back techniques to solve real world SAT instances. In: Proc. of the 14th National Conf. on Artificial Intelligence ...
Recent decades have witnessed remarkable progress in the study of Boolean satisfiability – the problem of determining whether a given propositional formula can be satisfied – and its natural extension ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback