Referential data structures and labeled modal logic

  • Sergei Artëmov
  • Vladimir Krupski
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 813)

Abstract

We introduce reference structures — a basic logical model of a computer memory organization capable to store and utilize information about its addresses. The corresponding labeled modal logics are axiomatized and supplied with the completeness and decidability theorems. A labeled modal formula can be regarded as a description of a certain reference structure; the satisfiability algorithm gives a method of building and optimizing reference structures satisfying a given formula.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    S. Artëmov and T. Strassen. Functionality in the Basic Logic of Proofs. Technical report IAM 93-004, Universität Bern, January, 1993.Google Scholar
  2. [2]
    J.-L.Lasser, M.J.Maher and K.Marriot. Unification revisited. In: “Foundations of Deductive Databases and Logic Programming” J.Minker (Ed.), Morgan Kauffman, pp.587–626, 1987.Google Scholar
  3. [3]
    S. Artëmov. Logic of proofs. Annals of Pure and Applied Logic, v.67, 1994 (to appear).Google Scholar

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • Sergei Artëmov
    • 1
  • Vladimir Krupski
    • 2
  1. 1.Steklov Mathematical InstituteMoscowRussia
  2. 2.Department of MathematicsMoscow State UniversityMoscowRussia

Personalised recommendations