Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Data storage interpretation of labeled modal logic \Lambda
 

Summary: Data storage interpretation
of labeled modal logic \Lambda
Sergei Artšemov y
Steklov Mathematical Institute,
Vavilova str. 42,
Moscow, 117966 RUSSIA.
e­mail: sergei@artemov.mian.su
Vladimir Krupski z
Department of Mathematics
Moscow State University
Moscow 119899, RUSSIA
email: krupski@sci.math.msu.su
February 10, 1995
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 program­
ming language for reference structures; the satisfiability algorithm for modal
language gives a method of building and optimizing reference structures sat­
isfying a given formula. Corresponding labeled modal logics are presented,

  

Source: Artemov, Sergei N. - Faculty of Mechanics and Mathematics, Moscow State University

 

Collections: Computer Technologies and Information Sciences