THE COMPLEXITY OF MODEL CHECKING FOR BOOLEAN FORMULAS
From MaRDI portal
Publication:3569272
DOI10.1142/S0129054110007258zbMath1192.68436MaRDI QIDQ3569272
Publication date: 18 June 2010
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
On the applicability of Post's lattice, The complexity of circumscriptive inference in Post's lattice
Cites Work