Polynomial Restrictions of SAT: What Can Be Done with an Efficient Implementation of the Davis and Putnam s Procedure?

Antoine Rauzy. Polynomial Restrictions of SAT: What Can Be Done with an Efficient Implementation of the Davis and Putnam s Procedure?. In Ugo Montanari, Francesca Rossi, editors, Principles and Practice of Constraint Programming - CP 95, First International Conference, CP 95, Cassis, France, September 19-22, 1995, Proceedings. Volume 976 of Lecture Notes in Computer Science, pages 515-532, Springer, 1995.

Abstract

Abstract is missing.