Date: 2005-02-14 11:22:18Mathematics Automated planning and scheduling Programming paradigms Operations research Planning Domain Definition Language Logic in computer science Boolean satisfiability problem Constraint satisfaction Linear programming Theoretical computer science Applied mathematics Constraint programming | | Processes and Continuous Change in a SAT-based Planner 1 Ji-Ae Shin Courant Institute, New York University, New York, NY 10012, USAAdd to Reading ListSource URL: www.cs.nyu.eduDownload Document from Source Website File Size: 495,55 KBShare Document on Facebook
|