Back to Results
First PageMeta Content
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

Document Date: 2005-02-14 11:22:18

Open Document

File Size: 495,55 KB

Share Result on Facebook

City

A DPLL / Graphplan / /

Company

McDermott / /

/

Facility

Courant Institute / Ji-Ae Shin Courant Institute / New York University / /

IndustryTerm

large systems / backward search / propositional solution / binary search / simpler solution / depth-first search / basic backtracking search using such techniques / software components / search heuristics / /

Organization

New York University / New York / National Science Foundation / US Federal Reserve / Courant Institute / Ji-Ae Shin Courant Institute / International Planning Committee / /

Person

Daniel Weld / Steven Wolfman / Ernest Davis / /

Position

powerful and elegant planner / TM-LPSAT planner / first planner / Abstract The TM-LPSAT planner / metric planner / SAT-based Planner / estimated-regression planner / LPSAT planner / planner / SAT-based propositional planner / /

ProvinceOrState

New York / /

Technology

RAM / artificial intelligence / finite state machine / DPLL algorithm / operating system / /

URL

http /

SocialTag