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.
The author would like to thank John Woodfill, Narinder Singh, Nils Nilsson, Michael Genesereth, and Benjamin Grosof for helpful discussions on the ideas presented in this paper.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
L. S. Bobrow and M. A. Arbib. Discrete Mathematics: Applied Algebra for Computer and Information Science. W. B. Saunders Co., 1974.
A. P. Ershov, D. Bjorner, and N. D. Jones (editors). Proceedings of Workshop on Partial Evaluation and Mixed Computation, Denmark. North-Holland, 1988.
A. D. Friedman. Fundamentals of Logic Design and Switching Theory. Computer Science Press, 1986.
M. R. Genesereth and J. Y.-j. Hsu. Partial programs. In J. A. Allen, R. Fikes, and E. Sandewell, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the Second International Conference, pages 238–249, Morgan Kaufmann Publishers, 1991.
A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297–308, 1985.
L. P. Kaelbling. Goals as parallel program specifications. In AAAI-88, Saint Paul, August 1988.
H. J. Levesque. Logic and the Complexity of Reasoning. KRR-TR-89-2, University of Toronto, January 1989.
S. Minton. Learning Search Control Knowledge: An Explanation-Based Approach. Kluwer Academic Publishers, 1988.
S. J. Rosenschein and L. P. Kaelbling. The synthesis of digital machines with provable epistemic properties. In J. Halpern, editor, Proceedings of the Conference on Theoretical Aspects of Reasoning About Knowledge, pages 83–98, Morgan Kaufmann Publishers, 1986.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hsu, J.Yj. (1991). Synthesizing efficient agents from partial programs. In: Ras, Z.W., Zemankova, M. (eds) Methodologies for Intelligent Systems. ISMIS 1991. Lecture Notes in Computer Science, vol 542. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54563-8_78
Download citation
DOI: https://doi.org/10.1007/3-540-54563-8_78
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54563-7
Online ISBN: 978-3-540-38466-3
eBook Packages: Springer Book Archive