Back to Results
First PageMeta Content
Automated theorem proving / Boolean algebra / Mathematical logic / Resolution / True quantified Boolean formula / Conjunctive normal form / Limit / Literal / Model theory / Mathematics / Logic / Theoretical computer science


A Unified Proof System for QBF Preprocessing? Marijn J.H. Heule1 , Martina Seidl2 , and Armin Biere2 1 Department of Computer Science, The University of Texas at Austin, USA [removed]
Add to Reading List

Document Date: 2014-07-31 09:57:45


Open Document

File Size: 368,02 KB

Share Result on Facebook

Company

CNF / /

Country

Austria / United States / /

/

Facility

The University of Texas / /

IndustryTerm

research network / /

Organization

Institute for Formal Models and Verification / University of Texas at Austin / National Science Foundation / Vienna Science and Technology Fund / Department of Computer Science / Austrian Science Fund / /

Position

model for φ / /

Product

M-16 / /

ProgrammingLanguage

C / /

ProvinceOrState

Texas / /

SocialTag