Date: 2016-06-09 08:09:17Theoretical computer science Logic Mathematical logic Logic in computer science Constraint programming Electronic design automation Formal methods NP-complete problems Satisfiability modulo theories Automated planning and scheduling Solver Planning Domain Definition Language | | U NIVERSITAT DE G IRONA ` ` D EPARTAMENT D ’I NFORM ATICA , M ATEM ATICAAdd to Reading ListSource URL: icaps16.icaps-conference.orgDownload Document from Source Website File Size: 114,42 KBShare Document on Facebook
|