A New Equational Foundation for the Fluent Calculus
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.
StreamKnowledge Representation Non-monotonic Reasoning
Unable to display preview. Download preview PDF.
- 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
- 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
- V. Diekert and G. Rozenberg, editors. The book of traces. World Scientific, Singapore etc., 1995.Google Scholar
- Andreas Henschel and Michael Thielscher. The LMW traffic world in the fluent calculus, 1999. http://www.ida.liu.se/ext/etai/lmw/TRAFFIC/001.
- 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
- 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
- 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
- Erik Sandewall. Logic Modelling Workshop. URL: http://www.ida.liu.se/ext/etai/lmw/, 1999.
- Michael Thielscher. Modeling actions with ramifications in nondeterministic, concurrent, and continuous domains—and a case study. 2000. URL: http://pikas.inf.tu-dresden.de/~mit/publications/conferences/casestudy.ps.
- 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