Creating generalized procedures by demonstration

Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein

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


We present key components of the ARANDA system for constructing algorithmic, generalized plans for solving broad classes of problems by generalizing solutions of simple problem instances. These generalized plans are powerful enough to solve problem instances varying not only in terms of object properties, but also in the numbers of objects themselves, which may be unbounded. This is achieved by using loops to manipulate the potentially unbounded numbers of objects; in contrast to other approaches, these loops are guaranteed to make measurable progress, as well as to terminate. We also present methods for efficiently determining the class of problem instances which can be solved by a computed generalization.

Original languageEnglish (US)
Title of host publicationPlan, Activity, and Intent Recognition - Papers from the 2010 AAAI Workshop, Technical Report
Number of pages9
StatePublished - 2010
Externally publishedYes
Event2010 AAAI Workshop - Atlanta, GA, United States
Duration: Jul 12 2010Jul 12 2010

Publication series

NameAAAI Workshop - Technical Report


Other2010 AAAI Workshop
Country/TerritoryUnited States
CityAtlanta, GA

ASJC Scopus subject areas

  • General Engineering


Dive into the research topics of 'Creating generalized procedures by demonstration'. Together they form a unique fingerprint.

Cite this