Various incremental evaluation strategies for Datalog have been developed that reuse computations for small input changes. These methods assume that incrementalization is …
VB Melekhin - Journal of Computer and Systems Sciences …, 2019 - Springer
The model for the representation of declarative and procedural knowledge of an autonomous intelligent robot is developed without reference to a specific subject area. The …
K Ma, L Xiao, J Zhang, T Li - Chinese Journal of Electronics, 2019 - Wiley Online Library
The Boolean Satisfiability (SAT) problem is the key problem in computer theory and application. Field‐programmable gate array (FPGA) has been addressed frequently to …
VB Melekhin, MV Khachumov - Scientific and Technical Information …, 2022 - Springer
This article shows that usually the automatic control system of autonomous flying robots based on unmanned aerial vehicles has limited computing resources, which makes it …
O Pichugina, O Matsyi - 2020 IEEE 15th International …, 2020 - ieeexplore.ieee.org
An SAT problem is attacked, which is one of the most fundamental problems in Computer Science. A number of algebraic reformulations of SAT are presented as problems of …