Skip to main content

Non-situation Calculus and Database Systems

  • Conference paper
  • First Online:
Foundations of Information and Knowledge Systems (FoIKS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1762))

  • 186 Accesses

Abstract

Non-situation calculus is a way to describe dynamic worlds using first order logic, where a theory is written from the viewpoint of a situation (the propositional fluents hold in that situation). We introduced some functions to allow describing propositional fluents that hold in other situations. We define “progression” as a transformation that changes the situation represented by a non-situation calculus. The semantics counterpart of progression, function δ, transforms an interpretation of a non-situation calculus relative to a situation into an interpretation of a non-situation calculus relative to another situation.

We propose using non-situation calculus to study database dynamics by representing a database as a non-situation calculus theory, by representing transactions as changes and by associating the database that results from executing a transaction to the progression of the theory.

We wish to thank the members of the member of GIA for their comments and support. This work was partially supported by PRAXIS XXI projecto 2/2.1/TIT/1568/95 - Raciocínio sobre mudançca utilizando Senso Comum and IDMEC - Grupo de Inteligência Artificial.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gerhard Brewka and Joachim Hertzberg. How to Do Things with Worlds: on Formalizing Actions and Plans. Journal of Logic and Computation, 3(5): 517–532, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  2. Herbert B. Enderton. A mathematical introduction to logic. Academic Press Inc., 1972.

    Google Scholar 

  3. Richard E. Fikes and Nils J. Nilsson. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving. Artificial Intelligence, 2:189–208, 1971.

    Article  MATH  Google Scholar 

  4. Michael Gelfond and Vladimir Lifschitz. Representing action and change by logic programs. Journal of Logic Programming, 17:301–321, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  5. Mathew L. Ginsberg and David E. Smith. Reasoning about Action I: A Possible Worlds Approach. Artificial Intelligence, 35:165–195, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  6. Fausto Giunchiglia and Chiara Ghidini. Local model semantics, or contextual reasoning = locality and compatibility”. In Principles of Knowledge Representation and Reasoning: Proceedings of the Sixth International Conference, pages 282–289, 1998.

    Google Scholar 

  7. Fangzhen Lin and Ray Reiter. How to progress a database. Artificial Intelligence, 92:131–167, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  8. Pedro A. Matos. Some properties of non-situation calculus. Technical report, Grupo de Inteligência Artificial, Instituto Superior Técnico, Universidade Técnica de Lisboa, Lisboa, Portugal, 1999. Available as http://www.gia.ist.utl.pt/~pedro/techrep/nsc.ps.

    Google Scholar 

  9. John McCarthy. First order theories of individual concepts and propositions. In Machine Intelligence, volume 9, pages 129–148. Ellis Horwood, 1979. Available as http://www-formal.stanford.edu/jmc/concepts.html.

    MathSciNet  Google Scholar 

  10. John McCarthy and P. Hayes. Some philosophical problems from the standpoint of artificial intelligence. In Machine Intelligence, volume 4, pages 463–502. Edinburg University Press, 1969.

    MATH  Google Scholar 

  11. Edwin P. D. Pednault. ADL and the State-Transition Model of Action. Journal of Logic and Computation, 4(5):465–512, 1994.

    Google Scholar 

  12. Raymond Reiter. On formalizing database updates: Preliminary report. In Proc. 3rd International Conference on Extending Database Technologies, pages 10–20, 1992.

    Google Scholar 

  13. Raymond Reiter. Proving properties of states in the situation calculus. Artificial Intelligence, 64:337–351, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  14. Raymond Reiter. The projection problem in the situation calculus: A soundness and completeness result, with an application to database updates. In Proceedings of the International Conference on Knowledge Representation and Reasoning, 1996.

    Google Scholar 

  15. Stanley J. Rosenschein. Plan synthesis: A logical perspective. In Proceedings of the. Seventh International Joint Conference on Artificial Intelligence, pages 331–337, 1981.

    Google Scholar 

  16. Erik Sandewall and Yoav Shoham. Non-monotonic Temporal Reasoning. In Dov Gabbay, C. J. Hogger, and J. A. Robinson, editors, Handbok of Artificial Intelligence and Logic Programming, volume 4, pages 439–498. Oxford University Press, 1994.

    Google Scholar 

  17. Murray Shanahan. Solving the Frame Problem — A Mathematical Investigation of the Common Sense Law of Inertia. The MIT Press, 1997.

    Google Scholar 

  18. Marianne Winslett. Reasoning about action using a possible models approach. In Proceedings of the Seventh National Conference on Artificial Intelligence, pages 89–93, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matos, P.A., Martins, J.P. (2000). Non-situation Calculus and Database Systems. In: Schewe, KD., Thalheim, B. (eds) Foundations of Information and Knowledge Systems. FoIKS 2000. Lecture Notes in Computer Science, vol 1762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46564-2_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-46564-2_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67100-8

  • Online ISBN: 978-3-540-46564-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics