Inductive properties of states
In the situation calculus states are often distinguished from situations by the assumption that situations are paths in a rooted tree while a state is a particular truth assignment to the fluents. It is then possible that two situations have end points that agree on all fluents, i.e., are the same state, and yet be distinct from the perspective of situations. This has the merit of making inductive proofs simple as it introduces two axioms amounting to enforcing the rooted tree structure that are used as trivial bases for the inductions. In this paper we show that the tree structure is dispensable for induction when the underlying system is deterministic, thus elevating the state perspective to equal status.
Keywordssituation calculus states induction automaton actions
Unable to display preview. Download preview PDF.
- 1.Arbib, M.A., “Automata theory: the rapprochement with control theory” (Chapter 6, pp 163–184), and ”Basic notions of automata and semigroups” (Chapter 7, pp 185–20), in Topics in Mathematical Systems Theory, ed. R.E.Kalman, P.L.Falb, and M.A.Arbib, McGraw-Hill, 1969.Google Scholar
- 2.Boolos, G. and Jeffrey, R. ”Computability and Logic”, Cambridge University Press, 1989.Google Scholar
- 3.Baral, C., Gelfond, M. and Provetti, A., “Representing Actions: Laws, Observations, and Hypotheses”, To appear in the Journal of Logic Programming, 1997.Google Scholar
- 4.Lloyd, J., “Foundations of Logic Programming”, Springer-Verlag, 1984.Google Scholar
- 6.Shananhan, M., “Solving the Frame Problem”, book manuscript, 1996.Google Scholar