Processes and Continuous Change in a SAT-based Planner 1 Ji-Ae Shin Courant Institute, New York University, New York, NY 10012, USA

First Page		Document Content
Date: 2005-02-14 11:22:18 Mathematics 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, USA Add to Reading List Source URL: www.cs.nyu.edu Download Document from Source Website File Size: 495,55 KB Share Document on Facebook

	Theoretical Computer Science–40 www.elsevier.com/locate/tcs Presorting algorithms: An average-case point of view DocID: 1xVR3 - View Document
	Theoretical Computer Science – 551 www.elsevier.com/locate/tcs On the computational strength of pure ambient calculi夡 Sergio Maffeis, Iain Phillips∗ DocID: 1xUAX - View Document
	Theoretical Computer Science–24 Contents lists available at ScienceDirect Theoretical Computer Science www.elsevier.com/locate/tcs DocID: 1xUr4 - View Document
	Advanced Topics in SAT-Solving Part II: Theoretical Aspects Carsten Sinz Wilhelm-Schickard-Institut for Computer Science University of T¨ubingen DocID: 1xTuz - View Document
	CS 153 Current Topics in Theoretical Computer Science Spring 2016 DocID: 1vryF - View Document