![Automated theorem proving / Complexity classes / Boolean algebra / Model theory / True quantified Boolean formula / Predicate logic / Resolution / Skolem normal form / FO / Theoretical computer science / Mathematics / Mathematical logic Automated theorem proving / Complexity classes / Boolean algebra / Model theory / True quantified Boolean formula / Predicate logic / Resolution / Skolem normal form / FO / Theoretical computer science / Mathematics / Mathematical logic](https://www.pdfsearch.io/img/3b89219ef6e67a1cdbd70a269dd077c2.jpg) Date: 2008-01-30 18:21:35Automated theorem proving Complexity classes Boolean algebra Model theory True quantified Boolean formula Predicate logic Resolution Skolem normal form FO Theoretical computer science Mathematics Mathematical logic | | A First Step Towards a Unified Proof Checker for QBF Toni Jussila1 , Armin Biere1 , Carsten Sinz2 , Daniel Kr¨ oning3 , and Christoph M. Wintersteiger3 1Add to Reading ListSource URL: www.winterstiger.atDownload Document from Source Website File Size: 217,73 KBShare Document on Facebook
|