Back to Results
First PageMeta Content
Theoretical computer science / Mathematics / Mathematical logic / Logic in computer science / Automated theorem proving / Electronic design automation / Formal methods / NP-complete problems / Satisfiability modulo theories / Boolean satisfiability problem / Substitution / Model theory


Designing Theory Solvers with Extensions Andrew Reynolds1 , Cesare Tinelli1 , Dejan1 JovanoviĀ“c3 , and Clark Barrett2 1 Department of Computer Science, The University of Iowa Department of Computer Science, Stanford Uni
Add to Reading List

Document Date: 2018-04-25 11:34:43


Open Document

File Size: 334,94 KB

Share Result on Facebook