Applying the mu-calculus in planning and reasoning about action

Journal of Logic and Computation

Volumn 8, Issue 3, 1998, Pages 425-445

  Singh, Munindar P ^a  

^a North Carolina State University   (United States)

Author keywords

Mu calculus; Planning; Reasoning about action; Temporal logic

Indexed keywords

ALGORITHMS; COMPUTATIONAL LINGUISTICS; GRAPH THEORY; MATHEMATICAL OPERATORS;

MU CALCULUS; TEMPORAL LOGIC;

FORMAL LOGIC;

EID: 0032091718     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/8.3.425     Document Type: Article

References (29)

1. F. Bacchus and F. Kabanza. Planning for temporally extended goals. In Proceedings of the National Conference on Artificial Intelligence, pp. 1215-1222, 1996.
2. C. Baral. Reasoning about actions: Non-deterministic effects, constraints, and qualification. In Proceedings of the International Joint Conference on Artificial Intelligence, pp. 2017-2023, 1995.
3. N. Belnap and M. Perloff. Seeing to it that: A canonical form for agentives. Theoria, 54, 175-199, 1988.
4. G. Bhat and R. Cleaveland. Efficient model checking via the equational mu-calculus. In Proceedings of the 11th International Symposium on Logic in Computer Science, pp. 304-312, 1996.
5. S. Biundo and W. Stephan. Modeling planning domains systematically. In Proceedings of the European Conference on Artificial Intelligence, pp. 599-603, 1996.
6. M. A. Brown. Action and ability. Journal of Philosophical Logic, 19, 95-114, 1990.
7. B. F. Chellas. Time and modality in the logic of agency. Studia Logica, 51, 485-517, 1992.
8. E. Clarke, O. Grumberg, and D. Long. Model checking. In Proceedings of the International Summer School on Deductive Program Design, pp. 428-439, 1990.
9. G. De Giacomo and X. J. Chen. Reasoning about nondeterministic and concurrent actions: A process algebra approach. In Proceedings of the National Conference on Artificial Intelligence, pp. 658-663, 1996.
10. D. Dengler. Customized plans transmitted by flexible refinement. In Proceedings of the European Conference on Artificial Intelligence, pp. 609-613, 1996.
11. E. A. Emerson. Temporal and modal logic. In Handbook of Theoretical Computer Science, Volume B, J. van Leeuwen, ed. pp. 995-1072. North-Holland, Amsterdam, 1990.
12. M. P. Georgeff. A theory of action for multiagent planning. In Proceedings of the National Conference on Artificial Intelligence, pp. 121-125, 1984.
13. M. P. Georgeff. The representation of events in multi-agent domains. In Proceedings of the National Conference on Artificial Intelligence, pp. 70-75, 1986.
14. G. J. Holzmann. The model checker SPIN. IEEE Transactions on Software Engineering, 23, 279-296, 1997.
15. D. Kinny and M. P. Georgeff. Modelling and design of multi-agent systems. In Intelligent Agents III: Agent Theories, Architectures, and Languages, J. P. Müller, M. J. Wooldridge and N. R. Jennings, eds. pp. 1-20. Springer-Verlag, Berlin, 1997.
16. D. Kozen. Results on the prepositional μ-calculus. Theoretical Computer Science, 27, 333-354, 1983.
17. W. Lukaszewicz and E. Madalińska-Bugaj. Reasoning about action and change using Dijkstra's semantics for programming languages: Preliminary report. In Proceedings of the International Joint Conference on Artificial Intelligence, pp. 1950-1955, 1995.
18. R. Miller. A case study in reasoning about actions and continuous change. In Proceedings of the European Conference on Artificial Intelligence, pp. 624-628, 1996.
19. R. Milner. Communication and Concurrency. Prentice-Hall International, Hemel Hempstead, 1989.
20. C. Pain-Barre. DEDAL: A deductive and algorithmic planning system. In Proceedings of the European Conference on Artificial Intelligence, pp. 629-633, 1996.
21. A. S. Rao and M. P. Georgeff. Asymmetry thesis and side-effect problems in linear-time and branching-time intention logics. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 498-504, 1991.
22. R. Reiter. Natural actions, concurrency and continuous time in the situation calculus. In Proceedings of the Third Symposium on Logical Formalizations of Commonsense Reasoning, 1996.
23. L. Schubert. Monotonic solution of the frame problem in the situation calculus: An efficient method for worlds with fully specified actions. In Knowledge Representation and Defeasible Reasoning, H. E. Kyburg, R. Loui and G. Carlson, eds. pp. 23-67. Kluwer, 1990.
24. M. P. Singh. Maintenance and prevention: Formalization and fixpoint characterization. In Proceedings of the ECAI Workshop on Logic and Change, August 1994.
25. M. P. Singh. Multiagent Systems: A Theoretical Framework for Intentions, Know-How, and Communications. Springer-Verlag, Heidelberg, 1994.
26. M. P. Singh. Know-how. In Foundations and Theories of Rational Agency, A. S. Rao and M. J. Wooldridge, eds. Applied Logic Series, Kluwer, Dordrecht, 1998, in press.
27. M. Thielscher. The logic of dynamic systems. In Proceedings of the International Joint Conference on Artificial Intelligence, pp. 1956-1962, 1995.
28. W. van der Hoek, B. van Linder and J.-J. Ch. Meyer. A logic of capabilities. TR IR-330, Vrije Universiteit, Amsterdam, 1993.
29. R. Waldinger. Achieving several goals simultaneously. In Readings in Artificial Intelligence, B. L. Webber and N. J. Nilsson, eds. pp. 250-271. Morgan Kaufmann, San Francisco, CA, 1981.