Efficient Models for Data Storage with References

Abstract

We introduce reference structures; a basic mathematical model of a data organization capable to store and utilize information about its addresses. A propositional labeled modal language is used as a specification and programming language for reference structures; the satisfiability algorithm for modal language gives a method of building and optimizing reference structures satisfying a given formula. Corresponding labeled modal logics are presented, supplied with cut free axiomatizations, completeness and decidability theorems are proved. Initialization of typed variables in some programming languages is presented as an example of a reference structure building.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1997
Accession Number
ADA344311

Entities

People

  • S. N. Artemov
  • V. Krupski

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • Computer Languages
  • Computer Programming
  • Computer Science
  • Computers
  • Data Storage Systems
  • Equations
  • Formal Languages
  • Intelligent Systems
  • Language
  • Mathematics
  • Models
  • Programming Languages
  • Specifications
  • Standards

Fields of Study

  • Computer science

Readers

  • Computational Linguistics
  • Operations Research