A Formalization of Document Models with Semantic Modelling

Mantsivoda, Andrei; Ponomaryov, Denis

doi:10.26516/1997-7670.2019.27.36

Cited by 7 publications

(10 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Section: Basics Of the Semantic Modelingmentioning

confidence: 99%

“…In this paper, we refine the formalization of the Document Modeling from [11] in the language of the Semantic Modeling extended with the above mentioned non-standard list terms. In particular, we obtain a more succinct formalization in comparison with [11]. Further in Section 3, we will introduce document theories, which formalize the key ingredients of the Document Modeling approach, and in the next section we describe conventions used in our formalization.…”

Section: Basics Of the Semantic Modelingmentioning

confidence: 99%

“…In [11], the ideas of the Document Modeling have been implemented in a logical framework in terms of the language of the Semantic Programming (aka Semantic Modeling) [1]. It has been shown that the approach of the Document Modeling implemented this way goes beyond the common capabilities of today's Business Process Management Systems.…”

Section: Introductionmentioning

confidence: 99%

“…The contributions of this work are as follows. We refine the formalization of the Document Modeling given in [11] and provide a more succinct formalization in an extension of the language of the Semantic Modelling with (non-standard) looping terms. We formulate the problem of transaction termination over document models and show that in general it is undecidable.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

On Termination of Transactions over Semantic Document Models

Mantsivoda¹,

Ponomaryov²

2020

Bull.ISU.Ser.Math.

Self Cite

View full text Add to dashboard Cite

We consider the framework of Document Modeling, which lays the formal basis for representing the document lifecycle in Business Process Management systems. We formulate document models in the scope of the logic-based Semantic Modeling language and study the question whether transactions given by a document model terminate on any input. We show that in general this problem is undecidable and formulate sufficient conditions, which guarantee decidability and polynomial boundedness of effects of transactions.

show abstract

Section: Basics Of the Semantic Modelingmentioning

confidence: 99%

Section: Basics Of the Semantic Modelingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On Termination of Transactions over Semantic Document Models

Mantsivoda¹,

Ponomaryov²

2020

Bull.ISU.Ser.Math.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Special functions are defined for working with them. Mantsivoda and Ponomaryov formalized this approach in their work [6]. This language is simple and efficient.…”

Section: Introductionmentioning

confidence: 99%

Solution of the Problem P = L

Goncharov

Nechesov

2021

Mathematics

View full text Add to dashboard Cite

The problems associated with the construction of polynomial complexity computer programs require new techniques and approaches from mathematicians. One of such approaches is representing some class of polynomial algorithms as a certain class of special logical programs. Goncharov and Sviridenko described a logical programming language L0, where programs inductively are obtained from the set of Δ0-formulas using special terms. In their work, a new idea has been proposed to look at the term as a program. The computational complexity of such programs is polynomial. In the same years, a number of other logical languages with similar properties were created. However, the following question remained: can all polynomial algorithms be described in these languages? It is a long-standing problem, and the method of describing some polynomial algorithm in a not Turing complete logical programming language was not previously clear. In this paper, special types of terms and formulas have been found and added to solve this problem. One of the main contributions is the construction of p-iterative terms that simulate the work of the Turing machine. Using p-iterative terms, the work showed that class P is equal to class L, which extends the programming language L0 with p-iterative terms. Thus, it is shown that L is quite expressive and has no halting problem, which occurs in high-level programming languages. For these reasons, the logical language L can be used to create fast and reliable programs. The main limitation of the language L is that the implementation of algorithms of complexity is not higher than polynomial.

show abstract

Disciplinary Routing as a Factor of Activization of Scientific Mobility

Zatsarinnyy

Shabanov

2022

Information Systems and Design

View full text Add to dashboard Cite

A Formalization of Document Models with Semantic Modelling

Cited by 7 publications

References 0 publications

On Termination of Transactions over Semantic Document Models

On Termination of Transactions over Semantic Document Models

Solution of the Problem P = L

Disciplinary Routing as a Factor of Activization of Scientific Mobility

Contact Info

Product

Resources

About