Termination and Correctness Analysis of Cyclic Control

Siddharth Srivastava, Neil Immerman, and Shlomo Zilberstein. Termination and Correctness Analysis of Cyclic Control. Proceedings of the Twenty-Fifth Conference on Artificial Intelligence (AAAI Nextar Track), 1567-1570, San Francisco, California, 2011.

Abstract

The utility of including cyclic flow of control in plans has been long recognized by the planning community. Loops in a plan increase both its applicability and the compactness of representation. However, progress in finding such plans has been limited largely due to lack of methods for reasoning about the correctness and applicability of loops of actions. We present an overview of recent results for determining the class of problems that a plan with loops can solve. These methods can be used to direct the construction of a rich new form of generalized plans that solve a desired class of problems.

Bibtex entry:

@inproceedings{SIZaaai11,
  author        = {Siddharth Srivastava and Neil Immerman and Shlomo Zilberstein},
  title		= {Termination and Correctness Analysis of Cyclic Control},
  booktitle     = {Proceedings of the Twenty-Fifth Conference on
		   Artificial Intelligence},
  year		= {2011},
  pages		= {1567-1570},
  address       = {San Francisco, California},
  url		= {http://rbr.cs.umass.edu/shlomo/papers/SIZaaai11.html}
}

shlomo@cs.umass.edu