- Siddharth Srivastava, Neil Immerman, Shlomo
Zilberstein. Finding
Plans with Branches, Loops and Preconditions,
ICAPS 2009 Workshop on Verification and Validation of Planning and
Scheduling Systems, 2009. [slides]
- Siddharth Srivastava, Neil Immerman, Shlomo
Zilberstein. Challenges
in Finding Generalized Plans,
ICAPS 2009 Workshop on Generalized Planning: Macros, Loops, Domain Control,
2009. [slides]
- Siddharth Srivastava, Neil Immerman, Shlomo
Zilberstein. Abstract
Planning with Unknown Object Quantities and Properties,
Eighth Symposium on Abstraction, Reformulation and Approximation,
2009. [slides]
- T. Lev-Ami, N. Immerman, T. Reps, M. Sagiv, S. Srivastava and
G. Yorsh. Simulating
Reachability using First-Order Logic with Applications to
Verification of Linked Data Structures, Logical Methods in
Computer Science, 5(2), Paper 12, 2009.
- Siddharth Srivastava, Neil Immerman, Shlomo
Zilberstein. Learning Generalized Plans Using Abstract
Counting. In Proceedings of The Twenty Third AAAI Conference on
Artificial Intelligence, 2008. [slides]
- Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein. Using
Abstraction for Generalized
Planning, International Symposium on AI and Mathematics,
2008.
An earlier version of this work appeared at the ICAPS Workshop on
Artificial Intelligence Planning and Learning, 2007.
- Siddharth Srivastava, Neil Immerman, Shlomo
Zilberstein.
Using Abstraction for Generalized Planning (Extended
Version), Technical Report 07-41, Deptt. of Computer
Science, University of Massachusetts, Amherst, 2007.
- T. Lev-Ami, N. Immerman, T. Reps, M. Sagiv, S. Srivastava and
G. Yorsh.
Simulating Reachability Using First-Order Logic With Applications to
Verification of Linked Data Structures, International Conference on
Automated Deduction, 2005.
|