Back to Results
First PageMeta Content
Unsatisfiable core / Conjunctive normal form / Resolution / Five lemma / Theorem / Logic programming / Unit propagation / Automated proof checking / Boolean satisfiability problem / Logic / Mathematics / Automated theorem proving


Trimming while Checking Clausal Proofs Marijn J.H. Heule, Warren A. Hunt, Jr., and Nathan Wetzler The University of Texas at Austin Abstract—Conflict-driven clause learning (CDCL) satisfiability solvers can emit more t
Add to Reading List

Document Date: 2014-01-02 11:58:01

Open Document

File Size: 407,74 KB

Share Result on Facebook

City

Berlin / /

Company

FMCAD Inc. / IOS Press / Picosat / Intel / /

Facility

Nathan Wetzler The University of Texas / /

IndustryTerm

interpolant tools / backward checking algorithm / search procedure / extraction tool / proof-checking tool / /

OperatingSystem

MacOS / /

Organization

Artifical Intelligence / University of Texas at Austin / s.t. unit / /

Person

Y. Vizel / V / N. Wetzler / Van Gelder / A. Van Gelder / Warren A. Hunt / Jr. / W. A. Hunt / Jr. / J. H. Heule / /

Position

Forward / A. Forward / /

Product

DRUP / Muser / /

ProvinceOrState

Texas / /

PublishedMedium

Lecture Notes in Computer Science / /

Technology

i7 2.6GHz processor / SAT-solver technology / artificial intelligence / CAV / backward checking algorithm / A. Adding Deletion Information The RUP checking algorithm / checking algorithm / RUP checking algorithm / /

URL

http /

SocialTag