A New Equational Foundation for the Fluent Calculus

  • Hans-Peter Störr
  • Michael Thielscher
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1861)


A new equational foundation is presented for the Fluent Calculus, an established predicate calculus formalism for reasoning about actions. We discuss limitations of the existing axiomatizations of both equality of states and what it means for a fluent to hold in a state. Our new and conceptually even simpler theory is shown to overcome the restrictions of the existing approach. We prove that the correctness of the Fluent Calculus as a solution to the Frame Problem still holds under the new foundation. Furthermore, we extend our theory by an induction axiom needed for reasoning about integer-valued resources.


Knowledge Representation Non-monotonic Reasoning 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Franz Baader and Jörg H. Siekmann. Unification theory. In D. M. Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford University Press, 1993.Google Scholar
  2. [2]
    Andrew B. Baker. A simple solution to the Yale Shooting problem. In R. Brachman, H. J. Levesque, and R. Reiter, editors, Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 11–20, Toronto, Kanada, 1989. Morgan Kaufmann.Google Scholar
  3. [3]
    Wolfgang Bibel. Let’s plan it deductively! Artificial Intelligence, 103(1–2):183–208, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    V. Diekert and G. Rozenberg, editors. The book of traces. World Scientific, Singapore etc., 1995.Google Scholar
  5. [5]
    Andreas Henschel and Michael Thielscher. The LMW traffic world in the fluent calculus, 1999.
  6. [6]
    Steffen Hölldobler and Josef Schneeberger. A new deductive approach to planning. New Generation Computing, 8:225–244, 1990.zbMATHCrossRefGoogle Scholar
  7. [7]
    Steffen Hölldobler and Hans-Peter Störr. Complex plans in the fluent calculus. In S. Hölldobler, editor, Intellectics and Computational Logic. Kluwer Academic, 2000.Google Scholar
  8. [8]
    Steffen Hölldobler and Hans-Peter Störr. Solving the entailment problem in the fluent calculus using binary decision diagrams. In Proceedings of the First International Conference on Computational Logic (CL), 2000. (to appear).Google Scholar
  9. [9]
    Steffen Hölldobler and Michael Thielscher. Computing change and specificity with equational logic programs. Annals of Mathematics and Artificial Intelligence, 14(1):99–133, 1995.CrossRefMathSciNetGoogle Scholar
  10. [10]
    Ray 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.Google Scholar
  11. [11]
    Erik Sandewall. Logic Modelling Workshop. URL:, 1999.
  12. [12]
    John C. Shepherdson. SLDNF-resolution with equality. Journal of Automated Reasoning, 8:297–306, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  13. [13]
    Michael Thielscher. From Situation Calculus to Fluent Calculus: State update axioms as a solution to the inferential frame problem. Artificial Intelligence, 111(1–2):277–299, 1999.zbMATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    Michael Thielscher. Modeling actions with ramifications in nondeterministic, concurrent, and continuous domains—and a case study. 2000. URL:
  15. [15]
    Michael Thielscher. Representing the knowledge of a robot. In A. Cohn, F. Giunchiglia, and B. Selman, editors, Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), Breckenridge, CO, April 2000. (To appear).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Hans-Peter Störr
    • 1
  • Michael Thielscher
    • 1
  1. 1.Artificial Intelligence Institute, Department of Computer ScienceDresden University of TechnologyDresdenGermany

Personalised recommendations