Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases

Ruiwen Chen. Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases. In Giuseppe F. Italiano, Giovanni Pighizzini, Donald Sannella, editors, Mathematical Foundations of Computer Science 2015 - 40th International Symposium, MFCS 2015, Milan, Italy, August 24-28, 2015, Proceedings, Part II. Volume 9235 of Lecture Notes in Computer Science, pages 223-234, Springer, 2015. [doi]

Abstract

Abstract is missing.