Date: 2007-07-09 05:14:16Theoretical computer science Logic in computer science Formal methods Mathematical logic Mathematics Electronic design automation NP-complete problems Constraint programming Boolean satisfiability problem Satisfiability modulo theories Horn clause Satisfiability | | CAV 2007 19th International Conference on Computer-Aided Verification July 2007, Berlin, Germany SMT 2007:Add to Reading ListSource URL: www.lsi.upc.eduDownload Document from Source Website File Size: 1,09 MBShare Document on Facebook
|