![Logic in computer science / Boolean algebra / Electronic design automation / Formal methods / NP-complete problems / Boolean satisfiability problem / True quantified Boolean formula / Maximum satisfiability problem / Model checking / Conjunctive normal form / Satisfiability / Tseytin transformation Logic in computer science / Boolean algebra / Electronic design automation / Formal methods / NP-complete problems / Boolean satisfiability problem / True quantified Boolean formula / Maximum satisfiability problem / Model checking / Conjunctive normal form / Satisfiability / Tseytin transformation](https://www.pdfsearch.io/img/5aeeb161f13b44280eb37ca1cbe1d819.jpg) Date: 2012-12-16 04:54:55Logic in computer science Boolean algebra Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem True quantified Boolean formula Maximum satisfiability problem Model checking Conjunctive normal form Satisfiability Tseytin transformation | | Abstraction-Based Algorithm for 2QBF Mikol´asˇ Janota2 and Joao Marques-Silva1,2 1 University College Dublin, Ireland 2Add to Reading ListSource URL: www.mancoosi.orgDownload Document from Source Website File Size: 639,17 KBShare Document on Facebook
|