Skip to main content
SpringerLink
Log in

Inductive properties of states

  • Knowledge Representation and Reasoning
  • Conference paper
  • First Online:
Advanced Topics in Artificial Intelligence (AI 1997)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1342))

Included in the following conference series:

  • 118 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

  5. Reiter, R., “Proving Properties of States in the Situation Calculus”, Artificial Intelligence, 64 (1993), 337–351.

    Article  Google Scholar 

  6. Shananhan, M., “Solving the Frame Problem”, book manuscript, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Knowledge Systems Group, School of Computer Science and Engineering, University of New South Wales, NSW 2052, Australia

    Norman Foo

  2. Knowledge Systems Group, Department of Computing, School of MPCE, Macquarie University, NSW 2109, Australia

    Pavlos Peppas

  3. Knowledge Systems Group, Department of Computing, University of Western Sydney, NSW 2747, Nepean, Australia

    Yan Zhang

Authors
  1. Norman Foo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pavlos Peppas
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Abdul Sattar

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Foo, N., Peppas, P., Zhang, Y. (1997). Inductive properties of states. In: Sattar, A. (eds) Advanced Topics in Artificial Intelligence. AI 1997. Lecture Notes in Computer Science, vol 1342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63797-4_75

Download citation

  • DOI: https://doi.org/10.1007/3-540-63797-4_75

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63797-4

  • Online ISBN: 978-3-540-69649-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation