Abstract
We consider entailment problems in the fluent calculus as they arise in reasoning about actions. Taking into account various fragments of the fluent calculus we formally show decidability results, establish their complexity, and prove undecidability results. Thus we draw a boundary between decidable and undecidable fragments of the fluent calculus.
new address: University of Leicester, Department of Mathematics and Computer Science, University Road, Leicester LE1 7RH, UK
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
W. Bibel. A deductive solution for plan generation. New Generation Computing, 4:115–132, 1986. 436
W. Bibel. Let’s plan it deductively! Artificial Intelligence, 103(1–2):183–208, 1998. 436
M. C. A. J. Bonner and M. Kifer. Transaction logic programming. Theoretical Computer Science, 133:205–265, 1994. 436
P. Doherty, J. Gustafsson, L. Karlsson, and J. Kvanström. Tal: Temporal action logics language specification and tutorial. Electronic Transactions on Artificial Intelligence, 2(3–4):273–306, 1998. 436
S. Feferman and R. L. Vaught. The first order properties of algebraic systems. Fund. Math., 47:57–103, 1959. 444
M. J. Fischer and M. O. Rabin. Super-exponential complexity of Presburger arithmetic. In Complexity of Computation, SIAM-AMS Proc. Vol. VII, pages 27–41. AMS, 1974. 442, 442
M. Gelfond and V. Lifschitz. Action languages. Electronic Transactions on Artificial Intelligence, 2(3–4):193–210, 1998. 436
J. Y. Girard. Linear logic. Journal of Theoretical Computer Science, 50(1):1–102, 1987. 436
S. Hölldobler. On deductive planning and the frame problem. In A. Voronkov, editor, Proceedings of the Conference on Logic Programming and Automated Reasoning, pages 13–29. Springer, LNCS, 1992. 437
S. Hölldobler. Descriptions in the fluent calculus. In Proceedings of the International Conference on Artificial Intelligence, volume III, pages 1311–1317, 2000. 436
S. Hölldobler and J. Schneeberger. A new deductive approach to planning. New Generation Computing, 8:225–244, 1990. 436
S. Hölldobler and H.-P. Störr. Solving the entailment problem in the fluent calculus with binary decision diagrams. In Proceedings of the First International Conference on Computational Logic, pages 747–761, 2000. 448
R. A. Kowalski and M. Sergot. A logic-based calculus of events. New Generation Computing, 4:67–95, 1986. 436
J. Lambek. How to program an infinite abacus. Canad. Math. Bull., 4:295–302, 1961. 446, 448
H. Lehmann and M. Leuschel. Decidability results for the propositional fluent calculus. In Proceedings of First International Conference on Computational Logic, pages 762–776, 2000. 448
H. Levesque, F. Pirri, and R. Reiter. Foundations for a calculus of situations. Electronic Transactions on Artificial Intelligence, 2(3–4):159–192, 1998. 436
M. Masseron, C. Tollu, and J. Vauzielles. Generating plans in linear logic. In Foundations of Software Technology and Theoretical Computer Science, pages 63–75. Springer, LNCS 472, 1990. 436
J. McCarthy. Situations and actions and causal laws. Stanford Artificial Intelligence Project: Memo 2, 1963. 436
J. McCarthy and P. J. Hayes. Some philosophical problems from the standpoint of Artificial Intelligence. In B. Meltzer and D. Michie, editors, Machine Intelligence 4, pages 463–502. Edinburgh University Press, 1969. 436
A. R. Meyer. Weak monadic second order theory of one successor is not elementary recursive. In Proc. Logic Colloquium, volume 453 of Lecture Notes in Mathematics, pages 132–154. Springer, 1975. 444
M. L. Minsky. Recursive unsolvability of Post’s problem of “tag” and other topics in theory of Turing machines. The Annals of Mathematics, 74(3):437–455, 1961. 446, 448
D. C. Oppen. A 22 2 cn upper bound on the complexity of Presburger arithmetic. J. Comp. System Sci., 16:323–332, 1978. 442
M. Presburger. Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. Sprawozdaniez 1 Kongresu Matematyków Krajow Slowiańskich, Ksiaznica Atlas, pages 92–10, 1930. 441
M. O. Rabin. Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc., 141:1–35, 1969. 444
E. Sandewall. Features and Fluents. The Representation of Knowledge about Dynamical Systems. Oxford University Press, 1994. 436
M. Shanahan. Solving the Frame Problem: A Mathematical Investigation of the Common Sense Law of Inertia. MIT Press, 1997. 436
S. Shelah. The monadic theory of order. Annals of Mathematics, 102:379–419, 1975. 444
H.-P. Störr and M. Thielscher. A new equational foundation for the fluent calculus. In Proceedings of the First International Conference on Computational Logic, pages 733–746, 2000. 437
E. Ternovskaia. Automata theory for reasoning about actions. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 153–158, 1999. 437, 437, 448, 448
M. Thielscher. Introduction to the fluent calculus. Electronic Transactions on Artificial Intelligence, 2(3–4):179–192, 1998. 436, 440
Michael Thielscher. Nondeterministic actions in the fluent calculus: Disjunctive state update axioms. In S. Hölldobler, editor, Intellectics and Computational Logic. Kluwer Academic, 2000. 436
Michael Thielscher. Representing the knowledge of a robot. In Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), pages 109–120, 2000. 436
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hölldobler, S., Kuske, D. (2000). The Boundary between Decidable and Undecidable Fragments of the Fluent Calculus. In: Parigot, M., Voronkov, A. (eds) Logic for Programming and Automated Reasoning. LPAR 2000. Lecture Notes in Artificial Intelligence(), vol 1955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44404-1_28
Download citation
DOI: https://doi.org/10.1007/3-540-44404-1_28
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41285-4
Online ISBN: 978-3-540-44404-6
eBook Packages: Springer Book Archive