Back to Results
First PageMeta Content
Mathematics / Automated theorem proving / Logic in computer science / Boolean algebra / Boolean satisfiability problem / Electronic design automation / Conjunctive normal form / Unit propagation / Resolution / Theoretical computer science / Constraint programming / Applied mathematics


Resolution versus Search: Two Strategies for SAT  Irina Rish and Rina Dechter Information and Computer Science University of California, Irvine
Add to Reading List

Document Date: 2000-11-01 13:42:40

Open Document

File Size: 727,31 KB

Share Result on Facebook

/

Facility

Computer Science University of California / /

IndustryTerm

incomplete local search techniques / directional resolution algorithm / hybrid algorithm / tree-clustering algorithm / query processing / resolution algorithm / ective hybrid algorithms / constraint network / knowledge-compilation algorithm / hybrid algorithms / variable processing / /

Organization

National Science Foundation / University of California / Irvine / /

Person

Min Up Time Min Down / Rina Dechter / Irina Rish / /

Technology

knowledge-compilation algorithm / resolution algorithm / ordering-based resolution algorithm / directional resolution algorithm / two hybrid algorithms / tree-clustering algorithm / Davis-Putnam algorithm / SAT algorithms / ective hybrid algorithms / /

SocialTag