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 ...
Vol. 100, No. 6, Recent Developments related to Residuated Lattices and Substructural Logics (December 2012), pp. 1271-1290 (20 pages) In 1979, H. Lewis shows that the computational complexity of the ...
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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results