Termination and correctness analysis of cyclic control

Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish (US)
Title of host publicationAAAI-11 / IAAI-11 - Proceedings of the 25th AAAI Conference on Artificial Intelligence and the 23rd Innovative Applications of Artificial Intelligence Conference
Pages1567-1570
Number of pages4
StatePublished - 2011
Externally publishedYes
Event25th AAAI Conference on Artificial Intelligence and the 23rd Innovative Applications of Artificial Intelligence Conference, AAAI-11 / IAAI-11 - San Francisco, CA, United States
Duration: Aug 7 2011Aug 11 2011

Publication series

NameProceedings of the National Conference on Artificial Intelligence
Volume2

Other

Other25th AAAI Conference on Artificial Intelligence and the 23rd Innovative Applications of Artificial Intelligence Conference, AAAI-11 / IAAI-11
Country/TerritoryUnited States
CitySan Francisco, CA
Period8/7/118/11/11

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Termination and correctness analysis of cyclic control'. Together they form a unique fingerprint.

Cite this