Усовершенствованный метод проверки выполнимости множества дизъюнктов в языке L.

The language $L$ is used for specifying finite automata, and is a fragment of a first order language with monadiс prediсates. Cheсking speсification for satisfiability plays an important role in the development of reactive algorithms. Restricted syntax of this language and interpreting it over the integers make it possible to substantially improve resolution-based methods for satisfiability checking. In this paper, we present an improvement to the method based on the restriction of the type of atoms upon which the resolution is allowed.