Back to Results
First PageMeta Content
Automated theorem proving / Formal methods / NP-complete problems / Constraint programming / Logic in computer science / True quantified Boolean formula / Resolution / Satisfiability Modulo Theories / Unsatisfiable core / Theoretical computer science / Mathematics / Logic


DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs Nathan Wetzler, Marijn J. H. Heule, and Warren A. Hunt, Jr. ?
Add to Reading List

Document Date: 2014-04-02 18:01:43

Open Document

File Size: 243,74 KB

Share Result on Facebook

City

Haifa / DRAT / be validated using DRAT-trim / /

Company

CNF / IOS Press / AAAI Press / /

Continent

Europe / /

Facility

University of Texas / /

IndustryTerm

potential applications / proof checking algorithms / post-processing / retrieval algorithms / extraction tools / mechanically-verified proof checking tool / pre-processing / /

Organization

University of Texas at Austin / /

Person

Marijn J. H. Heule / Gomes / Van Gelder / Proofs Nathan Wetzler / Warren A. Hunt / Jr. / /

Position

MUS extractor / /

ProvinceOrState

Texas / /

Technology

artificial intelligence / http / proof checking algorithms / Partial-match retrieval algorithms / /

URL

http /

SocialTag