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 ...

Amsterdam, March 8, 2021 - IOS Press is pleased to announce the publication of the second edition of the classic Handbook of Satisfiability. Originally published in 2009 and part of the Frontiers in ...