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

	in Knowledge Engineering Reviews, 2001 Synthesis of EÆcient Constraint Satisfaction Programs Stephen J. Westfold and Douglas R. Smith Kestrel Institute 3260 Hillview Avenue DocID: 1xVgq - View Document
	Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems∗ Eli Ben-Sasson† Alessandro Chiesa† DocID: 1xTDp - View Document
	A Dichotomy Theorem for the Resolution Complexity of Random Constraint Satisfaction Problems Siu On Chan and Michael Molloy Department of Computer Science University of Toronto {siuon,molloy}@cs.toronto.edu DocID: 1uD4W - View Document
	1 Overview • This talk is about: – The Boolean Satisfiability Problem (SAT) – The Constraint Satisfaction Problem (CSP) DocID: 1ukgD - View Document
	5 CONSTRAINT SATISFACTION PROBLEMS In which we see how treating states as more than just little black boxes leads to the DocID: 1uf9a - View Document