Abstract
Transaction logic (TR) is a formalism that accounts for the specification and execution of update phenomena in arbitrary logical theory, specially logic programs and databases. In fact, from a theoretical standpoint, the planning activity could be seen as such a kind of phenomenon, where the execution of plan actions update a world model. This paper presents how a planning process can be specified and formally executed in TR. We define a formal planning problem description and show that goals for these problems may be represented not only as questions to a final database state, but also as the invocation of complex actions. The planning process in this framework can be considered as an executional deduction of a TR formula. As a highlight of this work we could mention that it provides a clean and declarative approach to bridging the gap between formal and real planning. The user not only “programs” his planning problem description, but also gains a better understanding of what is behind the semantics of the plan generation process.
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. Present-day deductive planning. In Current Trends in AI Planning-2nd European WorkShop on Planning (EWSP-93), pages 1–5. IOS Press, 1994.
A.J. Bonner and M. Kifer. Representing complex actions in transaction logic. In preparation.
A.J. Bonner and M. Kifer. Transaction logic programming. Technical Report CSRI-323, Computer Systems Research Institute, University of Toronto, 1993.
M. V. T. dos Santos, P. E. Santos, F. S. Correa, and M. Rillo. Actions as prolog programs. In IEEE Symposia on Intelligence in Automation and Robotics, Nov 96.
M.V.T. dos Santos. On the formalization of actions using transaction logic. In ECAI-96 Workshop on Cross-fertilization in Planning, Aug 96.
R. E. Fikes and N. J. Nilsson. Strips: A new approach to theorem proving in problem solving. Journal of Artificial Intelligence, 2:189–208, 1971.
D. Harel. First Order Dynamic Logic. Springer LNCS 68, 1979.
R. Kowalski. Logic for Problem Solving. North-Holland Publishing Company, 1979.
H.J. Levesque, R. Reiter, Y. Lespérance, F. Lin, and R. B. Scherl. GOLOG: a logic programming language for dynamic domains. Journal of Logic Programming, 1997. To appear.
V. Lifschitz. On the semantics of strips. In M.P. Georgeff and L. Lansky A, editors, Proc. 1986 Workshop Reasoning about Actions and Plans, pages 1–9, 1987.
J. M. McCarthy and P. J. Hayes. Some philosophical problems from the standpoint of artificial intelligence. In B. Meltzer and D. Michie, editors, Machine Intelligence, pages 463–502. Edinburgh University Press, 1969.
M.L.Ginsberg and D.E.Smith. Reasoning about action is A possible worlds approach. Journal of Artificial Intelligence, 35:165–195, 1988.
E.C. Schank and R.P. Abelson. Scripts, Plans Goals and Understanding. Freeman Publ. Co., 1975.
W. Stephan and S. Biundo. A new logical framework for deductive planning. In Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI-93), pages 32–38. Morgan Kaufmann, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Santos, M.V., Rillo, M. (1997). Approaching the plans are programs paradigm using transaction logic. In: Steel, S., Alami, R. (eds) Recent Advances in AI Planning. ECP 1997. Lecture Notes in Computer Science, vol 1348. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63912-8_100
Download citation
DOI: https://doi.org/10.1007/3-540-63912-8_100
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63912-1
Online ISBN: 978-3-540-69665-0
eBook Packages: Springer Book Archive