Date: 2010-05-19 04:29:26Theoretical computer science Automated planning and scheduling Logic in computer science Mathematics Computational complexity theory Boolean algebra Electronic design automation Formal methods Boolean satisfiability problem Maximum satisfiability problem Planning Domain Definition Language Satz | | An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. AbstractAdd to Reading ListSource URL: ceur-ws.orgDownload Document from Source Website File Size: 87,56 KBShare Document on Facebook
|