Abstract
We present a strategy for deductive plan formation where prefabricated general solutions are adapted to special problems. The strategy is an instance of refinement planning with a particular technique for representing abstract solution patterns. It is developed within an interval-based temporal logic where plans are treated as an executable form of specification. Following the paradigm to view plans as programs basic actions as well as composite plans are built using a programming language with add and delete as elementary operations.
This work was partly supported by the German Ministry for Science and Technology (BMBF) under contract ITW 9404 0.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Biundo, D. Dengler, and J. Köhler. Deductive Planning and Plan Reuse in a Command Language Environment. In Proc. ECAI-92, pages 628–632, 1992.
L. Lamport. The Temporal Logic of Actions. Tech. Rep., DEC, Palo Alto, 1991.
Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer, 1991.
Z. Manna and R. Waldinger. How to Clear a Block: Plan Formation in Situational Logic. Journal of Automated Reasoning, 3:343–377, 1987.
J. McCarthy and P. Hayes. Some Philosophical Problems from the Standpoint of Artificial Intelligence. In Machine Intelligence 4, pages 463–502. 1969.
A. Mokkedem and D. Méry. A Stuttering Closed Temporal Logic for Modular Reasoning about Concurrent Programs. In Proc. ICTL-94, pages 382–397, 1994.
E. Pednault. ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus. In Proc. KR-89, pages 324–332, 1989.
S. J. Rosenschein. Plan Synthesis: A Logic Perspective. In Proc. IJCAI-81, 1981.
R. Rosner and A. Pnueli. A Choppy Logic. In Symposium on Logic in Computer Science, pages 306–313. IEEE Computer Society Press, 1986.
W. Stephan and S. Biundo. A New Logical Framework for Deductive Planning. In Proc. IJCAI-93, pages 32–38, 1993.
W. Stephan and S. Biundo. Multilevel Refinement Planning in an Interval-Based Temporal Logic. Research Report, German Research Center for AI, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stephan, W., Biundo, S. (1995). Multilevel refinement planning in an interval-based temporal logic. In: Pinto-Ferreira, C., Mamede, N.J. (eds) Progress in Artificial Intelligence. EPIA 1995. Lecture Notes in Computer Science, vol 990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60428-6_45
Download citation
DOI: https://doi.org/10.1007/3-540-60428-6_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60428-0
Online ISBN: 978-3-540-45595-0
eBook Packages: Springer Book Archive