Skip to main content
Log in

Abstract

In this article we propose a Probabilistic Situation Calculus logical language to represent and reason with knowledge about dynamic worlds in which actions have uncertain effects. Uncertain effects are modeled by dividing an action into two subparts: a deterministic (agent produced) input and a probabilistic reaction (produced by nature). We assume that the probabilities of the reactions have known distributions.

Our logical language is an extension to Situation Calculae in the style proposed by Raymond Reiter. There are three aspects to this work. First, we extend the language in order to accommodate the necessary distinctions (e.g., the separation of actions into inputs and reactions). Second, we develop the notion of Randomly Reactive Automata in order to specify the semantics of our Probabilistic Situation Calculus. Finally, we develop a reasoning system in MATHEMATICA capable of performing temporal projection in the Probabilistic Situation Calculus.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. F. Bacchus, J. Halpern and H. Levesque, Reasoning about noisy sensors and effectors in the Situation Calculus, Artificial Intelligence 111(1-2) (1999) 171-208.

    Google Scholar 

  2. F. Bacchus and F. Kabanza, Using temporal logics to express search control knowledge for planning, Artificial Intelligence 16 (2000) 123-191.

    Google Scholar 

  3. C. Boutilier, R. Reiter, M. Soutchanski and S. Thrun, Decision-theoretic, high-level agent programming in the Situation Calculus, in: Proceedings of AAAI’ 2000 (2000) to appear.

  4. C. Boutilier, T. Dean and S. Hanks, Planning under uncertainty: structural assumptions and computational leverage, in: Proceedings of 2nd the European Workshop on Planning (1995).

  5. C. Boutilier, T. Dean and S. Hanks, Decision-theoretic planning: Structural assumptions and computational leverage, Journal of AI Research 11(1) 1999.

  6. W. Feller, An Introduction to Probability Theory and its Applications, Vol. I (Wiley, New York, 1968).

    Google Scholar 

  7. R.E. Fikes and N.J. Nilsson, STRIPS: a new approach to theorem proving in problem solving, Artifi-cial Intelligence 2 (1971) 189-208.

    Google Scholar 

  8. L.P. Kaelbling, M.L. Littman and A.R. Cassandra, Planning and acting in partially observable stochastic domains, Artificial Intelligence 101(1-2) (1998) 99-134.

    Google Scholar 

  9. N. Kushmerick, S. Hanks and D.Weld, An algorithm for probabilistic planning, Artificial Intelligence 76(1-2) (1995) 239-286.

    Google Scholar 

  10. M.L. Littman, Probabilistic propositional planning: Representations and complexity, in: Proceedings of the 14th National Conference on Artificial Intelligence (1997) pp. 748-754.

  11. J. McCarthy, Review of computer chess comes of age by monty newborn, Science (June 6 1997).

  12. J. McCarthy and P. Hayes, Some philosophical problems from the standpoint of Artificial Intelligence, in: Machine Intelligence Vol. 4, eds. B. Meltzer and D. Michie (Edinburgh University Press, Edinburgh, Scotland, 1969) pp. 463-502.

    Google Scholar 

  13. J. Pinto, Compiling ramification constraints into effect axioms, Computational Intelligence 15(3) (1999) 280-307.

    Google Scholar 

  14. J. Pinto, A. Sernadas, C. Sernadas and P. Mateus, Non-determinism and uncertainty in the Situation Calculus, International Journal of Uncertainty, Fuzziness and Knowledge Based Systems 8(2) (2000).

  15. F. Pirri and R. Reiter, Some contributions to the metatheory of the Situation Calculus, Journal of the ACM (1999) to appear.

  16. D. Poole, Decision theory, the Situation Calculus, and conditional plans, Linköping Electronic Articles in Computer and Information Science 3(8) (1998), available at http://www.ep.liu.se/ ea/cis/1998/008/.

  17. S. Port, Theoretical Probability for Applications (Wiley, New York, 1994).

    Google Scholar 

  18. R. Reiter, The frame problem in the Situation Calculus: a simple solution (sometimes) and a completeness result for goal regression, in: Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy (Academic Press, San Diego, CA, 1991) pp. 359-380.

    Google Scholar 

  19. R. Reiter, Knowledge in action: Logical foundations for describing and implementing dynamical systems, book draft (2000), available at http://www.cs.utoronto.ca/~cogrobo.

  20. R. Scherl and H. Levesque, The frame problem and knowledge producing actions, in: Proceedings of AAAI’ 93 (AAAI, Washington, DC, July 1993) pp. 689-695.

    Google Scholar 

  21. S. Wolfram, The Mathematica Book, 3rd ed. (Wolfram Media, 1996).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mateus, P., Pacheco, A., Pinto, J. et al. Probabilistic Situation Calculus. Annals of Mathematics and Artificial Intelligence 32, 393–431 (2001). https://doi.org/10.1023/A:1016738205696

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1016738205696

Navigation