Abstract
To perform nontrivial reasoning an intelligent agent situated in a changing domain needs the knowledge of causal laws that describe effects of actions changing the domain, the ability to observe and record occurrences of these actions, and the truth values of fluents1 at particular moments of time. Discovery of methods of representing this kind of information in a form allowing various types of reasoning about the dynamic world and at the same time tolerant to future updates is one of the central problems of knowledge representation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Apt and M. Bezem. Acyclic programs. New Generation Computing, 9 (3,4): 335–365, 1991.
J Alferes, R. Li, and L Pereira. Concurrent actions and changes in the situation calculus. In H. Geffner, editor, Proc of IBERAMIA 9.j, pages 93–104. McGraw Hill, 1994.
C. Baral. Reasoning about Actions: Non-deterministic effects, Constraints and Qualification. In Proc. of IJCAI 95, pages 2017–2023, 1995.
C. Baral and M. Gelfond. Representing concurrent actions in extended logic programming. In Proc. of 13th International Joint Conference on Artificial Intelligence, Chambery, France, pages 866–871, 1993.
C. Baral and M. Gelfond. Logic programming and knowledge representation. Journal of Logic Programming, 19, 20: 73–148, 1994.
C. Baral, M. Gelfond, and A. Provetti. Representing Actions: Laws, Observations and Hypothesis. Journal of Logic Programming (to appear), 1996.
S. Bornscheuer and M. Thielscher. Representing concurrent actions and solving conflicts. In Proc. of German Conference on AI, 1994.
K. Clark. Negation as failure. In Herve Gallaire and J. Minker, editors, Logic and Data Bases, pages 293–322. Plenum Press, New York, 1978.
M. Denecker and D. De Schreye. Representing incomplete knowledge in abductive logic programming. In Proc. of ILPS 93, Vancouver, pages 147–164, 1993.
J. Dix. Classifying semantics of logic programs. In Proceedings of International Workshop in logic programming and nonmonotonic reasoning, Washington D.C., pages 166–180, 1991.
P. Dung. Representing actions in logic programming and its application in database updates. In D. S. Warren, editor, Proc. of ICLP-93, pages 222–238, 1993.
M. Gelfond. Logic programming and reasoning with incomplete information. Annals of Mathematics and Artificial Intelligence, 12: 19–116, 1994.
M. Gelfond and V. Lifschitz. Logic programs with classical negation. In D. Warren and Peter Szeredi, editors, Logic Programming: Proc. of the Seventh Int’l Conf., pages 579–597, 1990.
M. Gelfond and V. Lifschitz. Classical negation in logic programs and disjunctive databases. New Generation Computing, pages 365–387, 1991.
M. Gelfond and V. Lifschitz. Representing actions in extended logic programs. In Joint International Conference and Symposium on Logic Programming., pages 559573, 1992.
E. Giunchiglia and V. Lifschitz. Dependent fluents. In Proc. of IJCAI 95,pages 1964–1969, 95.
S Holldobler and M Thielscher. Actions and specificity. In D. Miller, editor, Proc. of ICLP-93, pages 164–180, 1993.
G. Kartha. Soundness and completeness theorems for three formalizations of action. In IJCAI 93, pages 724–729, 1993.
G. Kartha and V. Lifschitz. Actions with indirect effects: Preliminary report. In KR 94, pages 341–350, 1994.
A. Kakas and R. Miller. A simple declarative language for describing narratives with actions. Journal of Logic Programming (to appear), 1996.
Y. Lesperance, H. Levesque, F. Lin, D. Marcu, R. Reiter, and R. Scherl. A logical approach to high level robot programming - a progress report. In Working notes of the 199.4 AA AI fall symposium on Control of the Physical World by Intelligent Systems (to appear), New Orleans, LA, November 1994.
J. Lobo, J. Minker, and A. Rajasekar. Foundations of disjunctive logic programming. The MIT Press, 1992.
V. Lifschitz, N. McCain, and H. Turner. Automation of reasoning about action: a logic programming approach. In Posters of the International Symposium on Logic Programming, 1993.
F. Lin and Y. Shoham. Provably correct theories of actions: preliminary report. In Proc. of AAAI-91, 1991.
Vladimir Lifschitz and Hudson Turner. Splitting a logic program. In Pascal Van Hentenryck, editor, Proc. of the Eleventh Int’l Conf. on Logic Programming, pages 23–38, 1994.
J. McCarthy. Overcoming an unexpected obstacle. manuscript, 1992.
J. McCarthy. Applications of circumscription to formalizing common sense knowledge. Artificial Intelligence, 26 (3): 89–116, 1986.
J. McCarthy and P. Hayes. Some philosophical problems from the standpoint of artificial intelligence. In B. Meltzer and D. Michie, editors, Machine Intelligence, volume 4, pages 463–502. Edinburgh University Press, Edinburgh, 1969.
R. Miller and M. Shanahan. Narratives in the situation calculus. Journal of Logic and Computation, 4 (5): 513–530, October 1994.
N. McCain and H. Turner. Language independence and language tolerance in logic programs. In Proc. of the Eleventh Intl. Conference on Logic Programming, pages 38–57, 1994.
L. Pereira, L. Caires, and J. Alferes. Classical negation in logic programs. In 7 Simposio Brasiliero de Inteligencia Artificial, 1990.
J. Pinto. Temporal Reasoning in the Situation Calculus. PhD thesis, University of Toronto, Department of Computer Science, February 1994. KRR-TR-94–1.
J. Pinto and R. Reiter. Temporal reasoning in logic programming: A case for the situation calculus. In Proceedings of 10th International Conference in Logic Programming, Hungary, pages 203–221, 1993.
A. Provetti. Hypothetical reasoning about actions: from situation calculus to event calculus. Computational Intelligence, 12 (3), 1996.
T. Przymusinski. Stationary semantics for disjunctive logic programs and deductive databases. In North American Conference on Logic Programming, pages 40–62, 1990.
D. Pearce and G. Wagner. Reasoning with negative information 1 - strong negation in logic programming. Technical report, Gruppe fur Logic, Wissentheorie and Information, Freie Universitat Berlin, 1989.
R. Reiter. The frame problem in the situation calculus: A simple solution (sometimes) and a completeness result for goal regression. In V. Lifschitz, editor, Artificial Intelligence and Mathematical Theory of Computation, pages 359–380. Academic Press, 1991.
E. Sandewall. Features and fluents: A systematic approach to the representation of knowledge about dynamical systems. Technical report, Institutionen for datavetenskap, Universitetet och Tekniska hogskolan i Linkoping, Sweeden, 1992.
E. Sandewall. The range of applicability of some non-monotonic logics for strict inertia. Journal of Logic and Computation, 4 (5): 581–616, October 1994.
H. Turner. A monotonicity theorem for extended logic programs. In D. S. Warren, editor, Proc. of 10th International Conference on Logic Programming, pages 567–585, 1993.
H. Turner. Signed logic programs. In Proc. of the 1994 International Symposium on Logic Programming, pages 61–75, 1994.
R. Watson. An Inference Engine for Epistemic Specifications, 1994. M.S Thesis, Department of Computer Science, University of Texas at El Paso.
D. S. Warren and W. Chen. Query evaluation under well-founded semantics. In Proc. of PODS 93, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Baral, C., Gelfond, M., Watson, R. (1999). Reasoning about Actual and Hypothetical Occurrences of Concurrent and Non-Deterministic Actions. In: Pareschi, R., Fronhöfer, B. (eds) Dynamic Worlds. Applied Logic Series, vol 12. Springer, Dordrecht. https://doi.org/10.1007/978-94-017-1317-7_3
Download citation
DOI: https://doi.org/10.1007/978-94-017-1317-7_3
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5159-2
Online ISBN: 978-94-017-1317-7
eBook Packages: Springer Book Archive