A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Compiling flang
[chapter]

1992
*
Lecture Notes in Computer Science
*

The problems of compilation of a functional-logic language Flang axe considered. A new phase of compilation -global dataflow analysis -is discussed. It is shown that this phase can extremely improve the performance of a produced code. For some benchmarks a code which is produced by the Flang compiler has about the same speed as the speed of corresponding Pascal programs.

doi:10.1007/3-540-55984-1_27
fatcat:rwuc7yvilzhfvce6nzuoe4jiga
##
###
The Inverse Method for Many-Valued Logics
[chapter]

2013
*
Lecture Notes in Computer Science
*

We define an automatic proof procedure for finitely manyvalued logics given by truth tables. The proof procedure is based on the inverse method. To define this procedure, we introduce so-called introduction-based sequent calculi. By studying proof-theoretic properties of these calculi we derive efficient validity-and satisfiability-checking procedures based on the inverse method. We also show how to translate the validity problem for a formula to unsatisfiability checking of a set of

doi:10.1007/978-3-642-45114-0_2
fatcat:5nwikrulrrcynelpndcsn7jpry
## more »

... al clauses. We acknowledge funding from the Austrian FWF grant S11410-N23 and the Austrian WWTF grant ICT C-050. Suppose that γ = s 1 , . . . , s m . Define the set C(γ) of clauses consisting of clauses of three kinds:##
###
A Query Language for Logic Architectures
[chapter]

2010
*
Lecture Notes in Computer Science
*

In this paper we consider the impact of the Semantic Web and logical means on a wide range of developers solving traditional tasks on the WWW. How to make the 'elite' logic tools acceptable for ordinary developers? How to incorporate a wide range of users in the space of the Semantic Web? These and some other questions are considered here and certain proposals are made. In particular we are based on the conception of a logic architecture as a stratified description logic system, and introduce

doi:10.1007/978-3-642-11486-1_25
fatcat:z2k2rqqecbaspjjb74q2dwcho4
## more »

... ontology query language working within logic architectures.##
###
On Termination of Transactions over Semantic Document Models
[article]

2020
*
arXiv
*
pre-print

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.

arXiv:2002.05064v4
fatcat:ivgo7bvarbagrjwwdi2zobblcu
##
###
Page 1037 of Mathematical Reviews Vol. , Issue 94b
[page]

1994
*
Mathematical Reviews
*

AND-parallelism (191-198); Jan Treur, Declarative functional- ity descriptions of interactive reasoning modules (221-236); Yves Caseau, Rule-aided constraint resolution in LAURE (237-256);

*Andrei*V. ...*Mantsivoda*, Flang: a functional-logic language (257- 270); Philippe Balbiani, Andreas Herzig and Mamede Lima Mar- ques, TIM: the Toulouse inference machine for nonclassical logic programming (366-382). ...##
###
Page 1289 of Mathematical Reviews Vol. , Issue 96c
[page]

1996
*
Mathematical Reviews
*

*Mantsivoda*, The semantics of Flang, 26-30; Aart Middeldorp and Hans Zantema, Simple termination of rewrite systems, 31-36; Vladimir V. ... equilibrium, 6-12; Richard Kennaway, Jan-Willem Klop, Ronan Sleep and Fer-Jan de Vries, From finite to infinite lambda calculi, 13-20; Larisa Maksimova, On variable separation in modal logics, 21-25;

*Andrei*...

##
###
Solution of the Problem P = L

2021
*
Mathematics
*

*Mantsivoda*and Ponomaryov formalized this approach in their work [6] . This language is simple and efficient. All operations and relations are polynomial. ...

*Mantsivoda*developed a logical programming language based on document models. Documents are the main elements of the model universe. Special functions are defined for working with them. ...

##
###
Locally Simple Models Construction: Methodology and Practice

Построение локально-простых моделей: методология и практика

2017
*
Известия Иркутского государственного университета: Серия "Математика"
*

Построение локально-простых моделей: методология и практика

Академика Коптюга, 4, (e-mail:

doi:10.26516/1997-7670.2017.22.71
fatcat:xvcsn3ie2vbm3oghv6zcuoqo4u
*andrei*@baikal.ru) I. A. Kazakov, I. A. Kustova, E. N. Lazebnikova, A. V.*Mantsivoda*Locally Simple Models Construction: Methodology and Practice ...##
###
Page 773 of Mathematical Reviews Vol. , Issue Index
[page]

*
Mathematical Reviews
*

ISBN 9971-50-023-4 (Ladislav

*Andrey*) 91e:82031 82B30 (00A69, 82C35, 93A10, 94A15) Manstavitius, Eugenijus A nonuniform estimate in the central limit theorem for additive functions. (Russian. ... (Summary) 91k:81099 81T13 (81T20)*Mantsivoda*, A. V. Invariance of -transformations of formulas. (Russian) Algebraic systems. Algorithmic problems and the computer (Russian), 63-68, 174, Irkutsk. Gos. ...