?
First-order rewritability of ontology-mediated queries in linear temporal logic
Artificial Intelligence. 2021. Vol. 299. Article 103536.
Artale A., Kontchakov R., Kovtunova A., Wolter F., Ryzhikov V., Zakharyaschev M.
We investigate ontology-based data access to temporal data. We consider temporal ontologies given in linear temporal logic LTL interpreted over discrete time . Queries are given in LTL or , monadic first-order logic with a built-in linear order. Our concern is first-order rewritability of ontology-mediated queries (OMQs) consisting of a temporal ontology and a query. By taking account of the temporal operators used in the ontology and distinguishing between ontologies given in full LTL and its core, Krom and Horn fragments, we identify a hierarchy of OMQs with atomic queries by proving rewritability into either , first-order logic with the built-in linear order, or , which extends with the standard arithmetic predicates , for any fixed , or , which extends with relational primitive recursion. In terms of circuit complexity, - and -rewritability guarantee OMQ answering in uniform and, respectively, .
We obtain similar hierarchies for more expressive types of queries: positive LTL-formulas, monotone - and arbitrary -formulas. Our results are directly applicable if the temporal data to be accessed is one-dimensional; moreover, they lay foundations for investigating ontology-based access using combinations of temporal and description logics over two-dimensional temporal data.
Publication based on the results of:
Aleksei Samarin, Nazarenko A., Nazarenko D. et al., Machine Learning and Knowledge Extraction 2026 Vol. 8 No. 10 Article 330
Automated microscopic image analysis is essential for quantitative microbiology, yet manual acquisition and generic recognition models struggle with morphological variability and scene artifacts. We address both ends of this pipeline. First, we present a low-cost, open-source acquisition system, based on an Arduino UNO R3 microcontroller and NEMA 17 stepper motors, that automates focusing, magnification, and ...
Added: October 14, 2026
Mamedov I., Fofanov M., Lukianchenko P. et al., IEEE Access 2026 No. 14 P. 26662–26671
DreamBooth-style personalization, which often relies on one or a few images, can memorize context (background, pose, lighting) rather than learning the subject’s identity, thereby reducing fidelity and limiting prompt-driven edits. P-LoRA (Probability LoRA) is introduced as a training-time modification that biases diffusion timestep sampling and utilizes importance weights, ensuring that the overall objective remains unchanged. ...
Added: October 14, 2026
Parkhomenko V., Kulikova S., Buzmakov A. V., Lobachevskii Journal of Mathematics 2026 Vol. 47 No. 6 P. 2979–2992
The stability of formal concepts and its generalization as robustness are considered in the paper. We use an approximation of stability in the form of Δ-measure for fast calculations. A computationally efficient method for calculating robustness based on subcontexts is presented. We also present a new method to analytically evaluate the number of preimages for ...
Added: October 14, 2026
Kuznetsov A. P., Sedova Y. V., Sataev I. R. et al., Mathematics and Computers in Simulation 2027 Vol. 2 P. 574–592
Universal bifurcation structures on the parameter plane of nonlinear systems, known as shrimps, are discussed. An overview of numerous examples from various fields of science is given. Shrimps are typical for both maps of different dimensions and flows. The varieties of shrimp are discussed and relevant examples are given. The similarity property on the parameter ...
Added: October 14, 2026
Springer, 2026.
This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students and practitioners a unique update on the latest advances in theory and a multitude of applications. It presents the peer-reviewed proceedings of the XIV International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2025). The carefully selected papers cover ...
Added: October 13, 2026
Springer, 2026.
This book offers a comprehensive overview of the latest research, innovations, and practical applications in the field of sustainability, with a focus on construction materials and their use in building and civil engineering structures. As an outcome of the 3rd International Conference on Sustainability: Developments and Innovations (ICSDI 2026), this book presents a selection of ...
Added: October 13, 2026
Dmitriev A., Kornilov V., Batienkov R., Lecture Notes in Civil Engineering 2026 Vol. 886 P. 249–255
Numerous studies have provided compelling evidence that the probability distribution of avalanche sizes follows a power law, and that 1/f noise is present in the stochastic dynamics of landslides. We present a theoretical explanation of these phenomena within the framework of self-organized criticality theory, proposing a discrete-time model in the form of a sandpile cellular ...
Added: October 13, 2026
Dmitriev A., Shulman I., Lebedev A., Studies in Computational Intelligence 2026 Vol. 1265 P. 266–273
A discrete-time model is presented for the self-organization of the X/Twitter social network to the edge of a phase transition, characterized by avalanche-like propagation of information in the network. The model is based on the analogy between the critical dynamics of the X social network and sandpile cellular automata with Manna rule on the Chung-Lu ...
Added: October 13, 2026
Makarov D. M., Kalikin N., Fashchevsky K. A. et al., Electrochimica Acta 2026 Vol. 579 Article 150159
Machine learning (ML) has become a powerful tool for accelerating the development of carbon-based supercapacitors;
however, most published models assume that a single predictive framework can describe both conventional
porous carbons and hybrid carbon electrodes. Here, we test this assumption using a comprehensive
benchmark dataset and an extended literature-curated dataset enriched with synthesis- and electrolyte-related
descriptors. Three ML algorithms ...
Added: October 13, 2026
Zhang Z., Ilvovsky D., Information Processing and Management 2026 Vol. 63 No. 7
Transformer-based Large Language Models (LLMs) rely on Key-Value (KV) cache to accelerate autoregressive decoding, but memory and compute requirements still grow with context length, limiting deployment on resource-constrained devices. Existing training-free KV cache compression methods mainly rely on attention-driven retention heuristics, which may under preserve structurally informative tokens under tight cache budgets, especially when such ...
Added: October 13, 2026
Gusein-Zade S., Campillo A., Delgado F., Mathematische Zeitschrift 2026 Vol. 314 No. 1 P. 1–22
For a subfield $\K$ of the field $\C$ of complex numbers, we consider curve and divisorial valuations on the algebra $\K[[x,y]]$ of formal power series in two variables with the coefficients in $\K$. We compute the semigroup Poincar\'e series and the classical Poincar\'e series of a (discrete, rank one) valuation on it. ...
Added: October 13, 2026
No Species Is an Island, Entire of Itself: Genetic Speciation Algorithm with Interplay among Species
Gromov V., Sohrabi M., Fathollahi-Fard A., International Journal of Engineering, Transactions B: Applications 2027 Vol. 40 No. 5 P. 1437–1460
This paper, with a particular emphasis on Genetic Algorithm (GA), proposes a novel approach that integrates clustering mechanisms, predator-prey dynamics, and a distinctive selection strategy for generating subsequent populations. The proposed evolutionary algorithm, referred to as Genetic Speciation Algorithm with Interplay Among Species (GSAIS), is comprehensively evaluated against several variants of GAs as well as ...
Added: October 12, 2026
Mishuris G., Meylan M. H., Pelinovsky E., Journal of Fluid Mechanics 2026 Vol. 1045 Article A4
In this paper, we revisit the classic problem of a wave field on a sloping beach of an arbitrary angle and propose a general approach that allows the computation of regular solutions of the problem regardless of the angle. We use the Mellin-transform technique, reducing the problem to singular integral equations with fixed-point singularities of ...
Added: October 12, 2026
Alexandrov D., Vasilevsky V., Rezunik L. et al., Труды Института системного программирования РАН 2026 Т. 38 № 5 С. 73–90
Large language models demonstrate limitations in tasks that require precise information retrieval from very long input sequences. This limitation affects code generation in large object-oriented systems, where correctness depends on complex inter-class dependencies and the analysis of long execution traces that exceed standard context window sizes. This paper presents JavaCapsule, a technology for automated generation ...
Added: October 12, 2026
Singapore: Springer, 2026.
This volume presents the Proceedings of the 34th IUPAP Conference on Computational Physics (CCP2023), held in Kobe, Japan on August 4–8, 2023. It offers a collection of peer-reviewed articles that highlight recent developments in computational and simulation research across various areas of physics. Key topics include the use of data science, quantum computing, and machine ...
Added: October 12, 2026
Gusein-Zade S., М.: МЦНМО, 2026.
Книга содержит курс лекций по дифференциальной геометрии и топологии, читавшихся автором на механико-математическом факультете МГУ в разные годы. В дополнениях приводятся некоторые сюжеты (связности в расслоениях, теорема Фробениуса, производные Ли и др.), которые были включены в курс в отдельные годы либо содержались в аналогичных курсах лекций в Независимом московском университете.
Для студентов математических и физических специальностей. ...
Added: October 12, 2026
Zykov S. V., Ермаков С. Р., Современные наукоемкие технологии 2026 № 9 С. 43–53
При федеративном обучении с неоднородными клиентскими данными и переменными задержками запоздавшие обновления могут ухудшать качество модели, а обмен параметрами с глобальным сервером увеличивает сетевую нагрузку. Целью исследования является разработка и теоретико-экспериментальное обоснование метода и алгоритмов адаптивного федеративного обучения с учетом распределенного запаздывания клиентских обновлений. Для обоснования разрабатываемых решений использованы событийная и непрерывная модели градиентных обновлений, ...
Added: October 11, 2026
Брычков М. Е., Незнанов А.А., Программирование 2026 № 4 С. 50–66
The matrix profile (MP) quickly became one of the most important time series preprocessing methods when it was introduced in 2016, facilitating the solution of a wide range of time series analysis problems, in particular anomaly and pattern detection problems. The high significance has led to the emergence of various tools for MP calculating, but ...
Added: October 9, 2026
М.: Юрайт, 2026.
The Collection of Olympiad Problems (COP) in Probability Theory and Mathematical Statistics (PTMS) is offered as a teaching aid primarily for university students and faculty as a developmental supplementary resource, expanding the range of problems to be solved in lectures, seminars, and out-of-class independent work with students in various formats, including (as the title suggests) ...
Added: October 9, 2026
Aleskerov F. T., Вайншток А. П., Делахова А. М. et al., Информационные процессы 2026 Т. 26 № 3 С. 895–913
The development and effective management of territorial entities are priority issues for all states, particularly in the context of the digital transformation of public administration. Over the past decade, the integration of information technologies into municipal and regional planning has significantly altered approaches to strategic development, service delivery, and public engagement. This paper describes the ...
Added: October 9, 2026
Gerasimova O., Kikot S., Podolskii V. V. et al., Artificial Intelligence 2022 Vol. 309 Article 103738
Our concern is the problem of efficiently determining the data complexity of answering queries mediated by description logic ontologies and constructing their optimal rewritings to standard database queries. Originated in ontology-based data access and datalog optimisation, this problem is known to be computationally very complex in general, with no explicit syntactic characterisations available. In this ...
Added: May 30, 2022
Rybakov M., Shkatov D., , in: Proceedings of the Annual Conference of the South African Institute of Computer Scientists and Information Technologists.: NY: ACM, 2018. P. 313–316.
It is known that both satisfiability and model-checking problems for propositional Linear-time Temporal Logic, LTL, with only a single propositional variable in the language are PSPACE-complete, which coincides with the complexity of these problems for LTL with an arbitrary number of propositional variables. In the present paper, we show that the same result can be ...
Added: October 6, 2019
Podolskii V. V., Zakharyaschev M., Bienvenu M. et al., , in: Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems* F127745.: ACM, 2017. P. 201–216.
Our concern is the overhead of answering OWL 2QL ontology-mediated queries (OMQs) in ontology-based data access compared to evaluating their underlying tree-shaped and, more generally, bounded treewidth conjunctive queries (CQs). We show that OMQs with bounded depth ontologies have nonrecursive datalog (NDL) rewritings that can be constructed and evaluated in LOGCFL for combined complexity, and ...
Added: September 17, 2017