Lemma Reusing for SAT based Planning and Scheduling.
Hidetomo NabeshimaTakehide SohKatsumi InoueKoji IwanumaPublished in: ICAPS (2006)
Keyphrases
- ai planning
- planning problems
- planning domains
- classical planning
- heuristic search
- production planning
- scheduling problem
- domain independent
- flexible manufacturing systems
- state space
- plan quality
- decision support
- resource allocation
- planning systems
- sat encodings
- bounded model checking
- job shop scheduling
- resource constraints
- answer set programming
- sat solvers
- scheduling algorithm
- learning objects
- parallel machines
- planning process
- blocks world
- domain specific
- response time
- dynamic programming