Back to Results
First PageMeta Content
Automated theorem proving / Boolean algebra / NP-complete problems / Constraint programming / Logic in computer science / Boolean satisfiability problem / Davis–Putnam algorithm / Satisfiability / Unit propagation / Theoretical computer science / Mathematics / Computational complexity theory


Artificial Intelligence ELSEVIER Artificial Intelligence[removed]345
Add to Reading List

Document Date: 2013-07-29 01:10:58

Open Document

File Size: 620,87 KB

Share Result on Facebook

City

Washington / DC / Amsterdam / New York / Sydney / /

Company

3SAT / Elsevier Science B.V. / SAT 338 LP. / /

Country

Australia / United Kingdom / /

Currency

USD / /

/

Facility

Cornell University / South Bridge / Edinburgh University / University of Edinburgh / /

IndustryTerm

satisfiability algorithms / search tree / computing / median search cost / search depth / /

Organization

INRIALorraine / Edinburgh University / Department of Computer Science / T. Walsh/Artificial Intelligence / University of Edinburgh / Department of Al / Artificial Intelligence ELSEVIER Artificial Intelligence / Cornell University / /

Person

Ian P. Gent / Alan Bundy / Toby Walsh / Paul Purdom / Pierre Lescanne / /

/

Position

Bob Constable / first author / Corresponding author / /

ProvinceOrState

New York / /

Technology

artificial intelligence / Davis-Putnam algorithm / benchmarking satisfiability algorithms / improved algorithm / /

SocialTag