Creating generalized procedures by demonstration

Siddharth Srivastava, Neil Immerman, Shlomo Zilberstein

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

Abstract

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
Pages61-69
Number of pages9
VolumeWS-10-05
StatePublished - Dec 1 2010
Externally publishedYes
Event2010 AAAI Workshop - Atlanta, GA, United States
Duration: Jul 12 2010Jul 12 2010

Other

Other2010 AAAI Workshop
CountryUnited States
CityAtlanta, GA
Period7/12/107/12/10

Fingerprint

Demonstrations

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Srivastava, S., Immerman, N., & Zilberstein, S. (2010). Creating generalized procedures by demonstration. In Plan, Activity, and Intent Recognition - Papers from the 2010 AAAI Workshop, Technical Report (Vol. WS-10-05, pp. 61-69)

Creating generalized procedures by demonstration. / Srivastava, Siddharth; Immerman, Neil; Zilberstein, Shlomo.

Plan, Activity, and Intent Recognition - Papers from the 2010 AAAI Workshop, Technical Report. Vol. WS-10-05 2010. p. 61-69.

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

Srivastava, S, Immerman, N & Zilberstein, S 2010, Creating generalized procedures by demonstration. in Plan, Activity, and Intent Recognition - Papers from the 2010 AAAI Workshop, Technical Report. vol. WS-10-05, pp. 61-69, 2010 AAAI Workshop, Atlanta, GA, United States, 7/12/10.
Srivastava S, Immerman N, Zilberstein S. Creating generalized procedures by demonstration. In Plan, Activity, and Intent Recognition - Papers from the 2010 AAAI Workshop, Technical Report. Vol. WS-10-05. 2010. p. 61-69
Srivastava, Siddharth ; Immerman, Neil ; Zilberstein, Shlomo. / Creating generalized procedures by demonstration. Plan, Activity, and Intent Recognition - Papers from the 2010 AAAI Workshop, Technical Report. Vol. WS-10-05 2010. pp. 61-69
@inproceedings{85072830fea44b45933afba09405eadf,
title = "Creating generalized procedures by demonstration",
abstract = "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.",
author = "Siddharth Srivastava and Neil Immerman and Shlomo Zilberstein",
year = "2010",
month = "12",
day = "1",
language = "English (US)",
isbn = "9781577354710",
volume = "WS-10-05",
pages = "61--69",
booktitle = "Plan, Activity, and Intent Recognition - Papers from the 2010 AAAI Workshop, Technical Report",

}

TY - GEN

T1 - Creating generalized procedures by demonstration

AU - Srivastava, Siddharth

AU - Immerman, Neil

AU - Zilberstein, Shlomo

PY - 2010/12/1

Y1 - 2010/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=79959731167&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79959731167&partnerID=8YFLogxK

M3 - Conference contribution

SN - 9781577354710

VL - WS-10-05

SP - 61

EP - 69

BT - Plan, Activity, and Intent Recognition - Papers from the 2010 AAAI Workshop, Technical Report

ER -