Improved Resolution-Based Method for Satisfiability Checking Formulas of the Language L
The language L is used for specifying finite automata, and is a fragment of a first order language with monadic predicates. Checking specification 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. This has been done in previous papers devoted to R- and S-resolution. In this paper, we present yet another improvement based on the restriction of the type of atoms upon which the resolution is allowed.
Unable to display preview. Download preview PDF.
- 1.Chebotarev, A.: Provably-correct development of reactive algorithms. In: Proc. Int. Workshop ”Rewriting Techniques and Efficient Theorem Proving” (RTETP-2000), pp. 117–133 (2000)Google Scholar
- 4.Chebotarev, A.N., Morokhovets, M.K.: Consistency checking of automata functional specifications. In: Voronkov, A. (ed.) LPAR 1993. LNCS, vol. 698, pp. 76–85. Springer, Heidelberg (1993)Google Scholar