Sciact
  • EN
  • RU

Object-Oriented Data via Prefix Rewriting. Part I: Overview and Main Results Full article

Journal Siberian Mathematical Journal
ISSN: 0037-4466 , E-ISSN: 1573-9260
Output data Year: 2026, Volume: 67, Number: 3, Pages: 531–547 Pages count : 17 DOI: 10.1134/S003744662603002X
Tags prefix rewriting, term rewriting, object-oriented data system, information system, consistency verification, ontology of a data model
Authors Gutman A.E. 1
Affiliations
1 Sobolev Institute of Mathematics, Novosibirsk, Russia

Funding (1)

1 Министерство науки и высшего образования РФ FWNF-2026-0022

Abstract: A deterministic longest-prefix rewriting system is a string-rewriting system such that there are no rewriting rules X→Y, X→Z with Y≠Z, and only the longest prefixes of words are subject to rewriting. For such a system, analogs of some concepts related to object-oriented data systems are defined and studied: inheritance of classes and objects, instances of classes, class and instance attributes, conceptual dependence and consistency, conceptual scheme, types and subtypes, etc. Special attention is paid to the effective verification of various properties of the rewriting systems under consideration.
Cite: Gutman A.E.
Object-Oriented Data via Prefix Rewriting. Part I: Overview and Main Results
Siberian Mathematical Journal. 2026. V.67. N3. P.531–547. DOI: 10.1134/S003744662603002X
Original: Гутман А.Е.
Объектно–ориентированные данные и префиксная перезапись. Часть I: Обзор и основные результаты
Сибирский математический журнал. 2026. Т.67. №3. С.392-413. DOI: 10.33048/smzh.2026.67.302
Dates:
Submitted: Jan 15, 2026
Accepted: Apr 7, 2026
Published online: Jun 15, 2026
Identifiers: No identifiers
Altmetrics: