On termination of transactions over semantic document models

DOI10.26516/1997-7670.2020.31.111zbMath1432.68114arXiv2002.05064OpenAlexW3010873653MaRDI QIDQ2307928

Denis Konstantinovich Ponomarëv, Andreĭ Valer'evich Mantsivoda

Publication date: 25 March 2020

Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2002.05064

zbMATH Keywords

transactionchasesemantic modelingdocument model

Mathematics Subject Classification ID

Database theory (68P15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• On the complexity of formulas in semantic programming
• Conditional terms in semantic programming
• Semantic probabilistic inference of predictions
• Document models
• Recursive terms in semantic programming
• Locally simple models construction: methodology and practice
• Σ-programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On termination of transactions over semantic document models