Date: 2006-11-16 20:30:50Theoretical computer science Mathematical logic Mathematics Boolean algebra Logic in computer science Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem Phnom Penh Solver Propositional calculus | | Splitting on Demand in SAT Modulo Theories Clark Barrett, Robert Nieuwenhuis, Albert Oliveras, Cesare Tinelli New York Univ. Techn. Univ. CataloniaAdd to Reading ListSource URL: www.lsi.upc.eduDownload Document from Source Website File Size: 836,77 KBShare Document on Facebook
|