Abstract
This paper deals with a multiple planning problem, which is a collection of planning problems defined for the same partial transition system and have the same set of goal states. It is shown that a solution to the multiple planning problem can be written in procedural (imperative) languages like Pascal. The formal definition of the syntax and semantics of conditional-iterative actions is provided. It is proven that a multiple plan can be generated by a conditional-iterative action. A language of formal representation of partial transition systems with a vector-state space is proposed.
This research was supported by KBN Grant ”Design of intelligent robotic system based on knowledge engineering”
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Alagic, S.and Arbib, M.A., The Design of Well-Structured and Correct Programs, Springer-Verlag, 1978.
Bylander, T., Complexity results for planning, in: Proceedings of International Joint Conference on Artificial Intelligence (IJCAI-91), 274–279, 1991.
Bratko, I., Prolog Programming for Artificial Intelligence, Addison-Wesley Publ. Co., Massachusetts; Menlo Park, California, 1986, 1987.
Brownston, L., Farrell, R., Kant, E. and Martin, N., Programming Expert Systems in OPS5, Addison-Wesley Publ. Co., Massachusetts; Menlo Park, California, 1985.
Chenoweth, S.V., On the NP-hardness of blocks world planning, in: Proceedings of AAAI-91: Ninth National Conference on Artificial Intelligence, 623–628, 1991.
Genesereth, M.R. and Nilsson, N.J., Logical Foundations of Artificial Intelligence, Morgan Kaufmann Publishers, 1987.
Georgeff, M.P., Planning, Ann. Rev. Comput. Sci., 2, 359–400, 1987.
Hendler, J., Tate, A. and Drummond, M., AI planning: systems and techniques, AI Magazine 11(2), 61–77, 1990.
Hoare, C.A.R., An axiomatic basis for computer programming, Com.ACM 12, 576–580, 1969.
Jones, C.B., Systematic Software Development using VDM, Second Edition Prentice-Hall International, 1989.
Kautz, H.A., Planning within first-order logic, in: Proceedings of the CSC-SI/SCEIO, 19–26, 1982.
Kohavi, Z., Switching and Finite Automata Theory, McGraw-Hill, New York, 1970.
Korf, R.E., Macro-operators: a weak method for learning, Artificial Intelligence, 26, 35–77, 1985.
Mirkowska, G. and Salwicki, A., Algorithmic Logic, Warszawa, PWN, Dordrecht, Reidel Publ. Comp. 1987.
Nilsson, N., Principles of Artificial Intelligence, Tioga Publishers, Palo Alto, CA, 1980.
Sierocki, I., Algebraic structure of Macro Problem Solver, Cybernetics and Systems: An International Journal, to appear
Spivey, J., Understanding Z: A Specification Language and its Formal Semantics, volume 3 of Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 1988.
Stephan, W. and Biundo S., A new logical framework for deductive planning, in: Proceedings of the 13 th International Joint Conference on Artificial Intelligence, 32–38, 1993.
Winston, P.H., Artificial Intelligence, Addison-Wesley Publ. Co., Massachusetts; Menlo Park, California, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sierocki, I. (1996). A system-theoretic approach to planning and programming. In: Pichler, F., Díaz, R.M., Albrecht, R. (eds) Computer Aided Systems Theory — EUROCAST '95. EUROCAST 1995. Lecture Notes in Computer Science, vol 1030. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034754
Download citation
DOI: https://doi.org/10.1007/BFb0034754
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60748-9
Online ISBN: 978-3-540-49358-7
eBook Packages: Springer Book Archive