Back to Results
First PageMeta Content
Constraint programming / Mathematics / DPLL algorithm / Knowledge compilation / Connectivity / Influence diagram / Bayesian network / Unit propagation / Theoretical computer science / Automated theorem proving / Applied mathematics


D SHARP: Fast d-DNNF Compilation with sharpSAT Christian Muise1 , Sheila A. McIlraith1 , J. Christopher Beck2 , and Eric Hsu1 1 Department of Computer Science, University of Toronto, Toronto, Canada. {cjmuise, sheila, ei
Add to Reading List

Document Date: 2012-03-14 09:53:05

Open Document

File Size: 222,83 KB

Share Result on Facebook

Company

CNF / 3SAT / McIlraith S.A. / Implicit Binary Constraint Propagation D SHARP / /

Country

Canada / /

/

Facility

University of Toronto / /

IndustryTerm

search proceeds / relational bayesian networks / search tree / exhaustive search / search space / pre-processing / search effort / /

OperatingSystem

Linux / /

Organization

University of Toronto / Toronto / Department of Computer Science / Ontario Ministry of Innovation and the Natural Sciences / Department of Mechanical & Industrial Engineering / Natural Sciences and Engineering Research Council of Canada / International Joint Conference On Artificial Intelligence / /

PublishedMedium

Journal of Artificial Intelligence Research / /

Technology

artificial intelligence / 3.0GHz processor / #SAT technology / Linux / exhaustive DPLL algorithm / caching / /

URL

http /

SocialTag