Back to Results
First PageMeta Content
NP-complete problems / Automated theorem proving / Constraint programming / Boolean algebra / Formal methods / DPLL algorithm / Boolean satisfiability problem / Conjunctive normal form / Lookup table / Theoretical computer science / Applied mathematics / Mathematics


Combining Component Caching and Clause Learning for Effective Model Counting Tian Sang1 , Fahiem Bacchus2 , Paul Beame1 , Henry Kautz 1 , and Toniann Pitassi 2 1 Computer Science and Engineering, University of Washingto
Add to Reading List

Document Date: 2004-04-13 00:26:28

Open Document

File Size: 91,28 KB

Share Result on Facebook

City

Boston / Aarhus / San Jose / /

Company

CNF / SIAM Journal / Las Vegas NV / /

Country

Denmark / /

/

Facility

University of Washington / University of Toronto / /

IndustryTerm

component caching algorithm / failed search path / depth-first search / search tree / computing / /

Organization

University of Washington / University of Toronto / /

Person

Lintao Zhang / Adnan Darwiche / Conor F. Madigan / Matthew W. Moskewicz / Roberto J. Bayardo Jr. / Henry Kautz / Matthew H. Moskewicz / Seinosuke Toda / Robert C. Schrag / Ying Zhao / Russell Impagliazzo / Sharad Malik / Paul Beame / Nathan Segerlind / Ashish Sabharwal / Toniann Pitassi / Joseph D. Pehoushek / /

/

ProvinceOrState

California / Massachusetts / /

PublishedMedium

SIAM Journal on Computing / /

Technology

#SAT algorithms / 1 #DPLL Algorithm / component caching algorithm / #DPLL algorithm / artificial intelligence / 3 #DPLL Algorithm / Caching / 2 DPLL Algorithm / /

SocialTag