Abstract
In [2] C. Baral and M. Gelfond present the language A C for representing concurrent actions in dynamic systems, and give a sound but incomplete encoding of this language in terms of extended logic programming. Using their program, the time the computation of the transition from one situation to another takes increases quadraticly with the size of the considered domain. In this paper, we present a mapping of domain descriptions in A C into neural networks of linear size. These networks take only four steps for the sound and complete computation of the transition of situations. This allows for reasoning about concurrent actions wrt. extensive real-time domains.
The authors were supported by the Deutsche Forschungsgemeinschaft (DFG) within project MPS under grant no. Ho 1294/3-3.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. B. Baker. Nonmonotonic reasoning in the framework of situation calculus. Artificial Intelligence Journal, 49:5–23, 1991.
Chitta Baral and Michael Gelfond. Representing Concurrent Actions in Extended Logic Programming. In R. Bajcsy, editor, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 866–871, Chambéry, France, August 1993. Morgan Kaufmann.
S.-E. Bornscheuer. Gleichzeitige Aktionen im ELP-basierten Planungsansatz. Diplomarbeit, THD, 1994.
S.-E. Bornscheuer and T. Seiler. Massively Parallel Reasoning about Actions. Technical report, TUD, 1996. (to appear).
S.-E. Bornscheuer and M. Thielscher. Representing Concurrent Actions and Solving Conflicts. Journal of the IGPL, Special Issue ‘Mechanising Deduction in the Logics of Practical Reasoning', 1996. (to appear).
M. Denecker and D. de Schreye. Representing Incomplete Knowledge in Abductive Logic Programming. In D. Miller, editor, Proceedings of the International Logic Programming Symposium (ILPS), pages 147–163, Vancouver, October 1993. MIT Press.
P. M. Dung. Representing Actions in Logic Programming and its Applications in Database Updates. In D. S. Warren, editor, Proceedings of the International Conference on Logic Programming (ICLP), pages 222–238, Budapest, June 1993. MIT Press.
Michael Gelfond and Vladimir Lifschitz. Representing Action and Change by Logic Programs. Journal of Logic Programming, 17:301–321, 1993.
Gerd Große. State-Event Logic. Technical Report AIDA-93-08, FG Intellektik, TH Darmstadt, 1993.
S. Hölldobler. Automated inferencing and connectionist models. Technical Report AIDA-93-06, Intellektik, Informatik, TH Darmstadt, 1993. (Postdoctoral Thesis).
S. Hölldobler and Y. Kalinke. Towards a Massively Parallel Computational Model for Logic programming. In Proceedings of the ECAI94 Workshop on Combining Symbolic and Connectionist Processing, pages 68–77. ECCAI, 1994.
S. Hölldobler and J. Schneeberger. A New Deductive Approach to Planning. New Generation Computing, 8:225–244, 1990.
S. Hölldobler and M. Thielscher. Properties vs. resources — Solving simple frame problems. Technical Report AIDA-94-15, Intellektik, Informatik, TH Darmstadt, 1994.
G. N. Kartha. Soundness and Completeness Theorems for Three Formalizations of Actions. In R. Bajcsy, editor, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 724–729, Chambéry, France, August 1993. Morgan Kaufmann.
V. Lifschitz. Towards a metatheory of action. In J. Allen, R. Fikes, and E. Sandewall, editors, Proceedings of the International Conference on Principles of Knowledge Representation an Reasoning (KR), pages 376–386, 1994.
F. Lin and Y. Shoham. Provably correct theories of actions. In AAAI, pages 349–354, South Lake Tahoe, California, 1991.
Fangzhen Lin and Yoav Shoham. Concurrent Actions in the Situation Calculus. In Proceedings of the AAAI National Conference on Artificial Intelligence, pages 590–595, San Jose, California, 1992. MIT Press.
John McCarthy and Patrick J. Hayes. Some Philosophical Problems from the Standpoint of Artificial Intelligence. Machine Intelligence, 4:463–502, 1969.
E. Pednault. ADL: Exploring the middle ground between STRIPS and the situation calculus. In R. Brachman, H. J. Levesque, and R. Reiter, editors, Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 324–332, Toronto, 1989. Morgan Kaufmann.
Erik Sandewall. The range of applicability of nonmonotonic logics for the inertia problem. In R. Bajcsy, editor, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pages 738–743, Chambéry, France, August 1993. Morgan Kaufmann.
Erik Sandewall. Features and Fluents. Oxford University Press, 1994.
Torsten Seiler. Konstruktion eines massiv parallelen Planers — Transformation von Systembeschreibungen in A C in neuronale Netze, Dezember 1995. Grosser Beleg, TU-Dresden 1995, Germany.
L. Shastri and V. Ajjanagadde. From associations to systematic reasoning: A connectionist representation of rules, variables and dynamic bindings using temporal synchrony. Behavioural and Brain Sciences, 16(3):417–494, September 1993.
Michael Thielscher. Representing Actions in Equational Logic Programming, pages 207–224, Santa Margherita Ligure, Italy, June 1994. MIT Press.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bornscheuer, SE., Seiler, T. (1996). Massively parallel reasoning about actions. In: Görz, G., Hölldobler, S. (eds) KI-96: Advances in Artificial Intelligence. KI 1996. Lecture Notes in Computer Science, vol 1137. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61708-6_41
Download citation
DOI: https://doi.org/10.1007/3-540-61708-6_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61708-2
Online ISBN: 978-3-540-70669-4
eBook Packages: Springer Book Archive