Synthesizing efficient agents from partial programs

Jane Yung Jen Hsu

doi:10.1007/3-540-54563-8_78

Synthesizing efficient agents from partial programs

Jane Yung Jen Hsu^*

^*Corresponding author for this work

Stanford University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

Partial programs are useful for incremental specifications of an agent's behavior in dynamic environments. Unfortunately, executing arbitrary partial programs involves theorem proving, which can be computationally intractable. This paper presents an algorithm for generating efficient implementations of agent behavior from a subclass of partial programs. The algorithm employs a completion strategy that systematically reduces the number of previous percepts being considered. As a result, the compiled structure corresponds to a finite agent with minimal perceptual histories so that its actions can be decided within a bounded time during execution.

Original language	English
Title of host publication	Methodologies for Intelligent Systems - 6th International Symposium, ISMIS 1991, Proceedings
Editors	Zbigniew W. Ras, Maria Zemankova
Publisher	Springer Verlag
Pages	142-151
Number of pages	10
ISBN (Print)	9783540545637
DOIs	https://doi.org/10.1007/3-540-54563-8_78
State	Published - 1991
Externally published	Yes
Event	6th International Symposium on Methodologies for Intelligent Systems, ISMIS 1991 - Charlotte , United States Duration: 16 10 1991 → 19 10 1991

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	542 LNAI Part F2
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	6th International Symposium on Methodologies for Intelligent Systems, ISMIS 1991
Country/Territory	United States
City	Charlotte
Period	16/10/91 → 19/10/91

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1991.

Access to Document

10.1007/3-540-54563-8_78

Cite this

Hsu, J. Y. J. (1991). Synthesizing efficient agents from partial programs. In Z. W. Ras, & M. Zemankova (Eds.), Methodologies for Intelligent Systems - 6th International Symposium, ISMIS 1991, Proceedings (pp. 142-151). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 542 LNAI Part F2). Springer Verlag. https://doi.org/10.1007/3-540-54563-8_78

Hsu, Jane Yung Jen. / Synthesizing efficient agents from partial programs. Methodologies for Intelligent Systems - 6th International Symposium, ISMIS 1991, Proceedings. editor / Zbigniew W. Ras ; Maria Zemankova. Springer Verlag, 1991. pp. 142-151 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{2809bdb2cc354aae81396c893b8f8735,

title = "Synthesizing efficient agents from partial programs",

abstract = "Partial programs are useful for incremental specifications of an agent's behavior in dynamic environments. Unfortunately, executing arbitrary partial programs involves theorem proving, which can be computationally intractable. This paper presents an algorithm for generating efficient implementations of agent behavior from a subclass of partial programs. The algorithm employs a completion strategy that systematically reduces the number of previous percepts being considered. As a result, the compiled structure corresponds to a finite agent with minimal perceptual histories so that its actions can be decided within a bounded time during execution.",

author = "Hsu, {Jane Yung Jen}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1991.; 6th International Symposium on Methodologies for Intelligent Systems, ISMIS 1991 ; Conference date: 16-10-1991 Through 19-10-1991",

year = "1991",

doi = "10.1007/3-540-54563-8_78",

language = "英语",

isbn = "9783540545637",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "142--151",

editor = "Ras, {Zbigniew W.} and Maria Zemankova",

booktitle = "Methodologies for Intelligent Systems - 6th International Symposium, ISMIS 1991, Proceedings",

address = "德国",

}

Hsu, JYJ 1991, Synthesizing efficient agents from partial programs. in ZW Ras & M Zemankova (eds), Methodologies for Intelligent Systems - 6th International Symposium, ISMIS 1991, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 542 LNAI Part F2, Springer Verlag, pp. 142-151, 6th International Symposium on Methodologies for Intelligent Systems, ISMIS 1991, Charlotte , United States, 16/10/91. https://doi.org/10.1007/3-540-54563-8_78

Synthesizing efficient agents from partial programs. / Hsu, Jane Yung Jen.
Methodologies for Intelligent Systems - 6th International Symposium, ISMIS 1991, Proceedings. ed. / Zbigniew W. Ras; Maria Zemankova. Springer Verlag, 1991. p. 142-151 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 542 LNAI Part F2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Synthesizing efficient agents from partial programs

AU - Hsu, Jane Yung Jen

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 1991.

PY - 1991

Y1 - 1991

N2 - Partial programs are useful for incremental specifications of an agent's behavior in dynamic environments. Unfortunately, executing arbitrary partial programs involves theorem proving, which can be computationally intractable. This paper presents an algorithm for generating efficient implementations of agent behavior from a subclass of partial programs. The algorithm employs a completion strategy that systematically reduces the number of previous percepts being considered. As a result, the compiled structure corresponds to a finite agent with minimal perceptual histories so that its actions can be decided within a bounded time during execution.

AB - Partial programs are useful for incremental specifications of an agent's behavior in dynamic environments. Unfortunately, executing arbitrary partial programs involves theorem proving, which can be computationally intractable. This paper presents an algorithm for generating efficient implementations of agent behavior from a subclass of partial programs. The algorithm employs a completion strategy that systematically reduces the number of previous percepts being considered. As a result, the compiled structure corresponds to a finite agent with minimal perceptual histories so that its actions can be decided within a bounded time during execution.

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

U2 - 10.1007/3-540-54563-8_78

DO - 10.1007/3-540-54563-8_78

M3 - 会议稿件

AN - SCOPUS:85037140127

SN - 9783540545637

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 142

EP - 151

BT - Methodologies for Intelligent Systems - 6th International Symposium, ISMIS 1991, Proceedings

A2 - Ras, Zbigniew W.

A2 - Zemankova, Maria

PB - Springer Verlag

T2 - 6th International Symposium on Methodologies for Intelligent Systems, ISMIS 1991

Y2 - 16 October 1991 through 19 October 1991

ER -

Hsu JYJ. Synthesizing efficient agents from partial programs. In Ras ZW, Zemankova M, editors, Methodologies for Intelligent Systems - 6th International Symposium, ISMIS 1991, Proceedings. Springer Verlag. 1991. p. 142-151. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-54563-8_78

Synthesizing efficient agents from partial programs

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this