The Concurrent, Continuous Fluent Calculus
- Michael Thielscher
- … show all 1 hide
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
The Fluent Calculus belongs to the established predicate calculus formalisms for reasoning about actions. Its underlying concept of state update axioms provides a solution to the basic representational and inferential Frame Problems in pure first-order logic. Extending a recent research result, we present a Fluent Calculus to reason about domains involving continuous change and where actions occur concurrently.
- Baker, A. B., ‘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.
- Bibel, W. (1998) Let's plan it deductively!. Artificial Intelligence 103: pp. 183-208
- Diekert, V., Rozenberg, G. eds. (1995) The Book of Traces. World Scientific, Singapore
- Green, C. (1969) Theorem proving by resolution as a basis for question-answering systems. Machine Intelligence 4: pp. 183-205
- HÖlldobler, S., Schneeberger, J. (1990) A new deductive approach to planning. New Generation Computing 8: pp. 225-244
- McCarthy, J., Hayes, P.J. (1969) Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence 4: pp. 463-502
- Reiter, R., ‘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.
- Reiter, R., ‘Natural actions, concurrency and continuous time in the situation calculus’, in L.C. Aiello, J. Doyle, and S. Shapiro, editors, Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 2-13, Cambridge, MA, November 1996, Morgan Kaufmann.
- Sandewall, E., ‘Combining logic and differential equations for describing real-world systems’, in R. Brachman, H. J. Levesque, and R. Reiter, editors, Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 412-420, Toronto, Kanada, 1989, Morgan Kaufmann.
- Shanahan, M. (1995) A circumscriptive calculus of events. Artificial Intelligence 77: pp. 249-284
- StÖrr, H.-P., and M. Thielscher, ‘A new equational foundation for the fluent calculus’, in J. Lloyd et al, editor, Proceedings of the International Conference on Computational Logic (CL), volume 1861 of LNAI, pages 733-746, London (UK), July 2000, Springer.
- Thielscher, M. (1997) Ramification and causality. Artificial Intelligence 89: pp. 317-364
- Thielscher, M., ‘Fluent Calculus planning with continuous change’, Electronic Transactions on Artificial Intelligence 1999. (Submitted.) URL: http://www.ep.liu.se/ea/cis/1999/011/.
- Thielscher, M. (1999) From Situation Calculus to Fluent Calculus: State update axioms as a solution to the inferential frame problem. Artificial Intelligence 111: pp. 277-299
- Thielscher, M., ‘Nondeterministic actions in the fluent calculus: Disjunctive state update axioms’, in S. Hölldobler, editor, Intellectics and Computational Logic, pages 327-345, Kluwer Academic, 2000.
- Thielscher, M., ‘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), pages 109-120, Breckenridge, CO, April 2000, Morgan Kaufmann.
- The Concurrent, Continuous Fluent Calculus
Volume 67, Issue 3 , pp 315-331
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- logics of actions
- cognitive robotics
- Author Affiliations
- 1. Department of Computer Science, Dresden University of Technology, 01062, Dresden, Germany