An efficient algorithm for testing the truth of assertions for real numbers expressed in relational signatures
Автор: Kovartsev Alexandr
Журнал: Компьютерная оптика @computer-optics
Рубрика: Обработка изображений: Восстановление изображений, выявление признаков, распознавание образов
Статья в выпуске: 3 т.38, 2014 года.
Бесплатный доступ
In this paper a new efficient algorithm is proposed for testing the truth of assertions for real numbers expressed in relational signatures. In contrast to the well known Tarski algorithm, the proposed algorithm reduces the search problem of checking the truth of any assertion for real numbers to the optimization problem. The new version of the algorithm can be used for algebraic and transcendental functions.
Predicate derivation, tarski theorem, closed formula, the proof of the truth, global optimization, algorithm complexity
Короткий адрес: https://sciup.org/14059274
IDR: 14059274
